The advent of ever more complex reactive systems in increasingly critical areas calls for the
development of automated verification techniques. Model checking is one such technique …

Completeness is an ideal, although uncommon, feature of abstract interpretations,
formalizing the intuition that, relatively to the properties encoded by the underlying abstract …

In quantum computing, the basic unit of information is a qubit. Simulation of a general
quantum program takes exponential time in the number of qubits, which makes simulation …

Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators
from a uniform complexity assumption on EXP (namely EXP≠ BPP). Unlike results in the …

We present a method for the compositional construction of the minimal transition system that
represents the semantics of a given distributed system. Our aim is to control the state …

A new model for message-passing processes is proposed which generalizes the notion of
symbolic transition graph as introduced in [HL95], by allowing assignments to be carried in …

This paper presents a formal behavioural specification framework for specifying and
verifying the correct behaviour of distributed Fractal components. The first contribution is a …

Control code obfuscation is intended to prevent malicious reverse engineering of software
by masking the program control flow. These obfuscating transformations often rely on the …

Abstract interpretation, Hoare logic, and incorrectness (or reverse Hoare) logic are powerful
techniques for static analysis of computer programs. They have all been successfully …

Software for, and a method of using a computer for, Speci fying and Verifying Synchronous
and asynchronous concur rent Systems. The method comprises Specifying Software in a …