SymPaths: Symbolic Execution Meets Partial Order Reduction

Boer, Frank S. de; Bonsangue, Marcello M.; Johnsen, Einar Broch; Pun, Ka I; Tarifa, Silvia Lizeth Tapia; Tveito, Lars

doi:10.1007/978-3-030-64354-6_13

Cited by 2 publications

(1 citation statement)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Symbolic Execution (SE) [26,31] is a core technique in program verification, which is recently receiving increasing attention for concurrent systems [29,6,7]. For the Active Objects [8] concurrency model, experiences with multiple case studies [12,23,24] led to the design of the Behavioral Program Logic (BPL) [19], a dynamic logic that generalizes SE to Behavioral Symbolic Execution (BSE).…”

Section: Introductionmentioning

confidence: 99%

Crowbar: Behavioral Symbolic Execution for Deductive Verification of Active Objects

Kamburjan¹,

Scaletta²,

Rollshausen³

2021

Preprint

View full text Add to dashboard Cite

We present the Crowbar tool, a deductive verification system for the ABS language. ABS models distributed systems with the Active Object concurrency model. Crowbar implements behavioral symbolic execution: each method is symbolically executed, but specification and prior static analyses influence the shape of the symbolic execution tree. User interaction is realized through guided counterexamples, which present failed proof branches in terms of the input program. Crowbar has a clear interface to implement new specification languages and verification calculi in the Behavioral Program Logic and has been applied for the biggest verification case study of Active Objects.

show abstract

Section: Introductionmentioning

confidence: 99%

Crowbar: Behavioral Symbolic Execution for Deductive Verification of Active Objects

Kamburjan¹,

Scaletta²,

Rollshausen³

2021

Preprint

View full text Add to dashboard Cite

show abstract

Symbolic execution formally explained

Boer

Bonsangue

2021

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

In this paper, we provide a formal explanation of symbolic execution in terms of a symbolic transition system and prove its correctness and completeness with respect to an operational semantics which models the execution on concrete values.We first introduce a formalmodel for a basic programming languagewith a statically fixed number of programming variables. This model is extended to a programming language with recursive procedures which are called by a call-by-value parameter mechanism. Finally, we present a more general formal framework for proving the soundness and completeness of the symbolic execution of a basic object-oriented language which features dynamically allocated variables.

show abstract

SymPaths: Symbolic Execution Meets Partial Order Reduction

Cited by 2 publications

References 34 publications

Crowbar: Behavioral Symbolic Execution for Deductive Verification of Active Objects

Crowbar: Behavioral Symbolic Execution for Deductive Verification of Active Objects

Symbolic execution formally explained

Contact Info

Product

Resources

About