| 2012 | ||
|---|---|---|
| 69 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420 | |
| 68 | 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 | |
| 2011 | ||
| 67 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell: Language Equivalence for Probabilistic Automata. CAV 2011: 526-540 | |
| 66 | Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell: Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572 | |
| 65 | Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell: Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249 | |
| 64 | Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell: Static Livelock Analysis in CSP. CONCUR 2011: 389-403 | |
| 63 | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: The Church Synthesis Problem with Metric. CSL 2011: 307-321 | |
| 62 | 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 | |
| 61 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm. ICALP (2) 2011: 466-477 | |
| 60 | Felix Arends, Joël Ouaknine, Charles W. Wampler: On Searching for Small Kochen-Specker Vector Systems. WG 2011: 23-34 | |
| 59 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang: On Stabilization in Herman's Algorithm CoRR abs/1104.3100: (2011) | |
| 58 | 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) | |
| 57 | 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) | |
| 56 | Michael W. Mislove, Joël Ouaknine: Preface. Electr. Notes Theor. Comput. Sci. 276: 1-3 (2011) | |
| 2010 | ||
| 55 | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316 | |
| 54 | Joël Ouaknine, James Worrell: Towards a Theory of Time-Bounded Verification. ICALP (2) 2010: 22-37 | |
| 53 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell: Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586 | |
| 52 | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell: Alternating Timed Automata over Bounded Time. LICS 2010: 60-69 | |
| 2009 | ||
| 51 | Joël Ouaknine, Frits W. Vaandrager: Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings Springer 2009 | |
| 50 | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell: Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383 | |
| 49 | Joël Ouaknine, Alexander Rabinovich, James Worrell: Time-Bounded Verification. CONCUR 2009: 496-510 | |
| 48 | Hristina Palikareva, Joël Ouaknine, Bill Roscoe: Faster FDR Counterexample Generation Using SAT-Solving. ECEASST 23: (2009) | |
| 47 | 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) | |
| 2008 | ||
| 46 | Joël Ouaknine, James Worrell: Some Recent Results in Metric Temporal Logic. FORMATS 2008: 1-13 | |
| 45 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135 | |
| 44 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines. STACS 2008: 121-132 | |
| 43 | Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell: On Automated Verification of Probabilistic Programs. TACAS 2008: 173-187 | |
| 42 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell: On Termination for Faulty Channel Machines CoRR abs/0802.2839: (2008) | |
| 41 | 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) | |
| 40 | 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 | ||
| 39 | Sara Adams, Joël Ouaknine, James Worrell: Undecidability of Universality for Timed Automata with Minimal Resources. FORMATS 2007: 25-37 | |
| 38 | Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell: Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112 | |
| 37 | Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell: Nets with Tokens Which Carry Data. ICATPN 2007: 301-320 | |
| 36 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell: The Cost of Punctuality. LICS 2007: 109-120 | |
| 35 | 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 | |
| 34 | Joël Ouaknine, James Worrell: On the decidability and complexity of Metric Temporal Logic over finite words CoRR abs/cs/0702120: (2007) | |
| 33 | 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 | ||
| 32 | Joël Ouaknine, James Worrell: On Metric Temporal Logic and Faulty Turing Machines. FoSSaCS 2006: 217-230 | |
| 31 | Inês Lynce, Joël Ouaknine: Sudoku as a SAT Problem. ISAIM 2006 | |
| 30 | Joël Ouaknine, James Worrell: Safety Metric Temporal Logic Is Fully Decidable. TACAS 2006: 411-425 | |
| 29 | Gavin Lowe, Joël Ouaknine: On Timed Models and Full Abstraction. Electr. Notes Theor. Comput. Sci. 155: 497-519 (2006) | |
| 28 | Murray Stokely, Sagar Chaki, Joël Ouaknine: Parallel Assignments in Software Model Checking. Electr. Notes Theor. Comput. Sci. 157(1): 77-94 (2006) | |
| 27 | Joël Ouaknine, Steve Schneider: Timed CSP: A Retrospective. Electr. Notes Theor. Comput. Sci. 162: 273-276 (2006) | |
| 2005 | ||
| 26 | Andrzej S. Murawski, Joël Ouaknine: On Probabilistic Program Equivalence and Refinement. CONCUR 2005: 156-170 | |
| 25 | 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 | 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 | Joël Ouaknine, James Worrell: On the Decidability of Metric Temporal Logic. LICS 2005: 188-197 | |
| 22 | 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 | Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman: Computational challenges in bounded model checking. STTT 7(2): 174-183 (2005) | |
| 20 | 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 | 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 | Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman: Abstraction-Based Satisfiability Solving of Presburger Arithmetic. CAV 2004: 308-320 | |
| 17 | Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell: Duality for Labelled Markov Processes. FoSSaCS 2004: 393-407 | |
| 16 | Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha: State/Event-Based Software Model Checking. IFM 2004: 128-147 | |
| 15 | Joël Ouaknine, James Worrell: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. LICS 2004: 54-63 | |
| 14 | Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina: Automated, compositional and iterative deadlock detection. MEMOCODE 2004: 201-210 | |
| 13 | Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman: Completeness and Complexity of Bounded Model Checking. VMCAI 2004: 85-96 | |
| 12 | Keye Martin, Joël Ouaknine: Informatic vs. Classical Differentiation on the Real Line. Electr. Notes Theor. Comput. Sci. 73: 133-140 (2004) | |
| 11 | Michael W. Mislove, Joël Ouaknine, James Worrell: Axioms for Probability and Nondeterminism. Electr. Notes Theor. Comput. Sci. 96: 7-28 (2004) | |
| 10 | 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 | Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell: An Intrinsic Characterization of Approximate Probabilistic Bisimilarity. FoSSaCS 2003: 200-215 | |
| 8 | Joël Ouaknine, James Worrell: Universality and Language Inclusion for Open and Closed Timed Automata. HSCC 2003: 375-388 | |
| 7 | Joël Ouaknine, James Worrell: Revisiting Digitization, Robustness, and Decidability for Timed Automata. LICS 2003: 198-207 | |
| 6 | 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) | |
| 5 | 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 | Joël Ouaknine: Digitisation and Full Abstraction for Dense-Time Model Checking. TACAS 2002: 37-51 | |
| 2 | Joël Ouaknine, James Worrell: Timed CSP = Closed Timed Safety Automata. Electr. Notes Theor. Comput. Sci. 68(2): 142-159 (2002) | |
| 1999 | ||
| 1 | Joël Ouaknine, George M. Reed: Model-Checking Temporal Behaviour in CSP. PDPTA 1999: 295-304 | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page