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.

[BibT_eX]

[DOI]

Joël Ouaknine

Softw. Test. Verification Reliab., 2005

Computational challenges in bounded model checking.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2005

Concurrent software verification with states, events, and deadlocks.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2005

Parallel Assignments in Software Model Checking.

[BibT_eX]

[DOI]

Murray Stokely

Sagar Chaki

Joël Ouaknine

Proceedings of the Third International Workshop on Software Verification and Validation, 2005

Timed CSP: A Retrospective.

[BibT_eX]

[DOI]

Joël Ouaknine

Steve A. Schneider

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

On Timed Models and Full Abstraction.

[BibT_eX]

[DOI]

Gavin Lowe

Joël Ouaknine

Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

On the Decidability of Metric Temporal Logic.

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

State/Event Software Verification for Branching-Time Specifications.

[BibT_eX]

[DOI]

Proceedings of the Integrated Formal Methods, 5th International Conference, 2005

Decidability and Complexity Results for Timed Automata via Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

On Probabilistic Program Equivalence and Refinement.

[BibT_eX]

[DOI]

Andrzej S. Murawski

Joël Ouaknine

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

Efficient Verification of Sequential and Concurrent C Programs.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2004

Completeness and Complexity of Bounded Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2004

Automated, compositional and iterative deadlock detection.

[BibT_eX]

[DOI]

Proceedings of the 2nd ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2004), 2004

On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap.

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

State/Event-Based Software Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Integrated Formal Methods, 4th International Conference, 2004

Duality for Labelled Markov Processes.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

Abstraction-Based Satisfiability Solving of Presburger Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003

Timed CSP = Closed Timed epsilon-automata.

[BibT_eX]

Joël Ouaknine

James Worrell

Nord. J. Comput., 2003

Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Axioms for Probability and Nondeterminism.

[BibT_eX]

[DOI]

Michael W. Mislove

Joël Ouaknine

James Worrell

Proceedings of the 10th International Workshop on Expressiveness in Concurrency, 2003

Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach.

[BibT_eX]

[DOI]

Proceedings of the 2003 Workshop on Software Model Checking, 2003

Revisiting Digitization, Robustness, and Decidability for Timed Automata.

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Universality and Language Inclusion for Open and Closed Timed Automata.

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

Proceedings of the Hybrid Systems: Computation and Control, 2003

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

Timed CSP = Closed Timed Safety Automata.

[BibT_eX]

[DOI]

Joël Ouaknine

James Worrell

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Informatic vs. Classical Differentiation on the Real Line.

[BibT_eX]

[DOI]

Keye Martin

Joël Ouaknine

Proceedings of the Workshop on Domains VI 2002, Birmingham, UK, September 16-19, 2002, 2002

Digitisation and Full Abstraction for Dense-Time Model Checking.

[BibT_eX]

[DOI]

Joël Ouaknine

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

2000

Discrete analysis of continuous behaviour in real-time concurrent systems.

[BibT_eX]

[DOI]

Joël Ouaknine

PhD thesis, 2000

1999

Model-Checking Temporal Behaviour in CSP.

[BibT_eX]

Joël Ouaknine

George M. Reed

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Joël Ouaknine

Awards

ACM Fellow

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...