On automated program construction and verification
From MaRDI portal
Publication:3575262
DOI10.1007/978-3-642-13321-3_4zbMATH Open1286.68068OpenAlexW1536773907MaRDI QIDQ3575262FDOQ3575262
Authors: 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
Recommendations
Cited In (17)
- Efficient verification of imperative programs using auto2
- Simple rectangle-based functional programs for computing reflexive-transitive closures
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- An integrated approach to high integrity software verification
- Using relation-algebraic means and tool support for investigating and computing bipartitions
- Program semantics and verification technique for AI-centred programs
- Cardinality of relations with applications
- Theoretical Aspects of Computing - ICTAC 2004
- Cardinality of relations and relational approximation algorithms
- Relation-algebraic verification of disjoint-set forests
- Relational characterisations of paths
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Automated verification of relational while-programs
- Second-order properties of undirected graphs
- Title not available (Why is that?)
Uses Software
This page was built for publication: On automated program construction and verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575262)
