On the logic of UNITY
- 6 March 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 139 (1-2) , 27-67
- https://doi.org/10.1016/0304-3975(94)00043-i
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Proof systems for infinite behavioursInformation and Computation, 1992
- A simple proof of a completeness result for leads-to in the UNITY logicInformation Processing Letters, 1992
- Eliminating the substitution axiom from UNITY logicFormal Aspects of Computing, 1991
- A predicate transformer for progressInformation Processing Letters, 1990
- Rooting UNITYACM SIGSOFT Software Engineering Notes, 1989
- Countable nondeterminism and random assignmentJournal of the ACM, 1986
- FairnessPublished by Springer Nature ,1986
- While-programs with nondeterministic assignments and the logic ALNATheoretical Computer Science, 1985
- Proof rules and transformations dealing with fairnessScience of Computer Programming, 1983
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981