Mechanizing proofs of computation equivalence

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

Volumn 1633, Issue , 1999, Pages 354-367

  Glusman, Marcelo ^a   Katz, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; SEMANTICS;

EXPLICIT SEMANTICS; INTERLEAVINGS; LIVENESS PROPERTIES; MECHANIZED VERIFICATIONS; PARALLEL COMPUTATION; S-THEORY;

COMPUTATION THEORY;

EID: 84957082848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_31     Document Type: Conference Paper

References (18)

1. K. Apt and E. R. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.
2. K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226-241, 1988.
3. K.M. Chandy and L. Lamport. Distributed snapshots: determining global states of distributed systems. ACM Trans. on Computer Systems, 3(1):63-75, Feb 1985.
4. C. Chou and E. Gafni. Understanding and verifying distributed algorithms using stratified decomposition. In Proceedings of 7th ACM PODC, pages 44-65, 1988.
5. T. Elrad and N. Francez. Decompositions of distributed programs into communication closed layers. Science of Computer Programming, 2(3):155-173, 1982.
6. N. Francez. Fairness. Springer-Verlag, 1986.
7. P. Godefroid. On the costs and benefits of using partial-order methods for the verification of concurrent systems. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 289-303. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.
8. S. Katz. Refinement with global equivalence proofs in temporal logic. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 59-78. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.
9. S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75:263-287, 1990. Preliminary version was in the 6th ACM-PODC, 1987.
10. S. Katz and D. Peled. Defining conditional independence using collapses. Theoretical Computer Science, 101:337-359, 1992.
11. S. Katz and D. Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6:107-120, 1992.
12. S. Owre, N. Shankar, J. M. Rushby, and D. W. J. Stringer-Calvert. PVS Language Reference. Computer Science Lab, SRI International, Menlo Park, CA, 1998.
13. Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, February 1995.
14. D. Peled. Combining partial order reductions with on-the-fly model checking. Journal of Formal Methods in System Design, 8:39-64, 1996.
15. D. Peled and A. Pnueli. Proving partial order properties. Theoretical Computer Science, 126:143-182, 1994.
16. D. Peled, V. Pratt, and G. Holzmann(eds). Partial Order Methods in Verification. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.
17. John Rushby, Sam Owre, and N. Shankar. Subtypes for specifications: Predicate subtyping in PVS. IEEE Transactions on Software Engineering, 24(9):709-720, September 1998.
18. P. Wolper and P. Godefroid. Partial-order methods for temporal verification. In Proceedings of CONCUR'93 (Eike Best, ed), LNCS 715, 1993.