%0 Conference Proceedings
%T Galois Connections for Flow Algebras
%+ Danmarks Tekniske Universitet = Technical University of Denmark (DTU)
%A Filipiuk, Piotr
%A Terepeta, Michał
%A Nielson, Hanne, Riis
%A Nielson, Flemming
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE)
%C Reykjavik,, Iceland
%Y Roberto Bruni
%Y Juergen Dingel
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-6722
%P 138-152
%8 2011-06-06
%D 2011
%R 10.1007/978-3-642-21461-5_9
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01583315/document
%2 https://inria.hal.science/hal-01583315/file/978-3-642-21461-5_9_Chapter.pdf
%L hal-01583315
%U https://inria.hal.science/hal-01583315
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-FMOODS
%~ IFIP-LNCS-6722