Interacting state machines: A stateful approach to proving security

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2629, Issue , 2003, Pages 15-32

  Von Oheimb, David ^a  

^a SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ABSTRACT MODELING; GRAPHICAL REPRESENTATIONS; HIGHER ORDER LOGIC; INPUT/OUTPUT AUTOMATA; NEEDHAM SCHROEDER PROTOCOL; SECURITY PROPERTIES; SEMANTIC TRANSLATIONS; THEOREM PROVERS;

SEMANTICS;

EID: 35248816981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40981-6_4     Document Type: Article

References (27)

1. Jean-Raymond Abrial. The B-book: assigning programs to meanings. Cambridge University Press, 1996.
2. Manfred Broy and Ketil Stølen. Specification and development of interactive systems. Springer, 2001.
3. Michael Butler. csp2B : A practical approach to combining CSP and B. In Proceedings of FM'99: World Congress on Formal Methods, pages 490-508, 1999.
4. Common Criteria for Information Technology Security Evaluation (CC), Version 2.1, 1999. ISO/IEC 15408.
5. Ernie Cohen. Taps: A first-order verifier for cryptographic protocols. In 13th IEEE Computer Security Foundations Workshop - CSFW'00, pages 144-158, Cambridge, UK, 3-5 July 2000. IEEE Computer Society Press.
6. Clemens Fischer. Combination and implementation of processes and data: from CSP-OZ to Java. PhD thesis, Univ. of Oldenburg, 2000.
7. Y. Gurevich. Draft of the asm guide. Technical Report CSE-TR-336-97, EECS Dept., University of Michigan, 1997.
8. Tobias Hamberger. Integrating theorem proving and model checking in Isabelle/IOA. Technical report, TU München, 1999.
9. C. A. R. Hoare. Communicating sequential processes. In R. M. McKeag and A. M. Macnaghten, editors, On the construction of programs - an advanced course, pages 229-254. Cambridge University Press, 1980.
10. Franz Huber, Bernhard Schätz, Alexander Schmidt, and Katharina Spies. Autofocus - a tool for distributed systems specification. In Proceedings FTRTFT'96 - Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 1135 of LNCS, pages 467-470. Springer-Verlag, 1996. See also http://autofocus.in.tum.de/index-e.html.
11. Information Technology Security Evaluation Criteria (ITSEC), 1991.
12. Jan Jürjens. Algebraic state machines: Concepts and applications to security, 2002. Submitted for publication.
13. Jan Jürjens. Principles for Secure Systems Design. PhD thesis, Oxford University Computing Laboratory, Trinity Term 2002.
14. Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proceedings of TACAS, volume 1055, pages 147-166. Springer-Verlag, 1996.
15. Nancy Lynch and Mark Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219-246, 1989. http://theory.lcs.mit.edu/tds/papers/Lynch/CWI89.html.
16. M. Maia, V. Iorio, and R. Bigonha. Interacting Abstract State Machines. In Proceedings of the 28th Annual Conference of the German Society of Computer Science. Technical Report, Magdeburg University, 1998.
17. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes - parts i+ii. Information and Computation, 100(1):1-77, September 1992.
18. Olaf Müller. A Verification Environment for I/O Automata Based on Formalized Meta-Theory. PhD thesis, Technische Univerität München, 1998. See also http://isabelle.in.tum.de/I0A/.
19. Sebastian Nanz. Integration of CASE Tools and Theorem Provers: A Framework for System Modeling and Verification with AutoFocus and Isabelle. Master's thesis, TU München, 2002. http://home.in.tum.de/nanz/csthesis/.
20. Sebastian Nanz and David von Oheimb. ISM Framework: Manual and distribution, 2002. http://ddvo.net/ISM/.
21. David von Oheimb. The Isabelle/HOL implementation of Interacting State Machines, 2002. Technical documentation, available on request.
22. th European Symposium on Research in Computer Security (ESORICS). Spinger, 2002. http://ddvo.net/papers/FSA_ISH.html.
23. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer-Verlag, 1994. For an up-to-date description, see http://Isabelle.in.tum.de/.
24. Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
25. Oscar Slotosch et al. Validas Model Validation AG. http://www.validas.de/.
26. Steve Schneider. Verifying authentication protocols with CSP. In Proceedings of the 10th Computer Security Foundations Workshop (CSFW). IEEE Computer Society Press, June 1997.
27. J. Mike Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, 2nd edition, 1992.