Deriving Bisimulations by Simplifying Partitions

DOI10.1007/978-3-540-78163-9_16MaRDI QIDQ5452714zbMATH OpenOpenAlexWikidataFDO

Authors Isabella Mastroeni

Publication date 4 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78163-9_16

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Programming Languages and Systems
• Making abstract models complete
• Making abstract interpretations complete
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Generalized Strong Preservation by Abstract Interpretation

Cites work

• A per model of secure information flow in sequential programs
• Abstract non-interference
• Generalized Strong Preservation by Abstract Interpretation
• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1834576 (Why is no real title available?)
• Making abstract interpretations complete
• Opaque Predicates Detection by Abstract Interpretation
• Refining and compressing abstract domains
• Static Analysis
• Three Partition Refinement Algorithms
• Tools and Algorithms for the Construction and Analysis of Systems
• What you lose is what you leak: information leakage in declassification policies

Cited in

(3)

• From bisimulation to simulation: Coarsest partition problems
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Deriving Bisimulation Congruences with Borrowed Contexts

This page was built for publication: Deriving Bisimulations by Simplifying Partitions

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