Abstract
In this paper we investigate the use of assumption-commitment techniques for compositional proofs of safety and liveness properties of networks of processes. An inductive inference strategy to discharge mutually dependent assumptions is investigated. Some existing proof techniques are justified in terms of this framework.
Author supplied keywords
Cite
CITATION STYLE
Pandya, P. K. (1990). Some comments on the assumption-commitment framework for compositional verification of distributed programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 430 LNCS, pp. 622–640). Springer Verlag. https://doi.org/10.1007/3-540-52559-9_81
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
