Recent Developments in FDR

  • Philip Armstrong
  • Michael Goldsmith
  • Gavin Lowe
  • Joël Ouaknine
  • Hristina Palikareva
  • A. W. Roscoe
  • James Worrell
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7358)

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.

Keywords

Model Check Priority Operator Bound Model Check Weak Bisimulation Spurious Counterexample 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    PAT: Process analysis toolkit, http://www.comp.nus.edu.sg/~pat/
  2. 2.
  3. 3.
    Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.): Communicating Sequential Processes. LNCS, vol. 3525. Springer, Heidelberg (2005)MATHGoogle Scholar
  4. 4.
    Armstrong, P., Lowe, G., Ouaknine, J., Roscoe, A.W.: Model checking Timed CSP. In: HOWARD. Easychair, pub. (to appear, 2012)Google Scholar
  5. 5.
    Armstrong, P., Hopcroft, P.J., Roscoe, A.W.: Fairness checking through priority (to appear, 2012)Google Scholar
  6. 6.
    Broadfoot, G.H., Hopcroft, P.J.: A paradigm shift in software development. In: Proceedings of Embedded World Conference, Nurmemburg (2012)Google Scholar
  7. 7.
    Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. 8.
    Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: Concurrent software verification with states, events, and deadlocks. Formal Aspects of Computing 17(4), 461–483 (2005)MATHCrossRefGoogle Scholar
  9. 9.
    Chaki, S., Ouaknine, J., Yorav, K., Clarke, E.M.: Automated compositional abstraction refinement for concurrent C programs: A two-level approach. Electronic Notes in Theoretical Computer Science, vol. 89 (2003)Google Scholar
  10. 10.
    Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided Abstraction Refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154–169. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  11. 11.
    Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Compututer Science, vol. 89 (2003)Google Scholar
  12. 12.
    Henzinger, T.A., Manna, Z., Pnueli, A.: What Good Are Digital Clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 545–558. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  13. 13.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall International, London (1985)MATHGoogle Scholar
  14. 14.
    Lowe, G.: Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147–166. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  15. 15.
    O’Halloran, C.M.: Acceptance based assurance. In: ASE 2001. IEEE (2001)Google Scholar
  16. 16.
    Ouaknine, J., Palikareva, H., Roscoe, A.W., Worrell, J.: Static Livelock Analysis in CSP. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 389–403. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  17. 17.
    Ouaknine, J.: Digitisation and Full Abstraction for Dense-Time Model Checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 37–51. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  18. 18.
    Ouaknine, J., Worrell, J.: Timed CSP = Closed Timed epsilon-automata. Nord. J. Comput. 10(2), 99–133 (2003)MathSciNetMATHGoogle Scholar
  19. 19.
    Palikareva, H., Ouaknine, J., Roscoe, A.W.: SAT-solving in CSP trace refinement. Science of Computer Programming. Special issue on Automated Verification of Critical Systems (2011) (in press)Google Scholar
  20. 20.
    Reed, G., Roscoe, A.W.: A Timed Model for Communicating Sequential Processes. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 314–323. Springer, Heidelberg (1986)CrossRefGoogle Scholar
  21. 21.
    Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice Hall (1998)Google Scholar
  22. 22.
    Roscoe, A.W.: Understanding Concurrent Systems. Springer (2011), http://www.cs.ox.ac.uk/ucs/
  23. 23.
    Roscoe, A.W., Huang, J.: Extending noninterference properties to the timed world. In: Proceedings of SAC 2006 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Philip Armstrong
    • 1
  • Michael Goldsmith
    • 1
  • Gavin Lowe
    • 1
  • Joël Ouaknine
    • 1
  • Hristina Palikareva
    • 1
  • A. W. Roscoe
    • 1
  • James Worrell
    • 1
  1. 1.Department of Computer ScienceOxford UniversityUK

Personalised recommendations