Reversibility in the higher-order \(\pi\)-calculus
From MaRDI portal
Publication:264996
DOI10.1016/j.tcs.2016.02.019zbMath1338.68078OpenAlexW2284037492MaRDI QIDQ264996
Claudio Antares Mezzina, Ivan Lanese, Jean-Bernard Stefani
Publication date: 1 April 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.019
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (28)
Reversibility in session-based concurrency: a fresh look ⋮ The reversible temporal process language ⋮ A collective interpretation semantics for reversing Petri nets ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ Towards a taxonomy for reversible computation approaches ⋮ revTPL: The Reversible Temporal Process Language ⋮ The correctness of concurrencies in (reversible) concurrent calculi ⋮ Reversible debugging of concurrent Erlang programs: supporting imperative primitives ⋮ Type theory based semantic verification for service composition in cloud computing environments ⋮ An axiomatic approach to reversible computation ⋮ Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures ⋮ Unnamed Item ⋮ A parametric framework for reversible \(\pi\)-calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Causal-consistent rollback in a tuple-based language ⋮ Forward-Reverse Observational Equivalences in CCSK ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ Static versus dynamic reversibility in CCS ⋮ Unnamed Item ⋮ A theory of reversibility for Erlang ⋮ Event structures for the reversible early internal \(\pi\)-calculus ⋮ Controlling Reversibility in Higher-Order Pi ⋮ Unnamed Item ⋮ Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications ⋮ A Petri net view of covalent bonds ⋮ Concurrencies in reversible concurrent calculi ⋮ Reversibility in Erlang: imperative constructs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for name-passing processes: Interleaving and causal
- Bisimulation for higher-order process calculi
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Reversible computing and cellular automata -- a survey
- Typed event structures and the linear \(\pi \)-calculus
- A fully abstract semantics for causality in the \(\pi\)-calculus
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Non-interleaving semantics for mobile processes
- Proving nondeterministically specified safety properties using progress measures
- Reversible, irreversible and optimal \(\lambda\)-machines
- Forward and backward simulations. I. Untimed Systems
- Forward and backward simulations. II: Timing-based systems
- A structural approach to reversible computation
- Reversing algebraic process calculi
- Reversibility and Asymmetric Conflict in Event Structures
- General Reversibility
- Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
- Towards a Reversible Functional Language
- Information effects
- The m-calculus
- Controlling Reversibility in Higher-Order Pi
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Compositional Event Structure Semantics for the Internal π-Calculus
- Reversing Higher-Order Pi
- Normal Bisimulations in Calculi with Passivation
- Irreversibility and Heat Generation in the Computing Process
- A formal approach to undo operations in programming languages
- Functions as processes
- Reverse Execution of Java Bytecode
- From λ to π; or, Rediscovering continuations
- A Compositional Semantics for the Reversible p-Calculus
- CONCUR 2004 - Concurrency Theory
- Mathematics of Program Construction
- Concurrent Flexible Reversibility
- Logical Reversibility of Computation
- Generic Forward and Backward Simulations
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Reversibility in the higher-order \(\pi\)-calculus
