Branching bisimulation semantics enables noninterference analysis of reversible systems

DOI10.1007/978-3-031-35355-0_5zbMATHMaRDI QIDQ6535463FDO

Authors Andrea Esposito, Alessandro Aldini, Marco Bernardo

Publication date 11 January 2024

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Decidability and proof systems for language-based noninterference relations
• Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols
• Fine-grained and coarse-grained reactive noninterference
• Trustworthy Global Computing

Cites work

• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177845 (Why is no real title available?)
• scientific article; zbMATH DE number 2086504 (Why is no real title available?)
• scientific article; zbMATH DE number 1884409 (Why is no real title available?)
• A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
• A Theory of Communicating Sequential Processes
• A process algebraic approach to software architecture design
• An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
• Analysis of security protocols as open systems
• Branching time and abstraction in bisimulation semantics
• CONCUR 2004 - Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• Cauder: a causal-consistent reversible debugger for Erlang
• Checkpoint/rollback vs causally-consistent reversibility
• Classification of security properties in a Linda-like process algebra
• Communicating transactions (extended abstract)
• Concurrent flexible reversibility
• Formal verification of parallel programs
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Persistent stochastic non-interference
• Reverse code generation for parallel discrete event simulation
• Reversing algebraic process calculi
• Reversing steps in membrane systems computations
• Up-to techniques for branching bisimilarity

This page was built for publication: Branching bisimulation semantics enables noninterference analysis of reversible systems

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