Skip to main content
Conference ProceedingsOPEN ACCESS

LEAP: A tool for the parametrized verification of concurrent datatypes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8559 LNCS 620-627
DOI: 10.1007/978-3-319-08867-9_41
2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This tool paper describes Leap, a tool for the verification of concurrent datatypes and parametrized systems composed by an unbounded number of threads that manipulate infinite data. Leap receives as input a concurrent program description and a specification and automatically generates a finite set of verification conditions which are then discharged to specialized decision procedures. The validity of all discharged verification conditions implies that the program executed by any number of threads satisfies the specification. Currently, Leap includes not only decision procedures for integers and Booleans, but it also implements specific theories for heap memory layouts such as linked-lists and skiplists. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Sánchez, A., & Sánchez, C. (2014). LEAP: A tool for the parametrized verification of concurrent datatypes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8559 LNCS, pp. 620–627). Springer Verlag. https://doi.org/10.1007/978-3-319-08867-9_41

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