Language definitions as rewrite theories

Rusu, Vlad; Lucanu, Dorel; Serbanuta, Traian-Florin; Arusoaie, Andrei; Ștefănescu, Andrei; Roşu, Grigore

doi:10.1016/j.jlamp.2015.09.001

Cited by 12 publications

(10 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By contrast, in a deep embedding programs have to stay within the bounds of the guest language's syntax and semantics. The same dichotomy (shallow vs. deep embeddings) distinguishes the present paper with our previous work on language-parametric symbolic execution, program verification and program equivalence [11,12,13,14,15].…”

Section: Introductionmentioning

confidence: 73%

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

Rusu¹,

Arusoaie²

2017

Journal of Logical and Algebraic Methods in Programming

Self Cite

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

Section: Introductionmentioning

confidence: 73%

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

Rusu¹,

Arusoaie²

2017

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…We have integrated our symbolic execution framework in version 3.4 of the K framework [42]. In K, the definition of a language, say, L, is compiled into a Maude [10] rewrite theory using the technique described in [44]. Then, the K runner executes programs in L by applying the resulting rewrite rules to configurations containing programs.…”

Section: Symbolic Execution Within the K Framework 34mentioning

confidence: 99%

“…Language transformations techniques to compute for such a symbolic model are proposed in [4]. Moreover, the paper [44] deals with the implementation of concrete and symbolic execution in programming languages using rewrite theories; precise and approximated implementations are proposed. While ML formulas as a precise symbolic model, and combination of ACU axioms, are considered in [4,44], neither of those papers deal with RL formula verification, nor do they employ (co)induction as a systematic, rigorous technique for reasoning about possibly infinite program executions.…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, the paper [44] deals with the implementation of concrete and symbolic execution in programming languages using rewrite theories; precise and approximated implementations are proposed. While ML formulas as a precise symbolic model, and combination of ACU axioms, are considered in [4,44], neither of those papers deal with RL formula verification, nor do they employ (co)induction as a systematic, rigorous technique for reasoning about possibly infinite program executions. RL formula verification is dealt with in [26], but the procedure for RL verification proposed there is only a a particular case of the proof system proposed here.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A generic framework for symbolic execution: A coinductive approach

Lucanu

Rusu

Arusoaie

2017

Journal of Symbolic Computation

Self Cite

View full text Add to dashboard Cite

We propose a language-independent symbolic execution framework. The approach is parameterised by a language definition, which consists of a signature for the syntax and execution infrastructure of the language, a model interpreting the signature, and rewrite rules for the language's operational semantics. Then, symbolic execution amounts to computing symbolic paths using a derivative operation. We prove that the symbolic execution thus defined has the properties naturally expected from it, meaning that the feasible symbolic executions of a program and the concrete executions of the same program mutually simulate each other. We also show how a coinduction-based extension of symbolic execution can be used for the deductive verification of programs. We show how the proposed symbolic-execution approach, and the coinductive verification technique based on it, can be seamlessly implemented in language definition frameworks based on rewriting such as the K framework. A prototype implementation of our approach has been developed in K. We illustrate it on the symbolic analysis and deductive verification of nontrivial programs.

show abstract

“…As a semantical framework, Maude has been used to specify the semantics of several languages, such as LOTOS [35], CCS [35], and Java [9]. Moreover, the K-Maude compiler [28], which is able to translate K specifications into Maude, has eased the methodology to describe programming language semantics in Maude.…”

Section: Introductionmentioning

confidence: 99%

Context-Updates Analysis and Refinement in Chisel

Asavoae

Asăvoae

Riesco

2018

Model Checking Software

View full text Add to dashboard Cite

This paper presents the context-updates synthesis component of Chisel-a tool that synthesizes a program slicer directly from a given algebraic specification of a programming language operational semantics. (By context-updates we understand programming language constructs such as goto instructions or function calls.) The context-updates synthesis follows two directions: an overapproximating phase that extracts a set of potential context-update constructs and an underapproximating phase that refines the results of the first step by testing the behaviour of the context-updates constructs produced at the previous phase. We use two experimental semantics that cover two types of language paradigms: high-level imperative and low-level assembly languages and we conduct the tests on standard benchmarks used in avionics.

show abstract

Language definitions as rewrite theories

Cited by 12 publications

References 14 publications

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

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

A generic framework for symbolic execution: A coinductive approach

Context-Updates Analysis and Refinement in Chisel

Contact Info

Product

Resources

About