DBLP: Joël Ouaknine

	2013
j24		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Logical Methods in Computer Science 9(1) (2013)
c49		Joël Ouaknine: Discrete Linear Dynamical Systems. LATA 2013: 42
i10		Ventsislav Chonev, Joël Ouaknine, James Worrell: The Orbit Problem in Higher Dimensions. CoRR abs/1303.2981 (2013)
i9		Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: A Static Analysis Framework for Livelock Freedom in CSP. CoRR abs/1304.7394 (2013)
	2012
j23		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6): 595-607 (2012)
j22		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Three tokens in Herman's algorithm. Formal Asp. Comput. 24(4-6): 671-678 (2012)
j21		Hristina Palikareva, Joël Ouaknine, A. W. Roscoe: SAT-solving in CSP trace refinement. Sci. Comput. Program. 77(10-11): 1178-1197 (2012)
c48		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: APEX: An Analyzer for Open Probabilistic Programs. CAV 2012: 693-698
c47		Philip J. Armstrong, Michael Goldsmith, Gavin Lowe, Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Recent Developments in FDR. CAV 2012: 699-704
c46		Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420
c45		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481
c44		Daniel Bundala, Joël Ouaknine, James Worrell: On the Magnitude of Completeness Thresholds in Bounded Model Checking. LICS 2012: 155-164
c43		Joël Ouaknine, James Worrell: Decision Problems for Linear Recurrence Sequences. RP 2012: 21-28
c42		Christoph Haase, Joël Ouaknine, James Worrell: On the Relationship between Reachability Problems in Timed and Counter Automata. RP 2012: 54-65
i8		Paul Hunter, Joël Ouaknine, James Worrell: Expressive Completeness of Metric Temporal Logic. CoRR abs/1208.4993 (2012)
i7		Paul Hunter, Joël Ouaknine, James Worrell: When is Metric Temporal Logic Expressively Complete? CoRR abs/1209.0516 (2012)
i6		Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012)
	2011
j20		Michael W. Mislove, Joël Ouaknine: Preface. Electr. Notes Theor. Comput. Sci. 276: 1-3 (2011)
c41		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Language Equivalence for Probabilistic Automata. CAV 2011: 526-540
c40		Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell: Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572
c39		Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell: Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249
c38		Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Static Livelock Analysis in CSP. CONCUR 2011: 389-403
c37		Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321
c36		Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427
c35		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477
c34		Felix Arends, Joël Ouaknine, Charles W. Wampler: On Searching for Small Kochen-Specker Vector Systems. WG 2011: 23-34
i5		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. CoRR abs/1104.3100 (2011)
i4		Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. CoRR abs/1104.5335 (2011)
i3		Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. CoRR abs/1112.4644 (2011)
	2010
c33		Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316
c32		Joël Ouaknine, James Worrell: Towards a Theory of Time-Bounded Verification. ICALP (2) 2010: 22-37
c31		Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586
c30		Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69
	2009
j19		Hristina Palikareva, Joël Ouaknine, Bill Roscoe: Faster FDR Counterexample Generation Using SAT-Solving. ECEASST 23 (2009)
j18		Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady: An abstraction-based decision procedure for bit-vector arithmetic. STTT 11(2): 95-104 (2009)
c29		Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383
c28		Joël Ouaknine, Alexander Rabinovich, James Worrell: Time-Bounded Verification. CONCUR 2009: 496-510
e1		Joël Ouaknine, Frits W. Vaandrager (Eds.): Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings. Lecture Notes in Computer Science 5813, Springer 2009, isbn 978-3-642-04367-3
	2008
j17		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)
j16		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)
c27		Joël Ouaknine, James Worrell: Some Recent Results in Metric Temporal Logic. FORMATS 2008: 1-13
c26		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135
c25		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132
c24		Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell: On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187
i2		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008)
	2007
