2008 |
45 | EE | Joël Ouaknine,
James Worrell:
Some Recent Results in Metric Temporal Logic.
FORMATS 2008: 1-13 |
44 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
James Worrell:
On Expressiveness and Complexity in Real-Time Model Checking.
ICALP (2) 2008: 124-135 |
43 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
Ph. Schnoebelen,
James Worrell:
On Termination for Faulty Channel Machines.
STACS 2008: 121-132 |
42 | EE | Axel Legay,
Andrzej S. Murawski,
Joël Ouaknine,
James Worrell:
On Automated Verification of Probabilistic Programs.
TACAS 2008: 173-187 |
41 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
Ph. Schnoebelen,
James Worrell:
On Termination for Faulty Channel Machines
CoRR abs/0802.2839: (2008) |
40 | EE | Ranko Lazic,
Tom Newcomb,
Joël Ouaknine,
A. W. Roscoe,
James Worrell:
Nets with Tokens which Carry Data.
Fundam. Inform. 88(3): 251-274 (2008) |
39 | EE | Parosh Aziz Abdulla,
Johann Deneux,
Joël Ouaknine,
Karin Quaas,
James Worrell:
Universality Analysis for One-Clock Timed Automata.
Fundam. Inform. 89(4): 419-450 (2008) |
2007 |
38 | EE | Sara Adams,
Joël Ouaknine,
James Worrell:
Undecidability of Universality for Timed Automata with Minimal Resources.
FORMATS 2007: 25-37 |
37 | EE | Parosh Aziz Abdulla,
Joël Ouaknine,
Karin Quaas,
James Worrell:
Zone-Based Universality Analysis for Single-Clock Timed Automata.
FSEN 2007: 98-112 |
36 | EE | Ranko Lazic,
Thomas Christopher Newcomb,
Joël Ouaknine,
A. W. Roscoe,
James Worrell:
Nets with Tokens Which Carry Data.
ICATPN 2007: 301-320 |
35 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
James Worrell:
The Cost of Punctuality.
LICS 2007: 109-120 |
34 | EE | Randal E. Bryant,
Daniel Kroening,
Joël Ouaknine,
Sanjit A. Seshia,
Ofer Strichman,
Bryan A. Brady:
Deciding Bit-Vector Arithmetic with Abstraction.
TACAS 2007: 358-372 |
33 | EE | Joël Ouaknine,
James Worrell:
On the decidability and complexity of Metric Temporal Logic over finite words
CoRR abs/cs/0702120: (2007) |
32 | EE | Joël Ouaknine,
James Worrell:
On the decidability and complexity of Metric Temporal Logic over finite words.
Logical Methods in Computer Science 3(1): (2007) |
2006 |
31 | EE | Joël Ouaknine,
James Worrell:
On Metric Temporal Logic and Faulty Turing Machines.
FoSSaCS 2006: 217-230 |
30 | EE | Joël Ouaknine,
James Worrell:
Safety Metric Temporal Logic Is Fully Decidable.
TACAS 2006: 411-425 |
29 | EE | Gavin Lowe,
Joël Ouaknine:
On Timed Models and Full Abstraction.
Electr. Notes Theor. Comput. Sci. 155: 497-519 (2006) |
28 | EE | Murray Stokely,
Sagar Chaki,
Joël Ouaknine:
Parallel Assignments in Software Model Checking.
Electr. Notes Theor. Comput. Sci. 157(1): 77-94 (2006) |
27 | EE | Joël Ouaknine,
Steve Schneider:
Timed CSP: A Retrospective.
Electr. Notes Theor. Comput. Sci. 162: 273-276 (2006) |
2005 |
26 | EE | Andrzej S. Murawski,
Joël Ouaknine:
On Probabilistic Program Equivalence and Refinement.
CONCUR 2005: 156-170 |
25 | EE | Parosh Aziz Abdulla,
Johann Deneux,
Joël Ouaknine,
James Worrell:
Decidability and Complexity Results for Timed Automata via Channel Machines.
ICALP 2005: 1089-1101 |
24 | EE | Sagar Chaki,
Edmund M. Clarke,
Orna Grumberg,
Joël Ouaknine,
Natasha Sharygina,
Tayssir Touili,
Helmut Veith:
State/Event Software Verification for Branching-Time Specifications.
IFM 2005: 53-69 |
23 | EE | Joël Ouaknine,
James Worrell:
On the Decidability of Metric Temporal Logic.
LICS 2005: 188-197 |
22 | EE | Sagar Chaki,
Edmund M. Clarke,
Joël Ouaknine,
Natasha Sharygina,
Nishant Sinha:
Concurrent software verification with states, events, and deadlocks.
Formal Asp. Comput. 17(4): 461-483 (2005) |
21 | EE | Edmund M. Clarke,
Daniel Kroening,
Joël Ouaknine,
Ofer Strichman:
Computational challenges in bounded model checking.
STTT 7(2): 174-183 (2005) |
20 | EE | Joël Ouaknine:
Verification of Reactive Systems: Formal Methods and Algorithms. By Klaus Schneider. Springer, Texts in Theoretical Computer Science Series, 2004, ISBN: 3-540-00296-0, pp 600.
Softw. Test., Verif. Reliab. 15(3): 202-203 (2005) |
19 | EE | Franck van Breugel,
Michael W. Mislove,
Joël Ouaknine,
James Worrell:
Domain theory, testing and simulation for labelled Markov processes.
Theor. Comput. Sci. 333(1-2): 171-197 (2005) |
2004 |
18 | EE | Daniel Kroening,
Joël Ouaknine,
Sanjit A. Seshia,
Ofer Strichman:
Abstraction-Based Satisfiability Solving of Presburger Arithmetic.
CAV 2004: 308-320 |
17 | EE | Michael W. Mislove,
Joël Ouaknine,
Dusko Pavlovic,
James Worrell:
Duality for Labelled Markov Processes.
FoSSaCS 2004: 393-407 |
16 | EE | Sagar Chaki,
Edmund M. Clarke,
Joël Ouaknine,
Natasha Sharygina,
Nishant Sinha:
State/Event-Based Software Model Checking.
IFM 2004: 128-147 |
15 | EE | Joël Ouaknine,
James Worrell:
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.
LICS 2004: 54-63 |
14 | EE | Sagar Chaki,
Edmund M. Clarke,
Joël Ouaknine,
Natasha Sharygina:
Automated, compositional and iterative deadlock detection.
MEMOCODE 2004: 201-210 |
13 | EE | Edmund M. Clarke,
Daniel Kroening,
Joël Ouaknine,
Ofer Strichman:
Completeness and Complexity of Bounded Model Checking.
VMCAI 2004: 85-96 |
12 | EE | Keye Martin,
Joël Ouaknine:
Informatic vs. Classical Differentiation on the Real Line.
Electr. Notes Theor. Comput. Sci. 73: 133-140 (2004) |
11 | EE | Michael W. Mislove,
Joël Ouaknine,
James Worrell:
Axioms for Probability and Nondeterminism.
Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004) |
10 | EE | Sagar Chaki,
Edmund M. Clarke,
Alex Groce,
Joël Ouaknine,
Ofer Strichman,
Karen Yorav:
Efficient Verification of Sequential and Concurrent C Programs.
Formal Methods in System Design 25(2-3): 129-166 (2004) |
2003 |
9 | EE | Franck van Breugel,
Michael W. Mislove,
Joël Ouaknine,
James Worrell:
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.
FoSSaCS 2003: 200-215 |
8 | EE | Joël Ouaknine,
James Worrell:
Universality and Language Inclusion for Open and Closed Timed Automata.
HSCC 2003: 375-388 |
7 | EE | Joël Ouaknine,
James Worrell:
Revisiting Digitization, Robustness, and Decidability for Timed Automata.
LICS 2003: 198-207 |
6 | EE | Sagar Chaki,
Joël Ouaknine,
Karen Yorav,
Edmund M. Clarke:
Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach.
Electr. Notes Theor. Comput. Sci. 89(3): (2003) |
5 | EE | Edmund M. Clarke,
Ansgar Fehnker,
Zhi Han,
Bruce H. Krogh,
Joël Ouaknine,
Olaf Stursberg,
Michael Theobald:
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems.
Int. J. Found. Comput. Sci. 14(4): 583-604 (2003) |
4 | | Joël Ouaknine,
James Worrell:
Timed CSP = Closed Timed epsilon-automata.
Nord. J. Comput. 10(2): 99-133 (2003) |
2002 |
3 | EE | Joël Ouaknine:
Digitisation and Full Abstraction for Dense-Time Model Checking.
TACAS 2002: 37-51 |
2 | EE | Joël Ouaknine,
James Worrell:
Timed CSP = Closed Timed Safety Automata.
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
1999 |
1 | | Joël Ouaknine,
George M. Reed:
Model-Checking Temporal Behaviour in CSP.
PDPTA 1999: 295-304 |