Skip to main content
Conference ProceedingsOPEN ACCESS

SPLIT: A compositional LTL verifier

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6174 LNCS 558-561
DOI: 10.1007/978-3-642-14295-6_47
8Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes Split, a compositional verifier for safety and general Ltl properties of shared-variable, multi-threaded programs. The foundation is a computation of compact local invariants, one for each process, which are used for constructing a proof for the property. An automatic refinement procedure gradually exposes more local information, until a decisive result (proof/disproof) is obtained. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Cohen, A., Namjoshi, K. S., & Sa’ar, Y. (2010). SPLIT: A compositional LTL verifier. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 558–561). https://doi.org/10.1007/978-3-642-14295-6_47

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