Weakest Preconditions for High-Level Programs

DOI10.1007/11841883_31zbMath1156.68347OpenAlexW2171877225MaRDI QIDQ3541980

Arend Rensink, Karl-Heinz Pennemann, Annegret Habel

Publication date: 27 November 2008

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

Full work available at URL: https://doi.org/10.1007/11841883_31

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

Theorem proving graph grammars with attributes and negative application conditions ⋮ Interactive and automated proofs for graph transformations ⋮ Unnamed Item ⋮ High-Level Programs and Program Conditions ⋮ Resolution-Like Theorem Proving for High-Level Conditions ⋮ Development of Correct Graph Transformation Systems ⋮ An Algorithm for Approximating the Satisfiability Problem of High-level Conditions ⋮ -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation ⋮ Application of Graph Transformation in Verification of Dynamic Systems ⋮ Reasoning formally about database queries and updates ⋮ Correctness of high-level transformation systems relative to nested conditions ⋮ Monadic second-order incorrectness logic for GP 2 ⋮ Incorrectness logic for graph programs

Uses Software

• Unnamed Item

This page was built for publication: Weakest Preconditions for High-Level Programs