Compactly representing first-order structures for static analysis

DOI10.1007/3-540-45789-5_16MaRDI QIDQ4411959zbMATH OpenFDO

Authors Roman Manevich, G. Ramalingam, John Field, Deepak Goyal, Mooly Sagiv

Publication date 13 July 2003

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/2477/24770196.htm

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• TVLA: A system for implementing static analyses
• Programming Languages and Systems
• Logical characterizations of heap abstractions
• Static prediction of heap space usage for first-order functional programs
• Partially disjunctive heap abstraction

Cited in

(4)

• Hash consed points-to sets
• Lightweight shape analysis based on physical types
• TVLA: A system for implementing static analyses
• A representation for bit section based analysis and optimization

Describes a project that uses

Uses Software

• PAG

This page was built for publication: Compactly representing first-order structures for static analysis

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