|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 14 keywords
|
|
|
|
|
Results
Found 69 publication records. Showing 69 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell |
Branching-Time Model Checking of Parametric One-Counter Automata.  |
FoSSaCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael W. Mislove, Joël Ouaknine |
Preface.  |
Electr. Notes Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell |
On the Complexity of the Equivalence Problem for Probabilistic Automata  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang |
On Stabilization in Herman's Algorithm  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell |
On Reachability for Hybrid Automata over Bounded Time  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Joël Ouaknine, Hristina Palikareva, A. W. Roscoe, James Worrell |
Static Livelock Analysis in CSP.  |
CONCUR  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell |
Tractable Reasoning in a Fragment of Separation Logic.  |
CONCUR  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Arends, Joël Ouaknine, Charles W. Wampler |
On Searching for Small Kochen-Specker Vector Systems.  |
WG  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang |
On Stabilization in Herman's Algorithm.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell |
On Reachability for Hybrid Automata over Bounded Time.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell |
Language Equivalence for Probabilistic Automata.  |
CAV  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell |
Linear Completeness Thresholds for Bounded Model Checking.  |
CAV  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell |
The Church Synthesis Problem with Metric.  |
CSL  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell |
Model Checking Succinct and Parametric One-Counter Automata.  |
ICALP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Towards a Theory of Time-Bounded Verification.  |
ICALP  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell |
Alternating Timed Automata over Bounded Time.  |
LICS  |
2010 |
DBLP DOI BibTeX RDF |
Church's Problem, Timed Automata, Alternation |
| 1 | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
Computing Rational Radical Sums in Uniform TC^0.  |
FSTTCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hristina Palikareva, Joël Ouaknine, Bill Roscoe |
Faster FDR Counterexample Generation Using SAT-Solving.  |
ECEASST  |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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  |
2009 |
DBLP DOI BibTeX RDF |
Decision-procedures, Bit-vector |
| 1 | Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell |
Reachability in Succinct and Parametric One-Counter Automata.  |
CONCUR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, Alexander Rabinovich, James Worrell |
Time-Bounded Verification.  |
CONCUR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
FORMATS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell |
Universality Analysis for One-Clock Timed Automata.  |
Fundam. Inform.  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ranko Lazic, Tom Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell |
Nets with Tokens which Carry Data.  |
Fundam. Inform.  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell |
On Termination for Faulty Channel Machines  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Axel Legay, Andrzej S. Murawski, Joël Ouaknine, James Worrell |
On Automated Verification of Probabilistic Programs.  |
TACAS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
On Expressiveness and Complexity in Real-Time Model Checking.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Some Recent Results in Metric Temporal Logic.  |
FORMATS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell |
On Termination for Faulty Channel Machines.  |
STACS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
On the decidability and complexity of Metric Temporal Logic over finite words.  |
Logical Methods in Computer Science  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
On the decidability and complexity of Metric Temporal Logic over finite words  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ranko Lazic, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe, James Worrell |
Nets with Tokens Which Carry Data.  |
ICATPN  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell |
Zone-Based Universality Analysis for Single-Clock Timed Automata.  |
FSEN  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady |
Deciding Bit-Vector Arithmetic with Abstraction.  |
TACAS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Adams, Joël Ouaknine, James Worrell |
Undecidability of Universality for Timed Automata with Minimal Resources.  |
FORMATS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
The Cost of Punctuality.  |
LICS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gavin Lowe, Joël Ouaknine |
On Timed Models and Full Abstraction.  |
Electr. Notes Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, Steve Schneider |
Timed CSP: A Retrospective.  |
Electr. Notes Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Murray Stokely, Sagar Chaki, Joël Ouaknine |
Parallel Assignments in Software Model Checking.  |
Electr. Notes Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Safety Metric Temporal Logic Is Fully Decidable.  |
TACAS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Inês Lynce, Joël Ouaknine |
Sudoku as a SAT Problem.  |
ISAIM  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
On Metric Temporal Logic and Faulty Turing Machines.  |
FoSSaCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha |
Concurrent software verification with states, events, and deadlocks.  |
Formal Asp. Comput.  |
2005 |
DBLP DOI BibTeX RDF |
Concurrent software, States and events, Counterexample-guided abstraction refinement, Model checking, Temporal logic, Deadlock, Compositional reasoning |
| 1 | Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell |
Domain theory, testing and simulation for labelled Markov processes.  |
Theor. Comput. Sci.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman |
Computational challenges in bounded model checking.  |
STTT  |
2005 |
DBLP DOI BibTeX RDF |
Bonded-Model-checking, Completeness-Threshold, Complexity |
| 1 | Andrzej S. Murawski, Joël Ouaknine |
On Probabilistic Program Equivalence and Refinement.  |
CONCUR  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell |
Decidability and Complexity Results for Timed Automata via Channel Machines.  |
ICALP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Concurrent Software Model Checking, State/Event-based Verification, Branching-time Temporal Logic, Automated Abstraction Refinement |
| 1 | Joël Ouaknine, James Worrell |
On the Decidability of Metric Temporal Logic.  |
LICS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Keye Martin, Joël Ouaknine |
Informatic vs. Classical Differentiation on the Real Line.  |
Electr. Notes Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael W. Mislove, Joël Ouaknine, James Worrell |
Axioms for Probability and Nondeterminism.  |
Electr. Notes Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2004 |
DBLP DOI BibTeX RDF |
concurrency, process algebra, software verification, predicate abstraction, abstraction refinement |
| 1 | Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina |
Automated, compositional and iterative deadlock detection.  |
MEMOCODE  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sagar Chaki, Edmund M. Clarke, Joël Ouaknine, Natasha Sharygina, Nishant Sinha |
State/Event-Based Software Model Checking.  |
IFM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman |
Abstraction-Based Satisfiability Solving of Presburger Arithmetic.  |
CAV  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.  |
LICS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman |
Completeness and Complexity of Bounded Model Checking.  |
VMCAI  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael W. Mislove, Joël Ouaknine, Dusko Pavlovic, James Worrell |
Duality for Labelled Markov Processes.  |
FoSSaCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Timed CSP = Closed Timed epsilon-automata.  |
Nord. J. Comput.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Universality and Language Inclusion for Open and Closed Timed Automata.  |
HSCC  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Revisiting Digitization, Robustness, and Decidability for Timed Automata.  |
LICS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell |
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.  |
FoSSaCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, James Worrell |
Timed CSP = Closed Timed Safety Automata.  |
Electr. Notes Theor. Comput. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine |
Digitisation and Full Abstraction for Dense-Time Model Checking.  |
TACAS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine, George M. Reed |
Model-Checking Temporal Behaviour in CSP.  |
PDPTA  |
1999 |
DBLP BibTeX RDF |
|
Displaying result #1 - #69 of 69 (100 per page; Change: )
|
|