On Automated Program Construction and Verification

DOI10.1007/978-3-642-13321-3_4zbMath1286.68068OpenAlexW1536773907MaRDI QIDQ3575262

Rudolf Berghammer, Georg Struth

Publication date: 26 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13321-3_4

Mathematics Subject Classification ID

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

Related Items (8)

Using relation-algebraic means and tool support for investigating and computing bipartitions ⋮ Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Second-order properties of undirected graphs ⋮ Relational characterisations of paths ⋮ Cardinality of relations and relational approximation algorithms ⋮ Cardinality of relations with applications ⋮ Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures

Uses Software

• RelView
• Prover9
• Mace4

This page was built for publication: On Automated Program Construction and Verification