Verifying the correctness of AADL modules using model checking

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

Volumn 430 LNCS, Issue , 1990, Pages 386-400

  Josko, Bernhard ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Computer architecture; Expressiveness; Model checking; Modular specification; Temporal logic; Verification

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER CIRCUITS; OPEN SYSTEMS; SPECIFICATIONS; TEMPORAL LOGIC; VERIFICATION;

EXPRESSIVENESS; MODULAR SPECIFICATIONS; STATE EXPLOSION PROBLEMS; TEMPORAL LOGIC SPECIFICATIONS;

MODEL CHECKING;

EID: 84948135837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-52559-9_72     Document Type: Conference Paper

References (14)

1. W. Damm, G. DOhmen, B. Josko, F. Korf, T. Peikenkamp: AADL Language Document. Internal report, University of Oldenburg, 1989
2. M. Ben-Ari, Z. Manna, A. Pnueli: The temporal logic of branching time. Acta Infonmatica 20, 207-226 (1983)
3. E.M. Clarke, E.A. Emerson, A.P. Sistla: Automatic verification of finite-state concurrent systems using temporal logic specifications: a practical approach. Tenth ACM Symposium on Principles of Programming Languages, 117-126 (1983)
4. W. Damm, G. Dohmcn: AADL: A net based specification method for computer architecture design, in: de Bakker (Ed.): Languages for Parallel Architectures: Design, Semantics, and Implementation Models, Wiley & Sons (1990)
5. W. Damm, G. Dohmen, V. Gerstner, B. Josko: Modular verification of Petri nets: The temporal logic approach. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness. 1989
6. E.A. Emerson, J.Y. Halpem: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30, 1-24 (1985)
7. E.A. Emerson, J.Y. Halpem: "Sometimes" and "not never" revisited: On branching versus linear time temporal logic. Journal of the ACM 33, 151-178 (1986)
8. E.A. Emerson, C.L. Lei: Modalities for model checking: branching time logic strikes back. Technical Report, Dep. of Computer Sciences, University of Texas (1985)
9. B. Josko: Modelchecking of CTL formulae under liveness assumptions. Proceedings of 14th ICALP-Conference, Lecture Notes in Computer Science 267, 280-289 (1987)
10. B. Josko: Modelchecking of CTL formulae under liveness and safety assumptions. Internal report, University of Oldenburg (1989)
11. Z. Manna, A. Pnueli: Verification of concurrent programs: The temporal framework, in: R,S. Boyer, J.S. Moore (Eds.): The Correctness Problem in Computer Science. Academic Press (1981)
12. A.P. Sistla, E.M. Clarke: The complexity of prepositional temporal logic. 14th ACM Symposium on Theory of Computing, 159-167 (1982)
13. A.P. Sistla, E.M. Clarke: The complexity of prepositional linear temporal logic. Journal of the ACM 32, 733-749 (1985)
14. R. Taijan: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1, 146-160 (1972)