A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Specialization with Constrained Generalization for Software Model Checking
[chapter]
2013
Lecture Notes in Computer Science
We present a method for verifying properties of imperative programs by using techniques based on constraint logic programming (CLP). We consider a simple imperative language, called SIMP, extended with a nondeterministic choice operator and we address the problem of checking whether or not a safety property ϕ (that specifies that an unsafe configuration cannot be reached) holds for a SIMP program P . The operational semantics of the language SIMP is specified via an interpreter I written as a
doi:10.1007/978-3-642-38197-3_5
fatcat:47cxzdfthzhvdmn3h5fpazvjge