Skip to main content
Conference ProceedingsOPEN ACCESS

Abstract analysis of symbolic executions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6174 LNCS 495-510
DOI: 10.1007/978-3-642-14295-6_43
5Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Multicore technology has moved concurrent programming to the forefront of computer science. In this paper, we look at the problem of reasoning about concurrent systems with infinite data domains and non-deterministic input, and develop a method for verification and falsification of safety properties of such systems. Novel characteristics of this method are (a) constructing under-approximating models via symbolic execution with abstract matching and (b) proving safety using under-approximating models. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Albarghouthi, A., Gurfinkel, A., Wei, O., & Chechik, M. (2010). Abstract analysis of symbolic executions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 495–510). https://doi.org/10.1007/978-3-642-14295-6_43

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