메뉴 건너뛰기




Volumn 10, Issue 4, 1998, Pages 338-360

Case Study: Formal Verification of a Computerized Railway Interlocking

Author keywords

Formal verification; Railway interlocking; St lmarck's method

Indexed keywords


EID: 0000305220     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650050021     Document Type: Article
Times cited : (29)

References (26)
  • 1
    • 25344436210 scopus 로고
    • Feasibility Study SVT
    • Prover Technology AB, Internal report
    • Borälv, A. and Ågren, H. Feasibility Study SVT. Technical Report U-95002, Prover Technology AB, 1995. Internal report.
    • (1995) Technical Report U-95002
    • Borälv, A.1    Ågren, H.2
  • 2
    • 2542617181 scopus 로고    scopus 로고
    • Personal communication with Anders Berg, Railway Interlocking Logic division (RIL), ADtranz Signal, Sweden
    • Berg, A. Personal communication with Anders Berg, Railway Interlocking Logic division (RIL), ADtranz Signal, Sweden, 1998.
    • (1998)
    • Berg, A.1
  • 3
    • 84858910976 scopus 로고    scopus 로고
    • The Industrial Success of Verification Tools Based on Stålmarck's Method
    • Orna Grumberg, editor, Proceedings of the Ninth International Conference on Computer Aided Verification, Springer Verlag
    • Borälv, A. The Industrial Success of Verification Tools Based on Stålmarck's Method. In Orna Grumberg, editor, Proceedings of the Ninth International Conference on Computer Aided Verification, volume 1254 of Lecture Notes in Computer Science, pages 7-10. Springer Verlag, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1254 , pp. 7-10
    • Borälv, A.1
  • 5
    • 0022769976 scopus 로고
    • Graph-Based Algorithms for Boolean Function Manipulation
    • August
    • Bryant, R. E. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C35(8):677-691, August 1986.
    • (1986) IEEE Transactions on Computers , vol.C35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 2542545415 scopus 로고    scopus 로고
    • User experience with formal verification
    • ACM, June Convenors: Randy E Bryant (CMU, USA) and Gerry Musgrave (Brunel University, UK)
    • Panel: User experience with formal verification. In Proceedings of 35th Design Automation Conference. San Fancisco. ACM, June 1998. Convenors: Randy E Bryant (CMU, USA) and Gerry Musgrave (Brunel University, UK).
    • (1998) Proceedings of 35th Design Automation Conference. San Fancisco
  • 7
    • 2542632323 scopus 로고
    • The Sternol Programming Language
    • April
    • Ericsson Dansk Signalindustri A/S. The Sternol Programming Language. Technical report, April 1989.
    • (1989) Technical Report
  • 8
    • 2542531895 scopus 로고    scopus 로고
    • Formal verification of railway interlockings
    • Swedish National Rail Administration
    • Eriksson, L.-H. Formal verification of railway interlockings. Technical Report 1997:4, Swedish National Rail Administration, 1997.
    • (1997) Technical Report 1997:4
    • Eriksson, L.-H.1
  • 9
    • 2542539429 scopus 로고    scopus 로고
    • Formalising railway interlocking requirements
    • Swedish National Rail Administration
    • Eriksson, L.-H. Formalising railway interlocking requirements. Technical Report 1997:3, Swedish National Rail Administration, 1997.
    • (1997) Technical Report 1997:3
    • Eriksson, L.-H.1
  • 13
    • 2542521147 scopus 로고
    • Safety Criteria for Hoorn-Kersenboogerd Railway Station
    • Logic Group Preprint series, Department of Philosophy. Utrecht University
    • Fokkink, W. Safety Criteria for Hoorn-Kersenboogerd Railway Station. Technical Report 135, Logic Group Preprint series, Department of Philosophy. Utrecht University, 1995.
    • (1995) Technical Report 135
    • Fokkink, W.1
  • 14
    • 2542614110 scopus 로고
    • The Safety Guaranteeing System at station Hoorn-Kersenboogerd
    • Logic Group Preprint series, Department of Philosophy, Utrecht University
    • Groote, J. F., Koorn, J. W. C. and Vlijmen, S. F. M. van. The Safety Guaranteeing System at station Hoorn-Kersenboogerd. Technical Report 121, Logic Group Preprint series, Department of Philosophy, Utrecht University, 1994.
    • (1994) Technical Report 121
    • Groote, J.F.1    Koorn, J.W.C.2    Van Vlijmen, S.F.M.3
  • 15
    • 84956862996 scopus 로고    scopus 로고
    • The Stålmarck Method as a HOL Derived Rule
    • Theorem Proving in Higher Order Logics, Springer Verlag
    • Harrison, J. The Stålmarck Method as a HOL Derived Rule. In Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 221-234. Springer Verlag, 1996.
    • (1996) Lecture Notes in Computer Science , vol.1125 , pp. 221-234
    • Harrison, J.1
  • 17
    • 2542553059 scopus 로고    scopus 로고
    • Industrial-Strength Formal Methods
    • chapter Prover Technology in Railways. Academic Press
    • Hinchey, M. G. and Bowen, J. P. editors. Industrial-Strength Formal Methods, chapter Prover Technology in Railways. International Series in Formal Methods. Academic Press, 1998.
    • (1998) International Series in Formal Methods
    • Hinchey, M.G.1    Bowen, J.P.2
  • 20
    • 2542612557 scopus 로고    scopus 로고
    • Formal Requirement Verification of a Swedish Railway Interlocking System
    • Institut for informationsteknologi, Danmarks Tekniske Universitet, September
    • Petersen, J L. Formal Requirement Verification of a Swedish Railway Interlocking System. Technical Report 1997-006, Institut for informationsteknologi, Danmarks Tekniske Universitet, September 1997.
    • (1997) Technical Report 1997-006
    • Petersen, J.L.1
  • 22
    • 84948975180 scopus 로고    scopus 로고
    • A tutorial on Stålmarck's proof procedure for propositional logic
    • Proceedings of International Conference on Formal Methods in Computer-Aided Design (FMCAD'98)
    • Sheeran, M. and Stålmarck, G A tutorial on Stålmarck's proof procedure for propositional logic. In Proceedings of International Conference on Formal Methods in Computer-Aided Design (FMCAD'98), Lecture Notes in Computer Science, 1522, pages 82-99, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1522 , pp. 82-99
    • Sheeran, M.1    Stålmarck, G.2
  • 23
    • 25344436994 scopus 로고    scopus 로고
    • A System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated from a Formula, 1989. Swedish Patent No. 467 076 (approved 1992), U.S. Patent No. 5 276 897 (1994), European Patent No. 0403 454 (1995)
    • Stålmarck, G. A System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated from a Formula, 1989. Swedish Patent No. 467 076 (approved 1992), U.S. Patent No. 5 276 897 (1994), European Patent No. 0403 454 (1995).
    • Stålmarck, G.1
  • 24
    • 25344460664 scopus 로고    scopus 로고
    • A proof procedure for many sorted first order logic
    • (Document no: U-98011), Prover Technology AB
    • Stålmarck, G. A proof procedure for many sorted first order logic. Technical report (Document no: U-98011), Prover Technology AB, 1998.
    • (1998) Technical Report
    • Stålmarck, G.1
  • 25
    • 2542611052 scopus 로고    scopus 로고
    • May (The safety regulation for Swedish interlockings)
    • Swedish National Rail Administration. Säkerhetsordningen, May 1996. (The safety regulation for Swedish interlockings).
    • Säkerhetsordningen , pp. 1996


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.