#### Filter Results:

- Full text PDF available (116)

#### Publication Year

1999

2017

- This year (5)
- Last 5 years (61)
- Last 10 years (94)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also integrates two powerful verification techniques, counterexample-guided abstraction refinement and compositional reasoning. Our specification language is a state/event extension of linear… (More)

We study data nets, a generalisation of Petri nets in which tokens carry data from linearly-ordered infinite domains and in which whole-place operations such as resets and transfers are possible. Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems and polymorphic systems with arrays. We show that… (More)

- Joël Ouaknine, James Worrell
- 20th Annual IEEE Symposium on Logic in Computer…
- 2005

Metric temporal logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a… (More)

- Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman
- VMCAI
- 2004

For every finite model M and an LTL property ϕ, there exists a number CT (the Completeness Threshold) such that if there is no counterexample to ϕ in M of length CT or less, then M |= ϕ. Finding this number, if it is sufficiently small, offers a practical method for making Bounded Model Checking complete. We describe how to compute an over-approximation to… (More)

- Björn Wachter, Daniel Kroening, Joël Ouaknine
- FMCAD
- 2013

—Lazy abstraction with interpolants, also known as the Impact algorithm, is en vogue as a state-of-the-art software model-checking technique for sequential programs. However, a direct extension of the Impact algorithm to concurrent programs is bound to be inefficient as it has to explore all thread interleavings, which leads to control-state explosion. To… (More)

- Joël Ouaknine
- FCT
- 2012

Linear recurrence sequences (LRS), such as the Fibonacci numbers, permeate vast areas of mathematics and computer science. In this talk, we consider three natural decision problems for LRS, namely the Skolem Problem (does a given LRS have a zero?), the Positivity Problem (are all terms of a given LRS positive?), and the Ultimate Positivity Problem (are all… (More)

- Joël Ouaknine, James Worrell
- Logical Methods in Computer Science
- 2007

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a… (More)

- Joël Ouaknine, James Worrell
- FORMATS
- 2008

Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model checking problems for fragments of MTL with respect to different semantic models. We show that these fragments have widely differing complexities: from polynomial space to… (More)

- Joël Ouaknine, James Worrell
- TACAS
- 2006

Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of expressing properties such as invariance and time-bounded response. Our main result is that the satisfiability problem for Safety MTL is decidable. This is the first positive decidability… (More)

- Joël Ouaknine
- 2000

This thesis concerns the relationship between continuous and discrete modelling paradigms for timed concurrent systems, and the exploitation of this relationship towards applications, in particular model checking. The framework we have chosen is Reed and Roscoe's process algebra Timed CSP, in which semantic issues can be examined from both a denotational… (More)