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. © 2011 IFIP International Federation for Information Processing.
CITATION STYLE
Filipiuk, P., Terepeta, M., Nielson, H. R., & Nielson, F. (2011). Galois connections for flow algebras. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6722 LNCS, pp. 138–152). https://doi.org/10.1007/978-3-642-21461-5_9
Mendeley helps you to discover research relevant for your work.