#### Filter Results:

- Full text PDF available (123)

#### Publication Year

1988

2017

- This year (8)
- Last 5 years (35)
- Last 10 years (67)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ahmed Bouajjani, Javier Esparza, Oded Maler
- CONCUR
- 1997

We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systems by means of nite state automata In order to reason in a uniform way about analysis problems involving both existential and universal path quanti ca tion such as model checking for branching time logics we consider the more general… (More)

- Claire Loiseaux, Susanne Graf, Joseph Sifakis, Ahmed Bouajjani, Saddek Bensalem
- Formal Methods in System Design
- 1995

We study property preserving transformations for reactive systems The main idea is the use of simulationsparameterizedbyGalois connections relating the lattices of properties of two systems We propose and study a notion of preservation of properties expressed by formulas of a logic by a function mapping sets of states of a system S into sets of states of a… (More)

- Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili
- International Journal on Software Tools for…
- 2000

Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.

- Ahmed Bouajjani, Javier Esparza, Tayssir Touili
- Int. J. Found. Comput. Sci.
- 2003

We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow problems for this model are undecidable, because the emptiness problem for the intersection of context-free languages, which is undecidable, can be reduced to them. In this paper… (More)

We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages… (More)

- Ahmed Bouajjani, Markus Müller-Olm, Tayssir Touili
- CONCUR
- 2005

We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models. More precisely, we consider the problem of computing effective representations of their reachability sets using finite-state automata. We show that, while forward reachability… (More)

- Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson
- Formal Methods in System Design
- 2004

We consider symbolic on-they veriication methods for systems of nite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages… (More)

- Stavros Tripakis, Sergio Yovine, Ahmed Bouajjani
- Formal Methods in System Design
- 2005

This paper presents an on-the-fly and symbolic technique for efficiently checking timed automata emptiness. It is symbolic because it uses the simulation graph (instead of the region graph). It is on-the-fly because the simulation graph is generated during the test for emptiness. We have implemented a verification tool called PROFOUNDER based on this… (More)

- Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
- International Journal on Software Tools for…
- 2006

Regular model checking is a generic technique for verification of infinite-state and/or parametrised systems which uses finite word automata or finite tree automata to finitely represent potentially infinite sets of reachable configurations of the systems being verified. The problems addressed by regular model checking are typically undecidable. In order to… (More)