#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2004

2012

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Greta Yorsh, Alexander Moshe Rabinovich, Shmuel Sagiv, Antoine Meyer, Ahmed Bouajjani
- J. Log. Algebr. Program.
- 2006

We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The main feature of this logic is the ability to limit the neighborhood of a node that is reachable via a regular expression from a designated node. The logic is closed under boolean… (More)

- Ahmed Bouajjani, Antoine Meyer
- FSTTCS
- 2004

We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA processes) where each process manipulates a data structure which can be seen as a nested stack of stacks. Our main result is that, for any higher-order context-free process, the set… (More)

- François Laroussinie, Antoine Meyer, Eudes Petonnet
- TIME
- 2010

This paper presents a quantitative extension for the linear-time temporal logic LTL allowing to specify the number of states satisfying certain sub-formulas along paths. We give decision procedures for the satisfiability and model checking of this new temporal logic and study the complexity of the corresponding problems. Furthermore we show that the… (More)

- François Laroussinie, Antoine Meyer, Eudes Petonnet
- FOSSACS
- 2010

This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying certain sub-formulas along paths. By selecting the combinations of Boolean and arithmetic operations allowed in constraints, one obtains several distinct logics generalizing CTL. We… (More)

- Arnaud Carayol, Antoine Meyer
- Logical Methods in Computer Science
- 2006

We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an initial vertex to a final vertex. In 2001, Morvan and Stirling proved that rational graphs accept the context-sensitive… (More)

- Antoine Meyer
- MFCS
- 2007

In formal language theory, many families of languages are defined using either grammars or finite acceptors. For instance, context-sensitive languages are the languages generated by growing grammars, or equivalently those accepted by Turing machines whose work tape’s size is proportional to that of their input. A few years ago, a new characterisation of… (More)

- Antoine J H Meyer, Thorsten Krueger, +4 authors Hans-Beat Ris
- The Annals of thoracic surgery
- 2004

BACKGROUND
Prospective assessment of pedicled extrathoracic muscle flaps for the closure of large intrathoracic airway defects after noncircumferential resection in situations where an end-to-end reconstruction seemed risky (defects of > 4-cm length, desmoplastic reactions after previous infection or radiochemotherapy).
METHODS
From 1996 to 2001, 13… (More)

- Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre
- 2008 23rd Annual IEEE Symposium on Logic in…
- 2008

In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested "stack of stacks" structures. Representing higher-order stacks as well-bracketed words in the usual way, we show that the winning regions of these games are regular sets of words.… (More)

- Nutan Limaye, Meena Mahajan, Antoine Meyer
- CSR
- 2008

Visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages. The complexity of their membership problem is equivalent to that of regular languages. However, the corresponding counting problem – computing the number of accepting paths in a visibly pushdown automaton – could be harder… (More)

- Antoine Meyer
- 2004

Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to study the derivation relation of such systems (i.e. the reflexive and transitive closure of their rewriting relation)… (More)