A simple proof of a completeness result for leads-to in the UNITY logic
- 1 January 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 41 (1) , 35-38
- https://doi.org/10.1016/0020-0190(92)90077-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Eliminating the substitution axiom from UNITY logicFormal Aspects of Computing, 1991
- A predicate transformer for progressInformation Processing Letters, 1990
- A predicate transformer approach to semantics of parallel programsPublished by Association for Computing Machinery (ACM) ,1989
- Rooting UNITYPublished by Association for Computing Machinery (ACM) ,1989