#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1991

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Witold Charatonik, Andreas Podelski
- Inf. Comput.
- 1997

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)

- Witold Charatonik, Andreas Podelski
- RTA
- 1998

- Witold Charatonik, Andreas Podelski
- SAS
- 1998

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)

- Witold Charatonik, Jean-Marc Talbot
- CSL
- 2001

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)

- Roberto M. Amadio, Witold Charatonik
- CONCUR
- 2002

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)

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)

- Witold Charatonik, Andreas Podelski
- TACAS
- 1998

- Witold Charatonik, Piotr Witkowski
- 2013 28th Annual ACM/IEEE Symposium on Logic in…
- 2013

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)

We investigate a class of set constraints that is used for the type analysis of concurrent constraint programs. Its constraints are inclusions between rst-order terms (without set operators) interpreted over non-empty sets of nite trees. We show that this class has the independence property. We give a polynomial algorithm for entailment. The independence… (More)

We present an automated method for the static prediction of the runtime error`deadlock or failure' in concurrent constraint programs. Operationally, the method is based on a new set-based analysis of reactive logic programs which computes an approximation of the greatest-model semantics. Semantically , the method is based on the connection between the… (More)