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

Camilo Rocha, César Muñoz, Gilles Dowek

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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.

Original languageEnglish
Pages (from-to)4853-4866
Number of pages14
JournalTheoretical Computer Science
Volume412
Issue number37
DOIs
StatePublished - 26 Aug 2011
Externally publishedYes

Keywords

  • Plan execution
  • Rewriting logic semantics
  • Set relations
  • Small-step semantics
  • Synchronous languages

Fingerprint

Dive into the research topics of 'A formal library of set relations and its application to synchronous languages'. Together they form a unique fingerprint.

Cite this