Simulation and verification of synchronous set relations in rewriting logic

Authors:
Camilo Rocha;César Muñoz
Affiliations:
University of Illinois at Urbana-Champaign;NASA Langley Research Center
Venue:
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Year:
2011

Citing 9
Cited 1

Equational rules for rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Semantic foundations for generalized rewrite theories

Theoretical Computer Science
Reduction Semantics and Formal Analysis of Orc Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions

Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Formalization and correctness of the PALS architectural pattern for distributed real-time systems

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A formal library of set relations and its application to synchronous languages

Theoretical Computer Science
A rewriting approach to concurrent programming language design and semantics

A rewriting approach to concurrent programming language design and semantics

A formal interactive verification environment for the plan execution interchange language

IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods

Quantified Score

Hi-index	0.00

Visualization

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 order-sorted 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.