Simple proof techniques for property preservation via simulation

Information Processing Letters

Volumn 60, Issue 3, 1996, Pages 129-134

  Chou, Ching Tsun ^a  

^a FUJITSU LABORATORIES OF AMERICA   (United States)

Author keywords

Concurrency; Infinitary logics; Programming calculi

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING;

INFINITARY LOGICS; PROGRAMMING CALCULI; PROPERTY PRESERVATION;

FORMAL LOGIC;

EID: 0030285774     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00149-4     Document Type: Article

References (12)

1. S. Bensalem, A. Bouajjani, C. Loiseaux and J. Sifakis, Property preserving simulations, in: G. v. Bochmann and D.K. Probst, eds., Proc. 4th Internat. Workshop on Computer-Aided Verification, CAV'92, Lecture Notes on Computer Science 663 (Springer, Berlin, 1992) 260-273.
2. C.-T. Chou, A simple treatment of property preservation via simulation, UCLA CS Tech. Rept. #950014, 1995; ftp://ftp.cs.ucla.edu/pub/chou/simple.ps
3. E.M. Clarke, O. Grumberg and D.E. Long, Model checking and abstraction, ACM Trans. Programming Languages Systems 16 (5) (1994) 1512-1542.
4. D. Dams, O. Grumberg and R. Gerth, Abstract interpretation of reactive systems: Preservation of CTL*, in: E.-R. Olderog, ed., IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET), IFIP Transactions (North-Holland, Amsterdam, 1994).
5. C.J. Everett, Closure operators and Galois theory in lattices, Trans. Amer. Math. Soc. 55 (1944) 514-525.
6. M.C. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1) (1985) 137-161.
7. D. Kozen, Results on the prepositional μ-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
8. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani and S. Bensalem, Property preserving abstractions for the verification of concurrent systems, Formal Methods in System Design 6(1) (1995).
9. R. Milner, An algebraic definition of simulation between programs, Proc. 2nd Internat. Joint Conf. on Artificial Intelligence (1971) 481-489.
10. R. Milner, Communication and Concurrency (Prentice Hall, Englewood Cliffs, NJ, 1989).
11. O. Ore, Galois connexions, Trans. Amer. Math. Soc. 55 (1944) 493-513.
12. J. F. Søgaard-Andersen, N.A. Lynch and B.W. Lampson, Correctness of communications protocols: A case study, Tech. Rept. MIT/LCS/TR-589, Laboratory for Computer Science, Massachusetts Institute of Technology, 1993.