#### Filter Results:

#### Publication Year

1991

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We follow the set-based approach to directional types proposed by Aiken and Lakshman1]. Their type checking algorithm works via set constraint solving and is sound and complete for given discriminative types. We characterize directional types in model-theoretic terms. We present an algorithm for inferring directional types. The directional type that we… (More)

We study the control reachability problem in the Dolev-Yao model of cryptographic protocols when principals are represented by tail recursive processes with generated names. We propose a conservative approximation of the problem by reduction to a non-standard collapsed operational semantics and we introduce checkable syntactic conditions entailing the… (More)

The ambient calculus is a formalism for describing the mobility of both software and hardware. The ambient logic is a modal logic designed to specify properties of distributed and mobile computations programmed in the ambient calculus. In this paper we investigate the border between decidable and undecid-able cases of model checking mobile ambients for some… (More)

We define a finite-control fragment of the ambient calculus, a formalism for describing distributed and mobile computations. A series of examples demonstrates the expressiveness of our fragment. In particular, we encode the choice-free, finite-control, synchronous π-calculus. We present an algorithm for model checking this fragment against the ambient logic… (More)

We consider the two-variable logic with counting quantifiers (C<sup>2</sup>) interpreted over finite structures that contain two forests of ranked trees. This logic is strictly more expressive than standard C<sup>2</sup> and it is no longer a fragment of first-order logic. In particular, it can express that a structure is a ranked tree, a cycle, or a… (More)

Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. In this paper we prove that the problem of existence of a solution of a system of set constraints with projections is in NEX-PTIME, and thus that it is NEXPTIME-complete. This extends the result of A. on… (More)

Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis and type inference. So far two proofs of decidability of mixed set constraints have been given: However, both these proofs are long, involved and do not seem to extend to more general set constraints. Our approach is based on a… (More)

Set constraints are inclusions between expressions denoting sets of trees. The eeciency of their satissabil-ity test is a central issue in set-based program analysis , their main application domain. We introduce the class of set constraints with intersection (the only operators forming the expressions are constructors and intersection) and show that its… (More)

We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free calculus and guarantee-free logic we prove that the problem… (More)