One-Path Reachability Logic

Roşu, Grigore; Ștefănescu, Andrei; Ciobâcă, Ștefan; Moore, B.

doi:10.1109/lics.2013.42

Cited by 45 publications

(54 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reachability Logic (hereafter, rl) was introduced in a series of papers [1,2,3,4] as a means for specifying the operational semantics of programming languages and for stating reachability properties between states of program executions. Briefly, an rl formula ' ) ' 0 expresses reachability relationships between two sets of states of a system, denoted by the patterns ' and ' 0 respectively.…”

Section: Introductionmentioning

confidence: 99%

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Lucanu

Rusu

Arusoaie

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Reachability Logic is a recently introduced formalism, which is currently used for defining the operational semantics of programming languages and for stating properties about program executions. In this paper we show how Reachability Logic can be adapted for stating properties of transition systems described by Rewriting-Logic specifications. We propose an automatic procedure for verifying Rewriting-Logic specifications against Reachability-Logic properties. We prove the soundness of the procedure and illustrate it by verifying a communication protocol specified in Maude.

show abstract

Section: Introductionmentioning

confidence: 99%

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Lucanu

Rusu

Arusoaie

et al. 2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Several versions of Reachability Logic have been proposed in the last few years [3,4,5,6]. Moreover, rl is built on top of Matching Logic (ml), which also exists in several versions [38,39,40].…”

Section: Reachability Logic ( Rl)mentioning

confidence: 99%

“…We illustrate the resulting language with simple imperative-functional programs. We show how programs can be: executed with concrete and symbolic data; formally verified with respect to properties expressed in Reachability Logic [3,4,5,6], a language-independent generalisation of Hoare logic; and formally proved equivalent. The soundness of symbolic execution, program verification and program-equivalence verification is formally proved.…”

Section: Introductionmentioning

confidence: 99%

Executing and verifying higher-order functional-imperative programs in Maude

Rusu¹,

Arusoaie²

2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

We incorporate higher-order functions and state monads in Maude, thereby embedding a higher-order functional language with imperative features in the Maude framework. We illustrate, via simple programs in the resulting language: the concrete and symbolic execution of programs; their verification with respect to properties expressed in Reachability Logic, a languageparametric generalisation of Hoare Logic; and the verification of programequivalence properties. Our approach is proved sound and is implemented in Full Maude by taking advantage of its reflective features and module system.

show abstract

“…Our running example is imp, a simple imperative language intensively used in research papers (e.g., [31,28]). The syntax of imp is described in Figure 1 and is mostly self-explanatory since it uses a BNF notation.…”

Section: A Simple Imperative Language and Its Denition In Kmentioning

confidence: 99%

Symbolic execution based on language transformation

Arusoaie

Lucanu

Rusu

2015

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

International audienceWe propose a language-independent symbolic execution framework for languages endowed with a formal operational semantics based on term rewriting. Starting from a given definition of a language, a new language definition is generated, with the same syntax as the original one, but whose semantical rules are transformed in order to rewrite over logical formulas denoting possibly infinite sets of program states. Then, the symbolic execution of concrete programs is, by definition , the execution of the same programs with the symbolic semantics. We prove that the symbolic execution thus defined has the properties naturally expected from it (with respect to concrete program execution). A prototype implementation of our approach was developed in the K Framework. We demonstrate the tool's genericity by instantiating it on several languages, and illustrate it on the reachability analysis and model checking of several programs

show abstract

One-Path Reachability Logic

Cited by 45 publications

References 22 publications

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Executing and verifying higher-order functional-imperative programs in Maude

Symbolic execution based on language transformation

Contact Info

Product

Resources

About