A formal library of set relations and its application to synchronous languages

Authors:
Camilo Rocha;César Muñoz;Gilles Dowek
Affiliations:
Department of Computer Science, University of Illinois, Urbana, IL 61801, USA;NASA Langley Research Center, MS. 130, Hampton, VA 23681, USA;École Polytechnique and INRIA, LIX, École Polytechnique, 91128 Palaiseau Cedex, France
Venue:
Theoretical Computer Science
Year:
2011

Citing 21
Cited 2

Statecharts: A visual formalism for complex systems

Science of Computer Programming
LUSTRE: a declarative language for real-time programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The gamma model and its discipline of programming

Science of Computer Programming
Rewrite systems

Handbook of theoretical computer science (vol. B)
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
The chemical abstract machine

Selected papers of the Second Workshop on Concurrency and compositionality
Term rewriting and all that

Term rewriting and all that
The foundations of Esterel

Proof, language, and interaction
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP

Ninth International Conference on Information and Knowledge Management
Rewriting logic and Maude (invited speaker): a wide-spectrum semantic framework for object-based distributed systems

Fourth International Conference on Formal methods for open object-based distributed systems IV
Equational rules for rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
Axiomatizing an Algebra of Step Reactions for Synchronous Languages

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositional Semantics of ESTEREL and Verification by Compositional Reductions

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Synchronous models of language

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
A deterministic logical semantics for pure Esterel

ACM Transactions on Programming Languages and Systems (TOPLAS)
The rewriting logic semantics project

Theoretical Computer Science
Testing Model-Processing Tools for Embedded Systems

RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Specifying Software Requirements for Complex Systems: New Techniques and Their Application

IEEE Transactions on Software Engineering
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)

Simulation and verification of synchronous set relations in rewriting logic

SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
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	5.23

Visualization

Abstract

Set relations are particularly suitable for specifying the small-step operational semantics of synchronous languages. In this paper, a formal library of set relations for the definition, verification of properties, and execution of binary set relations is presented. The formal library consists of a set of theories written in the Prototype Verification System (PVS) that contains definitions and proofs of properties, such as determinism and compositionality, for synchronous relations. The paper also proposes a serialization procedure that enables the simulation of synchronous set relations via set rewriting systems. The library and the serialization procedure are illustrated with the rewriting logic semantics of the Plan Execution Interchange Language (PLEXIL), a rich synchronous plan execution language developed by NASA to support autonomous spacecraft operations.