Compile-time debugging of C programs working on trees

DOI10.1007/3-540-46425-5_8MaRDI QIDQ2729054zbMATH OpenFDO

Authors Jacob Elgaard, Anders Møller, Michael I. Schwartzbach

Publication date 6 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46425-5_8

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computing methodologies and applications (68U99)

Recommendations

• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• A shape graph logic and a shape system
• Automated verification of recursive programs with pointers
• Automata-based verification of programs with tree updates
• Programming Languages and Systems

Cited in

(5)

• The anatomy of vampire. Implementing bottom-up procedures with code trees
• Checking cleanness in linked lists
• scientific article; zbMATH DE number 1406253 (Why is no real title available?)
• Automatic Verification of Bossa Scheduler Properties
• Juggrnaut: using graph grammars for abstracting unbounded heap structures

Describes a project that uses

Uses Software

• MONA

This page was built for publication: Compile-time debugging of C programs working on trees

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