j15		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)
c23		Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320
c22		Sara Adams, Joël Ouaknine, James Worrell: Undecidability of Universality for Timed Automata with Minimal Resources. FORMATS 2007: 25-37
c21		Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell: Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112
c20		Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120
c19		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
i1		Joël Ouaknine, James Worrell: On the decidability and complexity of Metric Temporal Logic over finite words. CoRR abs/cs/0702120 (2007)
	2006
j14		Gavin Lowe, Joël Ouaknine: On Timed Models and Full Abstraction. Electr. Notes Theor. Comput. Sci. 155: 497-519 (2006)
j13		Murray Stokely, Sagar Chaki, Joël Ouaknine: Parallel Assignments in Software Model Checking. Electr. Notes Theor. Comput. Sci. 157(1): 77-94 (2006)
j12		Joël Ouaknine, Steve Schneider: Timed CSP: A Retrospective. Electr. Notes Theor. Comput. Sci. 162: 273-276 (2006)
c18		Joël Ouaknine, James Worrell: On Metric Temporal Logic and Faulty Turing Machines. FoSSaCS 2006: 217-230
c17		Inês Lynce, Joël Ouaknine: Sudoku as a SAT Problem. ISAIM 2006
c16		Joël Ouaknine, James Worrell: Safety Metric Temporal Logic Is Fully Decidable. TACAS 2006: 411-425
	2005
j11		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)
j10		Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman: Computational challenges in bounded model checking. STTT 7(2): 174-183 (2005)
j9		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)
j8		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)
c15		Andrzej S. Murawski, Joël Ouaknine: On Probabilistic Program Equivalence and Refinement. CONCUR 2005: 156-170
c14		Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell: Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101
c13		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
c12		Joël Ouaknine, James Worrell: On the Decidability of Metric Temporal Logic. LICS 2005: 188-197
	2004
j7		Keye Martin, Joël Ouaknine: Informatic vs. Classical Differentiation on the Real Line. Electr. Notes Theor. Comput. Sci. 73: 133-140 (2004)
j6		Michael W. Mislove, Joël Ouaknine, James Worrell: Axioms for Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004)
j5		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)
c11		Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman: Abstraction-Based Satisfiability Solving of Presburger Arithmetic. CAV 2004: 308-320
c10		Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell: Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407
c9		Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha: State/Event-Based Software Model Checking. IFM 2004: 128-147
c8		Joël Ouaknine, James Worrell: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. LICS 2004: 54-63
c7		Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina: Automated, compositional and iterative deadlock detection. MEMOCODE 2004: 201-210
c6		Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman: Completeness and Complexity of Bounded Model Checking. VMCAI 2004: 85-96
	2003
j4		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): 417-432 (2003)
j3		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)
j2		Joël Ouaknine, James Worrell: Timed CSP = Closed Timed epsilon-automata. Nord. J. Comput. 10(2): 99-133 (2003)
c5		Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215
c4		Joël Ouaknine, James Worrell: Universality and Language Inclusion for Open and Closed Timed Automata. HSCC 2003: 375-388
c3		Joël Ouaknine, James Worrell: Revisiting Digitization, Robustness, and Decidability for Timed Automata. LICS 2003: 198-207
	2002
j1		Joël Ouaknine, James Worrell: Timed CSP = Closed Timed Safety Automata. Electr. Notes Theor. Comput. Sci. 68(2): 142-159 (2002)
c2		Joël Ouaknine: Digitisation and Full Abstraction for Dense-Time Model Checking. TACAS 2002: 37-51
	1999
c1		Joël Ouaknine, George M. Reed: Model-Checking Temporal Behaviour in CSP. PDPTA 1999: 295-304

2013

j24

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of Equivalence and Minimisation for Q-weighted Automata. Logical Methods in Computer Science 9(1) (2013)

c49

Joël Ouaknine: Discrete Linear Dynamical Systems. LATA 2013: 42

i10

Ventsislav Chonev, Joël Ouaknine, James Worrell: The Orbit Problem in Higher Dimensions. CoRR abs/1303.2981 (2013)

Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: A Static Analysis Framework for Livelock Freedom in CSP. CoRR abs/1304.7394 (2013)

