Functional specification of time-sensitive communicating systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Lazy Compositional Verification
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Computer-aided Support for Secure Tropos
Automated Software Engineering
The brighter side of risks in peer-to-peer barter relationships
Future Generation Computer Systems
| Hi-index | 0.00 |
A new proof is given that every property can be expressed as a conjunction of safety and liveness properties. The proof is in terms of first-order predicate logic.