Bounded Model Checking of Recursive Programs with Pointers in K

Asavoae, Irina Mariuca; Boer, Frank S. de; Bonsangue, Marcello M.; Lucanu, Dorel; Rot, Jurriaan

doi:10.1007/978-3-642-37635-1_4

Cited by 3 publications

(4 citation statements)

References 16 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We implemented Shylock's improved semantics in the K framework [1], and we plan to continue the investigation on the expressive power of programs with a bounded visible heap, as initiated in [33].…”

Section: Discussionmentioning

confidence: 99%

“…Note that fin is not an actual control location, it is rather only a constant of sort Loc. Other states "artificially" introduced in A post * ( l, a ) (i.e., they are not real control locations obtained from M) are denoted in the algorithm, lines 19-21, as q l,a 1 . These states are used to encode push-transitions and are actually functions symbols with two arguments: a reachable control location l and a closed term of sort Alph.…”

Section: Model Checking Invariants Via a Pushdown System Specificationmentioning

confidence: 99%

“…This development, implemented along the lines described in the current work, in [1], and the forward algorithm from [34], allows us to model check linear time temporal properties on Shylock programs. A direct consequence is that, in addition to the current safety properties, we will be able to verify also liveness properties for Shylock programs.…”

Section: Model Checking Shylock Programsmentioning

confidence: 99%

“…The novelty in our model checker resides in the on-the-fly construction of the automaton which recognizes the set of all reachable configurations from the specification in rewriting logic of the pushdown system. Moreover, the model checking algorithm presented here is implemented as a set of rewrite rules in the K framework as described in more detail in [1].…”

Section: Model Checking Shylock Programsmentioning

confidence: 99%

See 3 more Smart Citations

Model checking recursive programs interacting via the heap

Asavoae

Boer

Bonsangue

et al. 2015

Science of Computer Programming

View full text Add to dashboard Cite

Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables, the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such, a static analysis for recursive programs with dynamic manipulation of the heap is, in general, undecidable. In this paper we study the verification of recursive programs with unbounded allocation of objects, in a simple imperative language with heap manipulation. We present a semantics for this language which is improved w.r.t. heap allocation, using an abstraction that is precise (i.e., bisimilar with the standard/concrete semantics). For any program with a bounded visible heap, meaning that the number of objects reachable from variables at any point of execution is bounded, this abstraction is a finitary representation of its behaviour, even though an unbounded number of objects can appear in the state. As a consequence, for such programs model checking is decidable. Finally, we introduce a specification language for heap-properties, and we discuss model checking of heap invariant properties against heap-manipulating programs.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Model Checking Invariants Via a Pushdown System Specificationmentioning

confidence: 99%

Section: Model Checking Shylock Programsmentioning

confidence: 99%

Section: Model Checking Shylock Programsmentioning

confidence: 99%

See 2 more Smart Citations