A mechanized proof environment for the convenient computations proof method

Formal Methods in System Design

Volumn 23, Issue 2, 2003, Pages 115-142

  Glusman, Marcelo ^a   Katz, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Convenient computations; Deductive theorem proving; Formal verification; Proof environment; PVS

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DISTRIBUTED DATABASE SYSTEMS; FORMAL LOGIC; MATHEMATICAL MODELS;

CONVENIENT COMPUTATIONS; DEDUCTIVE THEOREM PROVING; FORMAL VERIFICATION; PROOF ENVIRONMENT;

THEOREM PROVING;

EID: 0042824126     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1024746015231     Document Type: Article

References (27)

1. J.-R. Abrial, The B-Book-Assigning Programs to Meanings, Cambridge University Press, 1996.
2. K.R. Apt, N. Frnacez, and S. Katz, "Appraising fairness in languages for distributed programming," Distributed Computing, Vol. 2, pp. 226-241, 1988.
3. K.M. Chandy and L. Lamport, "Distributed snapshots: Determining global states of distributed systems," ACM Transactions on Computer Systems, Vol. 3, No. 1, pp. 63-75, 1985.
4. C. Chou and E. Gafni, "Understanding and verifying distributed algorithms using stratified decomposition," in Proceedings of 7th ACM Symposium on Principles of Distributed Computing (PODC), pp. 44-65, 1988.
5. T. Elrad and N. Francez, "Decompositions of distributed programs into communication closed layers," Science of Computer Programming, Vol. 2, No. 3, pp. 155-173, 1982.
6. N. Francez, Fairness, Springer-Verlag, 1986.
7. M. Glusman and S. Katz, "Mechanizing proofs of computation equivalence," in N. Halbwachs and D. Peled (Eds.), Proceedings of 11th International Conference on Computer-Aided Verification (CAV'99), Vol. 1633 of LNCS, Springer-Verlag, Trento, Italy, pp. 354-367, 1999.
8. M. Glusman and S. Katz, "Extending memory consistency of finite prefixes to infinite computations," in K.G. Larsen and M. Nielsen (eds.), Proceedings of 12th International Conference on Concurrency Theory, CONCUR'01, Vol. 2154 of LNCS, Springer-Verlag, Aalborg, Denmark, pp. 411-425, Aug. 2001.
9. 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 (Eds.), Partial Order Methods in Verification, Vol. 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 289-303, 1997.
10. D. Goldschlag, Mechanically Verifying Concurrent Programs, Ph.D Thesis, Department of Computer Science, University of Texas at Austin, 1992.
11. J. Hooman, "Program design in PVS," in K. Berghammer, J. Peleska, and B Buth (Eds.), Workshop on Tool Support for System Development and Verification, Bremen, Germany, 1997. Available at http://www.win.tue.nl/cs/tt/hooman/PDPVS.html.
12. P.B. Jackson, "Verifying a garbage collection algorithm," in J. Grundy and M. Newey (Eds.), Proceedings of 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'98), Vol. 1479 of LNCS, Springer-Verlag, pp. 225-244, Sept. 1998.
13. C.B. Jones, Systematic Software Development Using VDM, Prentice Hall International, 2nd edn., 1990.
14. S. Katz, "Refinement with global equivalence proofs in temporal logic," in D. Peled, V. Pratt, and G. Holzmann (Eds.), Partial Order Methods in Verification, Vol. 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science,American Mathematical Society, pp. 59-78, 1997.
15. S. Katz and D. Peled, "Defining conditional independence using collapses," Theoretical Computer Science, Vol. 101, pp. 337-359, 1992.
16. S. Katz and D. Peled, "Verification of distributed programs using representative interleaving sequences," Distributed Computing, Vol. 6, pp. 107-120, 1992.
17. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems-Specification, Springer-Verlag, 1992.
18. A. Mazurkiewicz, "Trace theory," in W. Brauer, W. Reisig, and G. Rozenburg (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency, Vol. 255 of LNCS, Springer-Verlag, pp. 279-324, 1986.
19. C. Muñoz and J. Rushby, "Structural embeddings: Mechanization with method," in J. Wing and J. Woodcock (Eds.), FM99: The World Congress in Formal Methods, Vol. 1708 of LNCS, Springer-Verlag, Toulouse, France, pp. 452-471, Sept. 1999.
20. S. Owre, J. Rushby, N. Shankar, and F. von Henke, "Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS," IEEE Transactions on Software Engineering, Vol. 21, No. 2, pp. 107-125, 1995.
21. S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Calvert, PVS Language Reference, Computer Science Laboratory, SRI International, Menlo Park, CA, Sept. 1998.
22. D. Peled, "Combining partial order reductions with on-the-fly model checking," Journal of Formal Methods in System Design, Vol. 8, pp. 39-64, 1996.
23. D. Peled and A. Pneulie, "Proving partial order properties," Theoretical Computer Science, Vol. 126. pp. 143-182, 1994.
24. D. Peled, V. Pratt, and G. Holzmann (Eds.), Partial Order Methods in Verification, Vol. 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1997.
25. S. Qadeer and N. Shankar, "Verifying a self-stabilizing mutual exclusion algorithm," in D. Gries and W.P. de Roever (Eds.), IFIP International Conference on Programming Concepts and Methods (PROCOMET '98), Chapman & Hall, Shelter Island, NY, pp. 424-443, June 1998.
26. J. Rushby, S. Owre, and N. Shankar, "Subtypes for specifications: Predicate subtyping in PVS," IEEE Transactions on Software Engineering, Vol. 24, No. 9, pp. 709-720, 1998.
27. P. Wolper and P. Godefroid, "Partial-order methods for temporal verification," in E. Best (Ed.), Proceedings of the 4th International Conference on Concurrency Theory (CONCUR '93), Vol. 715 of LNCS, 1993.