Deriving Bisimulations by Simplifying Partitions

DOI10.1007/978-3-540-78163-9_16zbMath1138.68453OpenAlexW1761712807WikidataQ62046230 ScholiaQ62046230MaRDI QIDQ5452714

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Strong Preservation by Abstract Interpretation
• Abstract non-interference
• Opaque Predicates Detection by Abstract Interpretation
• Three Partition Refinement Algorithms
• Refining and compressing abstract domains
• What You Lose is What You Leak: Information Leakage in Declassification Policies
• Making abstract interpretations complete
• Tools and Algorithms for the Construction and Analysis of Systems
• Static Analysis
• A per model of secure information flow in sequential programs

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