Formalization of variables access constraints to support compositionality of liveness properties
Because reasoning about programs' liveness behavior is difficult people become interested in the potential of theorem provers to aid verification. In extending a theorem prover with a lifeness logic it would be nice if compositionality is also supported since it is a property of a great practical interest: it allows modularity in design. However, a straightforward extension that only embodies the essence of the logic will fail to do so. In implementing such an extension we should therefore be aware of the technical details required for compositionality. In particular, compositionality of progress under parallel composition depends on the concept of variable accessibility. Therefore, this concept has to be explicitly present in the extension. This paper is about the formalization of access constraints to support compositionality.
Unable to display preview. Download preview PDF.
- 1.Flemming Andersen. A Theorem Prover for UNITY in Higher Order Logic. PhD thesis, Technical University of Denmark, 1992.Google Scholar
- 2.Juanito Camilleri and Tom Melham. Reasoning with inductively defined relations in the hol theorem prove. Technical Report 265, University of Cambridge, 1992.Google Scholar
- 3.K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.Google Scholar
- 4.Mike JC Gordon and Tom F Melham. Introduction to HOL. Cambridge University Press, 1993.Google Scholar
- 5.Roger W.S. Hale. Programming in Temporal Logic. PhD thesis, University of Cambridge, 1988.Google Scholar
- 6.J. Pachl. Three definitions of leads-to for UNITY. Notes on UNITY, 23–90, December 1990.Google Scholar
- 7.ISWB Prasetya. Documentation of HOL-Library UNITY. University of Utrecht, 1993. Will appear as a technical report.Google Scholar
- 8.A.K. Singh. Leads-to and program union. Notes on UNITY, 06–89, 1989.Google Scholar
- 9.J. von Wright and T. Långbacka. Using a theorem prover for reasoning about concurent algorithms. In Proc. 4th Workshop on Computer-Aided Verification, Montreal, Canada, June 1992. Springer-Verlag.Google Scholar