Galois Connections for Flow Algebras - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Galois Connections for Flow Algebras

(1) , (1) , (1) , (1)
1

Abstract

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.
Fichier principal
Vignette du fichier
978-3-642-21461-5_9_Chapter.pdf (371.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01583315 , version 1 (07-09-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Piotr Filipiuk, Michał Terepeta, Hanne Riis Nielson, Flemming Nielson. Galois Connections for Flow Algebras. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik,, Iceland. pp.138-152, ⟨10.1007/978-3-642-21461-5_9⟩. ⟨hal-01583315⟩
38 View
114 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More