James Williams
Abstract
The purpose of this paper is to briefly describe the Practical Verification System (PVS), discuss its current implementation status, and sketch long term development plans. We begin with a review of ideas leading up to the PVS design.
- P. R. Eggert, Overview of the Ina Jo Specification Language, System Development Corporation TM(L)-6021/001/00, Santa Monica, CA, 1980.Google Scholar
- K. Levitt, The HDM Handbook, Vol. 1, SRI International, Menlo Park, CA 94025, 1979.Google Scholar
- S. L. Gerhart, AFFIRM User's Guide, USC Information Sciences Institute, Marina del Rey, California, 1979.Google Scholar
- D. Good, et al, Report on the Language Gypsy, ISCA-CMP-10, September 1978.Google Scholar
- F. L. Bauer, "Programming as an Evolutionary Process," Language Hierarchies and Interfaces, Lecture Notes in Computer Science, Vol. 46, Springer-Verlag, New York, 1976. Google ScholarDigital Library
- M. Broy, P. Pepper, "Program Development as a Formal Activity," IEEE Trans. Software Eng., Vol. SE-7, January 1981.Google ScholarDigital Library
- D. S. Wile, "Type Transformations," IEEE Trans. Software Eng., Vol. SE-7, January 1981.Google ScholarDigital Library
- P. London and M. Feather, "Implementing Specification Freedoms", Science of Computer Programming 2, North Holland Publishing Company, 1982, pp. 91--131.Google Scholar
- D. S. Wile, "POPART: Producer of Parsers and Related Tools, System Builders' Manual," Information Sciences Institute, October 1981.Google Scholar
- J. G. Williams, "A logic for Reasoning About Programs", MTP 240, The MITRE Corporation, January, 1984.Google Scholar
- Applebaum, C. H., and J. G. Williams, "PVS -- Design for a Practical Verification System," Proceedings of the ACM' 84 Annual Conference: The Fifth Generation Challenge, 1984. Google ScholarDigital Library
- E. Lusk, William McCune, and R. Overbeek, "Logic machine architecture: kernel functions," Proceeding of the Sixth Conference on Automated Deduction, Spinger-Verlag, 1982. Google ScholarDigital Library
Recommendations
Automated verification of practical garbage collectors
POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesGarbage collectors are notoriously hard to verify, due to their low-level interaction with the underlying system and the general difficulty in reasoning about reachability in graphs. Several papers have presented verified collectors, but either the ...
Formally Validating a Practical Verification Condition Generator
Computer Aided VerificationAbstractA program verifier produces reliable results only if both the logic used to justify the program’s correctness is sound, and the implementation of the program verifier is itself correct. Whereas it is common to formally prove soundness of the logic,...
Automated verification of practical garbage collectors
POPL '09Garbage collectors are notoriously hard to verify, due to their low-level interaction with the underlying system and the general difficulty in reasoning about reachability in graphs. Several papers have presented verified collectors, but either the ...
Comments