Model checking birth and death

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 435-447

  Distefano, Dino ^a   Rensink, Arend ^a   Katoen, Joost Pieter ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; SEMANTICS; TEMPORAL LOGIC;

DE-ALLOCATION; DYNAMIC ALLOCATIONS; HISTORY DEPENDENT AUTOMATA; IMPERATIVE LANGUAGES; MODEL CHECKING ALGORITHM; OBJECT-BASED SYSTEMS; OPERATIONAL SEMANTICS; SYMBOLIC REPRESENTATION;

MODEL CHECKING;

EID: 84891131031     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_36     Document Type: Article

References (20)

1. M. Abadi, A. Gordon. A calculus for cryptographic protocols: The spi calculus. Inf. & Comp. 148(1): 1-70, 1999.
2. M. Ben-Ari, A. Pnueli, Z. Manna. The temporal logic of branching time. Acta Inf. 20(3):207-226,1983.
3. L. Caires, L. Cardelli. A spatial logic for concurrency (part I). In TACS'OI, LNCS 2255:1-37, Springer, 2001.
4. L. Cardelli, A. Gordon. Logical properties of name restriction. In TLCA'OI, LNCS 2044:46-60, Springer, 2001.
5. L. Cardelli, A. Gordon. Mobile ambients. In FoSSaCS'98, LNCS 1378:140-155, Springer, 1998.
6. E. Clarke, E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, LNCS 131:52-71, Springer, 1981.
7. J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, Robby, S. Laubach, H. Zheng. Bandera: Extracting finite-state models from Java source code. In ICSE'OO pp. 439-48, IEEE CS Press, 2000.
8. D. Distefano, J.-P. Katoen, A. Rensink. On a temporal logic for object-based systems. In FMOODS'00, pp. 305-326, Kluwer, 2000.
9. D. Distefano, A. Rensink J.-P. Katoen. Model checking dynamic allocation and deallocation. Technical report TR-01-40, University of Twente, 2002. Available on line at http://fmt.cs.utwente.nl/~ddino/papers/DSRK01-report.ps.gz
10. E. A. Emerson. Automata, tableaux and temporal logics. In Logic of Programs, LNCS 193:79-88, Springer, 1985.
11. J. Fiadeiro, T. Maibaum. Verifying for reuse: foundations of object-oriented system verification. In Theory and Formal Methods, pp. 235-257, 1995.
12. K. Havelund, T. Pressburger. Model checking Java programs using Java PathFinder. Int. J. on Software Tools for Technology Transfer, 2(4):366-381, 2000.
13. O. Kupferman, M. Y. Vardi, P. Wolper. An automata-theoretic approach to branching-time model checking. J. of the ACM, 47(2): 312-360, 2000.
14. O. Lichtenstein, A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In POPL'85, pp. 97-107, ACM Press, 1985.
15. R. Milner, J. Parrow, D. Walker. A calculus of mobile processes. Inf. & Comp. 100(1): 1-77,1992.
16. U. Montanari, M. Pistore. An introduction to history-dependent automata. Electr. Notes in Th. Comp. ScL, 10,1998.
17. A. Pnueli. The temporal logic of programs. In FOCS'77, pp. 46-57, IEEE CS Press, 1977.
18. A. Sernadas, C. Sernadas, J.F. Costa. Object specification logic. J. of Logic & Computation, 5(5):603-630, 1995.
19. M. Y. Vardi, P. Wolper. An automata-theoretic approach to automatic program verification. In LICS'86, pp. 332-344, IEEE CS Press, 1986.
20. E. Yahav. Verifying safety properties of concurrent Java programs using 3-valued logic. In POPL 2001, pp. 27-40 ACM Press, 2001.