Describing data flow analysis techniques with Kleene algebra

DOI10.1016/J.SCICO.2006.01.009MaRDI QIDQ870282zbMATH OpenOpenAlexWikidataFDO

Authors Therrezinha Fernandes, Jules Desharnais

Publication date 12 March 2007

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.scico.2006.01.009

zbMATH Keywords

Kleene algebra with testslabelled transition systems`gen/kill' analysesdata flow graphsmatrices over Kleene algebrastatic intraprocedural data flow analysis

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Recommendations

• Mathematics of Program Construction
• Program analysis and verification based on Kleene algebra in Isabelle/HOL
• Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
• Precise interprocedural analysis through linear algebra
• Kleene algebra with domain

Cited in

(5)

• Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
• On the expressiveness of single-pass instruction sequences
• Mathematics of Program Construction
• Generating data flow analysis algorithms from modal specifications
• Relational Methods in Computer Science

This page was built for publication: Describing data flow analysis techniques with Kleene algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870282)