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

DOI10.1016/J.TCS.2011.01.027zbMATH Open1229.68051OpenAlexW2131622288MaRDI QIDQ654904FDOQ654904

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

Publication date: 23 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.027

Recommendations

• Simulation and verification of synchronous set relations in rewriting logic
• scientific article; zbMATH DE number 3958700
• Isabelle formalization of set theoretic structures and set comprehensions
• A relational semantics for parallelism and non-determinism in a functional setting
• scientific article; zbMATH DE number 1927575
• Full abstraction for set-based models of the symmetric interaction combinators
• scientific article; zbMATH DE number 1844576
• A programming language for the inductive sets, and applications
• Publication:3490940

zbMATH Keywords

set relationssmall-step semanticssynchronous languagesplan executionrewriting logic semantics

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites Work

• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Statecharts: a visual formalism for complex systems
• A structural approach to operational semantics
• The chemical abstract machine
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditional rewriting logic as a unified model of concurrency
• Equational rules for rewriting logic
• The rewriting logic semantics project
• The gamma model and its discipline of programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions
• Defining and Executing P Systems with Structured Data in K

Cited In (2)

• Rewriting logic semantics of a plan execution language
• Simulation and verification of synchronous set relations in rewriting logic

Uses Software

• PVS
• Maude
• LUSTRE
• Esterel

This page was built for publication: A formal library of set relations and its application to synchronous languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654904)