Automated verification of relational while-programs
From MaRDI portal
Recommendations
Cited in
(13)- Solving quantifier-free first-order constraints over finite sets and binary relations
- Tool-Based Verification of a Relational Vertex Coloring Program
- Exploiting synchrony and symmetry in relational verification
- Cryptomorphic topological structures: a computational, relation-algebraic approach
- Using relation-algebraic means and tool support for investigating and computing bipartitions
- Cardinality of relations with applications
- Control of Condorcet voting: complexity and a relation-algebraic approach
- Relational characterisations of paths
- Cardinality of relations and relational approximation algorithms
- On automated program construction and verification
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers
- Automated verification of reactive and concurrent programs by calculation
This page was built for publication: Automated verification of relational while-programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410484)