Verifying a signature architecture: A comparative case study

Formal Aspects of Computing

Volumn 19, Issue 1, 2007, Pages 63-91

  Basin, David ^a   Kuruma, Hironobu ^b   Miyazaki, Kunihiko ^b   Takaragi, Kazuo ^b   Wolff, Burkhart ^a  

^a ETH ZURICH   (Switzerland)

^b HITACHI LTD   (Japan)

Author keywords

Case study; Comparison; Formal methods; Model checking; Security; Theorem proving

Indexed keywords

AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; MODEL CHECKING; SECURITY OF DATA; THEOREM PROVING;

CASE STUDIES; SIGNATURE ARCHITECTURE; TRACE MODEL;

FORMAL METHODS;

EID: 33947138592     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-006-0012-5     Document Type: Article

References (51)

1. Abowd GD, Allen R, Garlan D (1995) Formalizing style to understand descriptions of software architecture. ACM Trans Softw Eng Methodol (TOSEM) 4(4):319-364
2. Abrial J-R, Börger E, Langmaack H (1986) Formal methods for industrial applications: Specifying and programming the steam boiler control, volume 1165 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York
3. Abrial J-R (1996) The B-book: assigning programs to meanings. Cambridge University Press, Cambridge
4. Avrunin GS, Corbett JC, Dwyer MB, Pasareanu CS, Siegel SF (1999) Comparing finite-state verification techniques for concurrent software. Technical report, Amherst, MA, USA
5. Alur R, Henzinger TA (1994) A really temporal logic. J ACM 41(1):181-203
6. Arai T, Sekiguchi T, Satoh M, Inoue T, Nakamura T, Iwao H (1999) DARMA: Using different OSs concurrently based on nano-kernel technology. In: Proceedings of 59th-Annual Convention of information processing society of Japan, vol 1, pages 139-140. Information Processing Society of Japan, 1999 (in Japanese)
7. Brat G, Drusinsky D, Giannakopoulou D, Goldberg A, Havelund K, Lowry M, Pasareanu C, Venet A, Visser W, Washington R (2004) Experimental evaluation of verification and validation tools on martian rover software. Formal Methods Syst Des, 25(2-3):167-198
8. Basin D, Friedrich S (2000) Combining WS1S and HOL. In Gabbay DM de Rijke M (eds) Frontiers of Combining Systems 2, vol 7 of Studies in Logic and Computation. Res Stud Press/Wiley, Baldock, Herts, UK, 39-56
9. Bowen JP, Hinchey MG, (1995) Seven more myths of formal methods. IEEE Softw, 12(3):34-41
10. Basin D, Kaufmann M, (1990) The Boyer-Moore Prover and Nuprl: an experimental comparison. In: Huet G, Plotkin G, (eds) Logical Frameworks. Cambridge University Press, Cambridge, pp. 90-119
11. Basin D, Kuruma H, Takaragi K, Wolff B (2004) Specifying and verifying hysteresis signature system with HOL-Z. Technical Report 471, ETH Zürich. Available at the URL http://kisogawa.inf.ethz.ch/WebBIB/publications/papers/ 2005/HSD.pdf.
12. Boyer RS, Moore JS (1988) Integrating decision procedures into heuristic theorem provers: a case study with linear arithmetic. Mach Intell(11):83-124
13. Basin D, Mödersheim S, Viganò L (2005) OFMC: A symbolic model checker for security protocols. International Journal of Information Security, 4(3):181-208 (Published online December 2004)
14. Backes M, Pfitzmann B, Waidner M (2003) A composable cryptographic library with nested operations. In CCS '03: Proceedings of the 10th ACM conference on computer and communications security ACM Press, New York 220-230
15. Brucker AD, Rittinger F, Wolff B (2003) HOL-Z 2.0: A proof environment for Z-specifications. J Univ Comput Sci 9(2):152-172
16. Brucker AD, Wolff B (2003) A case study of a formalized security architecture. In: Electronic Notes in Theoretical Computer Science, vol 80. Elsevier, Amsterdam
17. Chan W, Anderson RJ, Beame P, Burns S, Modugno F, Notkin D, Reese JD (1998) Model checking large software specifications. IEEE Trans Softw Eng 24(7):498-520
18. Canetti R (2001) Universally composable security: a new paradigm for cryptographic protocols. In: FOCS '01: proceedings of the 42nd IEEE symposium on foundations of computer science. IEEE Computer Society p. 136
19. Corbett JC (1996) Evaluating deadlock detection methods for concurrent software. IEEE Trans Softw Eng 22(3):161-180
20. Castellini C, Smaill A (2005) Proof planning for first-order temporal logic. In: Conference on automated deduction, vol 3632 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York 235-249
21. Dwyer MB, Avrunin GS, Corbett JC (1999) Patterns in property specifications for finite-state verification. In: ICSE '99: Proceedings of the 21st international conference on software engineering. IEEE Computer Society Press, pp. 411-420
22. Fischer C (1997) CSP-OZ: A combination of Object-Z and CSP. In Proceedings of FMOODS'97: formal methods for open object-based distributed systems, vol 2, pages 423-438. Chapman & Hall
23. Fillitre J-C, Owre S,Rue H, Shankar N (2001) les: Integrated canonizer and solver. CAV 2001, number 2102 in Lecture Notes in Computer Science
24. Gastin P, Oddoux D (2001) Fast LTL to Büchi automata translation. In: Berry G, Comon H, Finkel A (eds) Proceedings of the 13th conference on computer aided verification (CAV'01), number 2102 in Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York pp. 53-65.
25. Gupta A (1992) Formal hardware verification methods: A survey. J Formal Methods Syst Des 1:151-238
26. Hall A (1990) Seven myths of formal methods. IEEE Softw 7(5):11-19
27. Holzmann GJ (2004) The SPIN model checker: primer and reference manual. Addison-Wesley, Boston
28. International Standard ISO/IEC13568:2002. Information technology - Z formal specification notation - syntax, type system and semantics.
29. Jackson D, Sullivan K (2000) COM revisited: tool-assisted modelling of an architectural framework. In: ACM SIGSOFT Symposium on foundations of software engineering ACM Press, New York 149-158
30. Lowe G (1998) Towards a completeness result for model checking of security protocols. In: PCSFW: Proceedings of the 11th computer security foundations workshop, IEEE Computer Society Press pp. 96-105
31. Müller O, Nipkow T (1995) Combining model checking and deduction for I/O-automata. In Brinksma et al Ed (eds) Tools and algorithms for the construction and analysis of systems, 1st international workshop, TACAS'95, vol 1019 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 1-16
32. Manna Z, Pnueli A (1991) Completing the temporal picture. Theore Comput Sci J 83(1):97-130
33. Manna Z Pnueli A (1992) The temporal logic of reactive and concurrent systems:specification. Springer, Berlin Heidelberg New York
34. Norrish M (2003) Complete integer decision procedures as derived rules in HOL. In: Proceedings of TPHOLs'03, number 2758 in Lecture Notes in Computer Science, 71-86.
35. Nipkow T, Paulson LC, Wenzel M (2002) Isabelle/HOL - A proof assistant for higher-order logic, vol 2283 of Lecture Notes in Computer Science. Springer, Berlin Heidelberg New York
36. Owre S, Rajan S, Rushby JM, Shankar N, Srivas MK (1996) PVS: Combining specification, proof checking, and model checking. In: Alur R, Henzinger TA (eds) Computer-aided verification, CAV '96, number 1102 in Lecture Notes in Computer Science, Berlin Heidelberg New York, pp 411-414
37. Paulson LC (1998) The inductive approach to verifying cryptographic protocols. J Comput Sec, 6:85-128
38. Peled D (1996) Combining partial order reductions with on-the-fly model checking. Formal Methods Sys Des 8:39-64
39. Promela proofs scripts for signature system case study. URL http://people.inf.ethz.ch/basin/spin-models.tar, 2005.
40. Roscoe AW, Broadfoot PJ (1999) Proving security protocols with model checkers by data independence techniques. J Comput Sec 7(1):147-190
41. Ryan PYA, Schneider S, Goldsmith M, Lowe G, Roscoe AW (2000) The modelling and analysis of security protocols: the CSP approach. Addison-Wesley Reading
42. Rajan S, Shankar N, Srivas MK (1995) An integration of model-checking with automated proof checking. In: Wolper (ed), Computer-aided verification, CAV '95, vol 939 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 84-97
43. Sprenger C, Backes M, Basin D, Pfitzmann B, Waidner M (2006) Cryptographically sound theorem proving. In: 19th IEEE computer security foundations workshop, Venice, Italy IEEE Computer Society pp 153-166
44. Smith G (1997) Derrick J (1997) Refinement and verification of concurrent systems specified in Object-Z and CSP. In: Proceedings of the international conference of formal engineering methods, IEEE Computer Society Press
45. Shaw M, Garlan D (1996) Software architecture: perspectives on an emerging discipline. Prentice Hall, Englewood Cliffs
46. Seger C-JH, Jones RB, O'Leary JW, Melham T, Aagaard MD, Barrett C, Syme D (2005) An industrially effective environment for formal hardware verification. IEEE Trans Comput Aided Des Integrated Circuits Syst, 24(9):1381-1405
47. Susaki S, Matsumoto T (2002) Alibi establishment for electronic signatures. Inf Process Soc Jpn 43(8):2381-2393
48. Spivey JM (1992) The Z Notation: a reference manual. 2nd edn. Prentice-Hall International, New Jersey
49. Vardi MY Wolper P (1986) Automata-theoretic techniques for modal logics of programs. J Comput Syst Sci 32:183-221
50. Woodcock J, Davies J (1996) Using Z. Prentice-Hall International, New Jersey
51. Wing J, Vaziri-Farahani M (1997) A case study in model checking software systems. Sci Comput Program 28:273-299