Combining model checking and theorem proving to verify parallel processes

16Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To overcome the limitations of pure model checking, this verification technique is combined with theorem proving. Large processes are split into components whose correctness w.r.t. local specifications is checked via model checking. The correctness of the composition w.r.t. the global specification is then established by constructing a formal proof in a derivation system with the help of a theorem prover.

Cite

CITATION STYLE

APA

Hungar, H. (1993). Combining model checking and theorem proving to verify parallel processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 697 LNCS, pp. 154–165). Springer Verlag. https://doi.org/10.1007/3-540-56922-7_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free