Galois Connections for Flow Algebras

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.
Type de document :
Communication dans un congrès
Roberto Bruni; Juergen Dingel. 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. Springer, Lecture Notes in Computer Science, LNCS-6722, pp.138-152, 2011, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-21461-5_9〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01583315
Contributeur : Hal Ifip <>
Soumis le : jeudi 7 septembre 2017 - 11:10:13
Dernière modification le : lundi 11 septembre 2017 - 10:47:07

Fichier

978-3-642-21461-5_9_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Piotr Filipiuk, Michał Terepeta, Hanne Nielson, Flemming Nielson. Galois Connections for Flow Algebras. Roberto Bruni; Juergen Dingel. 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. Springer, Lecture Notes in Computer Science, LNCS-6722, pp.138-152, 2011, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-21461-5_9〉. 〈hal-01583315〉

Partager

Métriques

Consultations de la notice

24

Téléchargements de fichiers

6