Galois Connections for Flow Algebras
Publication: Research - peer-review › Article in proceedings – Annual report year: 2011
We generalise Galois connections from complete lattices to
flow algebras. Flow algebras are algebraic structures that are less restrictive
than idempotent semirings in that they replace distributivity
with monotonicity and dispense with the annihilation property; therefore
they are closer to the approach taken by Monotone Frameworks and
other classical analyses. We present a generic framework for static analysis
based on flow algebras and program graphs. Program graphs are often
used in Model Checking to model concurrent and distributed systems.
The framework allows to induce new flow algebras using Galois connections
such that correctness of the analyses is preserved. The approach is
illustrated for a mutual exclusion algorithm.
Original language | English |
---|---|
Title of host publication | Formal Techniques for Distributed Systems : Joint 13th IFIP WG 6.1 International Conference, FMOODS 2011 and 30th IFIP WG 6.1 International Conference, FORTE 2011 Reykjavik, Iceland, June 6-9, 2011 Proceedings |
Publisher | Springer |
Publication date | 2011 |
Pages | 138-152 |
ISBN (print) | 978-3-642-21460-8 |
ISBN (electronic) | 978-3-642-21461-5 |
DOIs | |
State | Published - 2011 |
Event | IFIP International Conference on Formal Methods for Open Object-based Distributed Systems & IFIP International Conference on FORmal TEchniques for Networked and Distributed Systems - Reykjavik, Iceland |
Conference
Conference | IFIP International Conference on Formal Methods for Open Object-based Distributed Systems & IFIP International Conference on FORmal TEchniques for Networked and Distributed Systems |
---|---|
Number | 13 & 31 |
City | Reykjavik, Iceland |
Period | 01/01/2011 → … |
Series | Lecture Notes in Computer Science |
---|---|
Number | 6722 |
ISSN | 0302-9743 |
Citations | Web of Science® Times Cited: No match on DOI |
---|
Download as:
ID: 5830849