2012

j23

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell: On termination and invariance for faulty channel machines. Formal Asp. Comput. 24(4-6): 595-607 (2012)

j22

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Three tokens in Herman's algorithm. Formal Asp. Comput. 24(4-6): 671-678 (2012)

j21

Hristina Palikareva, Joël Ouaknine, A. W. Roscoe: SAT-solving in CSP trace refinement. Sci. Comput. Program. 77(10-11): 1178-1197 (2012)

c48

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: APEX: An Analyzer for Open Probabilistic Programs. CAV 2012: 693-698

c47

Philip J. Armstrong, Michael Goldsmith, Gavin Lowe, Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Recent Developments in FDR. CAV 2012: 699-704

c46

Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420

c45

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. FoSSaCS 2012: 467-481

c44

Daniel Bundala, Joël Ouaknine, James Worrell: On the Magnitude of Completeness Thresholds in Bounded Model Checking. LICS 2012: 155-164

c43

Joël Ouaknine, James Worrell: Decision Problems for Linear Recurrence Sequences. RP 2012: 21-28

c42

Christoph Haase, Joël Ouaknine, James Worrell: On the Relationship between Reachability Problems in Timed and Counter Automata. RP 2012: 54-65

Paul Hunter, Joël Ouaknine, James Worrell: Expressive Completeness of Metric Temporal Logic. CoRR abs/1208.4993 (2012)

Paul Hunter, Joël Ouaknine, James Worrell: When is Metric Temporal Logic Expressively Complete? CoRR abs/1209.0516 (2012)

Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012)

2011

j20

Michael W. Mislove, Joël Ouaknine: Preface. Electr. Notes Theor. Comput. Sci. 276: 1-3 (2011)

c41

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Language Equivalence for Probabilistic Automata. CAV 2011: 526-540

c40

Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell: Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572

c39

Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell: Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249

c38

Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Static Livelock Analysis in CSP. CONCUR 2011: 389-403

c37

Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321

c36

Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427

c35

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477

c34

Felix Arends, Joël Ouaknine, Charles W. Wampler: On Searching for Small Kochen-Specker Vector Systems. WG 2011: 23-34

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. CoRR abs/1104.3100 (2011)

Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell: On Reachability for Hybrid Automata over Bounded Time. CoRR abs/1104.5335 (2011)

Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: On the Complexity of the Equivalence Problem for Probabilistic Automata. CoRR abs/1112.4644 (2011)

2010

c33

Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316

c32

Joël Ouaknine, James Worrell: Towards a Theory of Time-Bounded Verification. ICALP (2) 2010: 22-37

c31

Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586

c30

Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69

2009

j19

Hristina Palikareva, Joël Ouaknine, Bill Roscoe: Faster FDR Counterexample Generation Using SAT-Solving. ECEASST 23 (2009)

j18

Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady: An abstraction-based decision procedure for bit-vector arithmetic. STTT 11(2): 95-104 (2009)

c29

Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383

c28

Joël Ouaknine, Alexander Rabinovich, James Worrell: Time-Bounded Verification. CONCUR 2009: 496-510

Joël Ouaknine, Frits W. Vaandrager (Eds.): Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings. Lecture Notes in Computer Science 5813, Springer 2009, isbn 978-3-642-04367-3

2008

j17

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)

j16

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)

c27

Joël Ouaknine, James Worrell: Some Recent Results in Metric Temporal Logic. FORMATS 2008: 1-13

c26

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135

c25

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132

c24

Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell: On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008)

2007

j15

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)

c23

Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320

c22

Sara Adams, Joël Ouaknine, James Worrell: Undecidability of Universality for Timed Automata with Minimal Resources. FORMATS 2007: 25-37

c21

Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell: Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112

c20

Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120

c19

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

Joël Ouaknine, James Worrell: On the decidability and complexity of Metric Temporal Logic over finite words. CoRR abs/cs/0702120 (2007)

