Recent developments in FDR

Authors:
Philip Armstrong;Michael Goldsmith;Gavin Lowe;Joël Ouaknine;Hristina Palikareva;A. W. Roscoe;James Worrell
Affiliations:
Department of Computer Science, Oxford University, UK;Department of Computer Science, Oxford University, UK;Department of Computer Science, Oxford University, UK;Department of Computer Science, Oxford University, UK;Department of Computer Science, Oxford University, UK;Department of Computer Science, Oxford University, UK;Department of Computer Science, Oxford University, UK
Venue:
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Year:
2012

Citing 14
Cited 1

Communicating sequential processes

Communicating sequential processes
A timed model for communicating sequential processes

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
What Good Are Digital Clocks?

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking without BDDs

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Digitisation and Full Abstraction for Dense-Time Model Checking

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Timed CSP = closed timed ε-automata

Nordic Journal of Computing
Extending noninterference properties to the timed world

Proceedings of the 2006 ACM symposium on Applied computing
Understanding Concurrent Systems

Understanding Concurrent Systems
Static livelock analysis in CSP

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years

CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
SAT-solving in CSP trace refinement

Science of Computer Programming

Slow abstraction via priority

Theories of Programming and Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe and report upon various substantial extensions of the CSP refinement checker FDR including (i) the direct ability to handle real-time processes; (ii) the incorporation of bounded model checking technology; (iii) the development of conservative and highly efficient static analysis algorithms for guaranteeing livelock-freedom; and (iv) the development of automated CEGAR technology.