Compositional Reasoning for Pointer Structures

DOI10.1007/11783596_10MaRDI QIDQ3618818zbMATH OpenOpenAlexFDO

Authors Yi F. Chen, Jeff W. Sanders

Publication date 2 April 2009

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

Full work available at URL https://doi.org/10.1007/11783596_10

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Pointer logic for verification of pointer programs
• Abstraction of object graphs in program verification
• scientific article; zbMATH DE number 1612488
• scientific article; zbMATH DE number 1956491
• Proving pointer programs in higher-order logic.

Cited in

(7)

• Graph transformations for object-oriented refinement
• The safety-critical Java memory model formalised
• scientific article; zbMATH DE number 4156407 (Why is no real title available?)
• Abstraction of object graphs in program verification
• Pure Pointer Programs and Tree Isomorphism
• A Theory of Pointers for the UTP
• rCOS: a refinement calculus of object systems

This page was built for publication: Compositional Reasoning for Pointer Structures

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