2006

j14

Gavin Lowe, Joël Ouaknine: On Timed Models and Full Abstraction. Electr. Notes Theor. Comput. Sci. 155: 497-519 (2006)

j13

Murray Stokely, Sagar Chaki, Joël Ouaknine: Parallel Assignments in Software Model Checking. Electr. Notes Theor. Comput. Sci. 157(1): 77-94 (2006)

j12

Joël Ouaknine, Steve Schneider: Timed CSP: A Retrospective. Electr. Notes Theor. Comput. Sci. 162: 273-276 (2006)

c18

Joël Ouaknine, James Worrell: On Metric Temporal Logic and Faulty Turing Machines. FoSSaCS 2006: 217-230

c17

Inês Lynce, Joël Ouaknine: Sudoku as a SAT Problem. ISAIM 2006

c16

Joël Ouaknine, James Worrell: Safety Metric Temporal Logic Is Fully Decidable. TACAS 2006: 411-425

2005

j11

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)

j10

Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman: Computational challenges in bounded model checking. STTT 7(2): 174-183 (2005)

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)

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)

c15

Andrzej S. Murawski, Joël Ouaknine: On Probabilistic Program Equivalence and Refinement. CONCUR 2005: 156-170

c14

Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell: Decidability and Complexity Results for Timed Automata via Channel Machines. ICALP 2005: 1089-1101

c13

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

c12

Joël Ouaknine, James Worrell: On the Decidability of Metric Temporal Logic. LICS 2005: 188-197

2004

Keye Martin, Joël Ouaknine: Informatic vs. Classical Differentiation on the Real Line. Electr. Notes Theor. Comput. Sci. 73: 133-140 (2004)

Michael W. Mislove, Joël Ouaknine, James Worrell: Axioms for Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004)

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)

c11

Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman: Abstraction-Based Satisfiability Solving of Presburger Arithmetic. CAV 2004: 308-320

c10

Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell: Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407

Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha: State/Event-Based Software Model Checking. IFM 2004: 128-147

Joël Ouaknine, James Worrell: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. LICS 2004: 54-63

Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina: Automated, compositional and iterative deadlock detection. MEMOCODE 2004: 201-210

Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman: Completeness and Complexity of Bounded Model Checking. VMCAI 2004: 85-96

2003

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): 417-432 (2003)

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)

Joël Ouaknine, James Worrell: Timed CSP = Closed Timed epsilon-automata. Nord. J. Comput. 10(2): 99-133 (2003)

Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215

Joël Ouaknine, James Worrell: Universality and Language Inclusion for Open and Closed Timed Automata. HSCC 2003: 375-388

Joël Ouaknine, James Worrell: Revisiting Digitization, Robustness, and Decidability for Timed Automata. LICS 2003: 198-207

2002

Joël Ouaknine, James Worrell: Timed CSP = Closed Timed Safety Automata. Electr. Notes Theor. Comput. Sci. 68(2): 142-159 (2002)

Joël Ouaknine: Digitisation and Full Abstraction for Dense-Time Model Checking. TACAS 2002: 37-51

1999

Joël Ouaknine, George M. Reed: Model-Checking Temporal Behaviour in CSP. PDPTA 1999: 295-304

