Tool-Based Verification of a Relational Vertex Coloring Program
From MaRDI portal
Cylindric and polyadic algebras; relation algebras (03G15) Coloring of graphs and hypergraphs (05C15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Graph theory (including graph drawing) in computer science (68R10) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Symbolic computation and algebraic computation (68W30)
Recommendations
- Formal verification of coalescing graph-coloring register allocation
- Hoare-style verification of graph programs
- Verifying parallel algorithms and programs using coloured Petri nets
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates
- scientific article; zbMATH DE number 7456057
- Automated verification of relational while-programs
Cited in
(7)- Relational characterisations of paths
- Using relation-algebraic means and tool support for investigating and computing bipartitions
- Cardinalities of Finite Relations in Coq
- Algebraic investigation of connected components
- Reasoning about cardinalities of relations with applications supported by proof assistants
- Cardinality of relations and relational approximation algorithms
- Cardinality of relations with applications
Describes a project that uses
Uses Software
This page was built for publication: Tool-Based Verification of a Relational Vertex Coloring Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460631)
