A modular, extensible proof method for small-step flow analyses

DOI10.1007/3-540-45927-8_16MaRDI QIDQ4738358zbMATH OpenFDO

Authors Mitchell Wand, Galen B. Williamson

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2305/23050213.htm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Exact flow analysis
• Exact flow analysis by higher-order model checking
• Design and correctness of program transformations based on control-flow analysis
• Simple relational correctness proofs for static analyses and program transformations
• Flow Analysis, Linearity, and PTIME

Cited in

(1)

• Selectors make set-based analysis too hard

Describes a project that uses

Uses Software

• ESC/Java
• TVLA
• MOCHA

This page was built for publication: A modular, extensible proof method for small-step flow analyses

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