1	Parosh Aziz Abdulla	[j16] [c21] [c14]
2	Sara Adams	[c22]
3	Felix Arends	[c34]
4	Philip J. Armstrong	[c47]
5	Patricia Bouyer (Patricia Bouyer-Decitre)	[j23] [c33] [c26] [c25] [i2] [c20]
6	Bryan A. Brady	[j18] [c19]
7	Franck van Breugel	[j8] [c5]
8	Thomas Brihaye	[i6] [c36] [i4]
9	Randal E. Bryant	[j18] [c19]
10	Daniel Bundala	[c44]
11	Sagar Chaki	[j13] [j11] [c13] [j5] [c9] [c7] [j4]
12	Ventsislav Chonev	[i10]
13	Edmund M. Clarke	[j11] [j10] [c13] [j5] [c9] [c7] [c6] [j4] [j3]
14	Byron Cook	[c39]
15	Johann Deneux	[j16] [c14]
16	Laurent Doyen	[i6] [c36] [i4]
17	Ansgar Fehnker	[j3]
18	Gilles Geeraerts	[i6] [c36] [i4]
19	Michael Goldsmith	[c47]
20	Alex Groce	[j5]
21	Orna Grumberg	[c13]
22	Stefan Göller	[c46] [c31]
23	Christoph Haase	[c46] [c42] [c39] [c31] [c29]
24	Zhi Han	[j3]
25	Paul Hunter	[i8] [i7] [c33]
26	Mark Jenkins	[c37] [c30]
27	Stefan Kiefer	[j24] [j22] [c48] [c45] [c41] [c35] [i5] [i3]
28	Stephan Kreutzer	[c29]
29	Daniel Kroening (Daniel Kröning)	[c40] [j18] [c19] [j10] [c11] [c6]
30	Bruce H. Krogh	[j3]
31	Ranko Lazic (R. S. Lazic)	[j17] [c23]
32	Axel Legay	[c24]
33	Gavin Lowe	[c47] [j14]
34	Inês Lynce	[c17]
35	Nicolas Markey	[j23] [c33] [c26] [c25] [i2] [c20]
36	Keye Martin	[j7]
37	Michael W. Mislove	[j20] [j8] [j6] [c10] [c5]
38	Andrzej S. Murawski	[j24] [j22] [c48] [c45] [c41] [c35] [i5] [i3] [c24] [c15]
39	Thomas Christopher Newcomb	[c23]
40	Tom Newcomb	[j17]
41	Hristina Palikareva	[i9] [j21] [c47] [c38] [j19]
42	Matthew J. Parkinson	[c39]
43	Dusko Pavlovic	[c10]
44	Karin Quaas	[j16] [c21]
45	Alexander Moshe Rabinovich (Alexander Rabinovich)	[c37] [c30] [c28]
46	Jean-François Raskin	[i6] [c36] [i4]
47	George M. Reed	[c1]
48	A. W. Roscoe (A. William Roscoe, Bill Roscoe)	[i9] [j21] [c47] [c38] [j19] [j17] [c23]
49	Steve A. Schneider (Steve Schneider)	[j12]
50	Ph. Schnoebelen (Philippe Schnoebelen)	[j23] [c25] [i2]
51	Sanjit A. Seshia	[j18] [c19] [c11]
52	Natasha Sharygina	[j11] [c13] [c9] [c7]
53	Nishant Sinha	[j11] [c9]
54	Murray Stokely	[j13]
55	Ofer Strichman	[c40] [j18] [c19] [j10] [j5] [c11] [c6]
56	Olaf Stursberg	[j3]
57	Michael Theobald	[j3]
58	Tayssir Touili	[c13]
59	Frits W. Vaandrager	[e1]
60	Helmut Veith	[c13]
61	Björn Wachter	[j24] [j22] [c48] [c45] [c41] [i3]
62	Thomas Wahl	[c40]
63	Charles W. Wampler	[c34]
64	James Worrell	[j24] [i10] [i9] [j23] [j22] [c48] [c47] [c46] [c45] [c44] [c43] [c42] [i8] [i7] [i6] [c41] [c40] [c39] [c38] [c37] [c36] [c35] [i5] [i4] [i3] [c33] [c32] [c31] [c30] [c29] [c28] [j17] [j16] [c27] [c26] [c25] [c24] [i2] [j15] [c23] [c22] [c21] [c20] [i1] [c18] [c16] [j8] [c14] [c12] [j6] [c10] [c8] [j2] [c5] [c4] [c3] [j1]
65	Karen Yorav (Karen Laster)	[j5] [j4]
66	Lijun Zhang 0001	[c35] [i5]

Joël Ouaknine

Coauthor Index