A formal library of set relations and its application to synchronous languages
From MaRDI portal
Publication:654904
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
Cites work
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1927575 (Why is no real title available?)
- scientific article; zbMATH DE number 1531624 (Why is no real title available?)
- scientific article; zbMATH DE number 1569122 (Why is no real title available?)
- A structural approach to operational semantics
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Conditional rewriting logic as a unified model of concurrency
- Defining and Executing P Systems with Structured Data in K
- Equational rules for rewriting logic
- Statecharts: a visual formalism for complex systems
- Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions
- The chemical abstract machine
- The gamma model and its discipline of programming
- The rewriting logic semantics project
Cited in
(2)
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)