The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Joël Ouaknine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  38. Time-Bounded Verification. [Citation Graph (, )][DBLP]


  39. Reachability in Succinct and Parametric One-Counter Automata. [Citation Graph (, )][DBLP]


  40. Some Recent Results in Metric Temporal Logic. [Citation Graph (, )][DBLP]


  41. On Expressiveness and Complexity in Real-Time Model Checking. [Citation Graph (, )][DBLP]


  42. Model Checking Succinct and Parametric One-Counter Automata. [Citation Graph (, )][DBLP]


  43. Towards a Theory of Time-Bounded Verification. [Citation Graph (, )][DBLP]


  44. Alternating Timed Automata over Bounded Time. [Citation Graph (, )][DBLP]


  45. On Termination for Faulty Channel Machines. [Citation Graph (, )][DBLP]


  46. On Automated Verification of Probabilistic Programs. [Citation Graph (, )][DBLP]


  47. On Termination for Faulty Channel Machines [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002