Galois Connections for Flow Algebras

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

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 languageEnglish
Title of host publicationFormal 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
PublisherSpringer
Publication date2011
Pages138-152
ISBN (print)978-3-642-21460-8
ISBN (electronic)978-3-642-21461-5
DOIs
StatePublished

Conference

ConferenceIFIP International Conference on Formal Methods for Open Object-based Distributed Systems & IFIP International Conference on FORmal TEchniques for Networked and Distributed Systems
Number13 & 31
CityReykjavik, Iceland
Period01/01/11 → …
NameLecture Notes in Computer Science
Number6722
ISSN (Print)0302-9743
CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5830849