Proving Safety Properties of Rewrite Theories

Rocha, Camilo; Meseguer, José

doi:10.1007/978-3-642-22944-2_22

Cited by 24 publications

(14 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Algorithmic techniques include Maude's finite-state LTL model checker [10], with its more recent extensions to the LTL logic of rewriting [11], and a narrowingbased symbolic model-checker for handling classes of infinite-state systems [12]. Among the deductive techniques, [13,14] propose two different approaches for reducing safety properties of rwl to equational reasoning, and then using equational reasoning tools for proving the resulting encoded properties. We note that the encoding of rwl into equational logic was proposed earlier in [15] for defining the semantics of rwl.…”

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

“…However, the work presented here is a first milestone towards the development of symbolic techniques for the analysis of synchronous set relations. In particular, the authors strongly believe that the infrastructure presented in Section 3 can be extended with rewriting and narrowing based techniques, in the style of [10], to obtain a deductive approach for verifying symbolic safety properties, such as invariance or race conditions, of synchronous set relations. Another feature that distinguishes this work from related work is the idea of priorities as an instrument to control nondeterminism of synchronous relations.…”

Section: Resultsmentioning

confidence: 99%

“…Future work in the area of deductive analysis will study symbolic reachability analysis techniques in rewriting logic for synchronous set relations. More specifically, adapting the rewriting and narrowing based techniques developed in [10], seems promising for the analysis of safety properties of synchronous set relations.…”

Section: Resultsmentioning

confidence: 99%

Simulation and Verification of Synchronous Set Relations in Rewriting Logic

Rocha

Muñoz

2011

Formal Methods, Foundations and Applications

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property verification of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure consists of an ordersorted rewrite theory in Maude, a rewriting logic system, that enables the synchronous execution of a set relation provided by the user. By using the infrastructure, existing algorithm verification techniques already available in Maude for traditional asynchronous rewriting, such as reachability analysis and model checking, are automatically available to synchronous set rewriting. The use of the infrastructure is illustrated with an executable operational semantics of a simple synchronous language and the verification of temporal properties of a synchronous system.

show abstract

“…By using techniques related to ground invariance [15], and assuming that the term algebra T Σ S /E S ,GoodSystem S is closed under the relation → R S , we prove that…”

Section: Addition Of Individual Monitors Preserves Behaviormentioning

confidence: 97%

Towards Generic Monitors for Object-Oriented Real-Time Maude Specifications

Moreno-Delgado

Durán

Meseguer

2016

Rewriting Logic and Its Applications

Self Cite

View full text Add to dashboard Cite

Abstract. Non-Functional Properties (NFPs) are crucial in the design of software. Specification of systems is used in the very first phases of the software development process for the stakeholders to make decisions on which architecture or platform to use. These specifications may be analyzed using different formalisms and techniques, simulation being one of them. During a simulation, the relevant data involved in the analysis of the NFPs of interest can be measured using monitors. In this work, we show how monitors can be parametrically specified so that the instrumentation of specifications to be monitored can be automatically performed. We prove that the original specification and the automatically obtained specification with monitors are bisimilar by construction. This means that the changes made on the original system by adding monitors do not affect its behavior. This approach allows us to have a library of possible monitors that can be safely added to analyze different properties, possibly on different objects of our systems, at will.

show abstract

Proving Safety Properties of Rewrite Theories

Cited by 24 publications

References 17 publications

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Verifying Reachability-Logic Properties on Rewriting-Logic Specifications

Simulation and Verification of Synchronous Set Relations in Rewriting Logic

Towards Generic Monitors for Object-Oriented Real-Time Maude Specifications

Contact Info

Product

Resources

About