Abstract
A graphical tool for proving leadsto progress properties of UNITY programs is described. The tool allows a user to draw Directed Acyclic Graphs (DAGs) that outlines the proof of UNITY leadsto progress properties. From these DAGs the tool generates proof scripts that contain proofs of the leadsto properties. Edges in the DAGs are annotated with information that can direct a theorem prover on how to prove the progress properties that they represent. The proof script generated by the tool can be compiled into another proof script which can be checked by a theorem prover. Using this graphical tool it is possible, modulo the strength of the theorem prover, to automatically prove that a program satisfies a leadsto property specified as a DAG which defines the proof structure.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Flemming Andersen. A Theorem Prover for UNITY in Higher Order Logic. PhD thesis, Technical University of Denmark, 1992. Also published as TFL RT 1992-3, Tele Danmark Research, 1992.
Flemming Andersen, Kim Dam Petersen, and Jimmi S. Pettersson. Program Verification using HOL-UNITY. In HUG'93: HOL User's Group Workshop, pages 1–17, 1993.
Flemming Andersen, Klaus Elmquist Nielsen, Kim Dam Petersen and Jimmi S. Pettersson. The HOL-UNITY Language, Reference Manual 1.0. In preparation.
Ulla Binau. Correct Concurrent Programs: A UNITY design method for Compositional C++ Programs. PhD thesis, Technical University of Denmark, 1994.
K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.
William Chia-Wey Cheng. TGIF(n) Unix Manual. Version 2.14, patchlevel 9, 1993.
Editors: Ove Færgemand and A. Sarma. SDL '93 Using Objects: Proceedings of the Sixth SDL Forum, Darmstadt, Germany 1993. North Holland, 1993.
Michael J.C. Gordon. HOL — A Proof Generating System for Higher Order Logic. Cambridge University, Computer Laboratory, 1987.
E. Pascal Gribomont. Design, verification and documentation of concurrent systems. 4th Refinement Workshop, Eds. Joseph M. Morris and Roger C. Shaw, Springer Verlag, 1991.
Brian W. Kernighan and Dennis M. Ritchie. The C Programming Language. Prentice Hall. 1978, Second Edition 1988.
Zohar Manna and Amir Pnueli. Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs. Science of Computer Programming 4, pp. 257–289, 1984.
Klaus Elmquist Nielsen. The HOL-UNITY compiler. Technical report in preparation, Tele Danmark Research, 1994.
Susan Owicki and Leslie Lamport. Proving Liveness Properties of Concurrent Programs. ACM TOPLAS, Vol. 4, No. 3, July 1992. Pages 456–495.
Kim Dam Petersen. HOL-UNITY Tactics — Automatic Proof of Basic Properties. TFL LD-1994-2, Tele Danmark Research, December 1993.
Kim Dam Petersen and Jimmi S. Pettersson. Proving Protocols Correct — Proving Safety and Progress Properties of the Sliding Window Protocol using HOL-UNITY. Research Report TFL RR 1993-3, Tele Danmark Research, December 1993.
K. Slind. HOL90 User's Manual. Technical Report, Technical University of Munich.
Bjarne Stroustrup. The C++ Programming Language. Addison Wesley. 1991. Second Edition, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersen, F., Petersen, K.D., Pettersson, J.S. (1994). A graphical tool for proving UNITY progress. In: Melham, T.F., Camilleri, J. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1994. Lecture Notes in Computer Science, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58450-1_32
Download citation
DOI: https://doi.org/10.1007/3-540-58450-1_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58450-6
Online ISBN: 978-3-540-48803-3
eBook Packages: Springer Book Archive