Verifying minimum spanning tree algorithms with Stone relation algebras
type: Item
instance of: scholarly article
title: Verifying minimum spanning tree algorithms with Stone relation algebras
zbMATH Open document ID: 1401.68247
author: Walter Guttmann
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2018-11-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 03G15
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 6970283
zbMATH Keywords: formal methods
zbMATH Keywords: Kleene algebras
zbMATH Keywords: relation algebras
zbMATH Keywords: Stone algebras
zbMATH Keywords: total correctness
zbMATH Keywords: weighted graphs
describes a project that uses: Isabelle/HOL
describes a project that uses: Archive Formal Proofs
describes a project that uses: RelView
describes a project that uses: HOL
describes a project that uses: Kleene Algebra
describes a project that uses: Relation Algebra
describes a project that uses: Isabelle
describes a project that uses: Nitpick
describes a project that uses: Sledgehammer
describes a project that uses: Stone Kleene
describes a project that uses: Stone Algebras
MaRDI profile type: Publication
full work available at URL: j.jlamp.2018.09.005
OpenAlex ID: W2892302641
cites work: Q4436983
cites work: Q4091421
cites work: Axiomatizability of positive algebras of binary relations
cites work: Regular Algebra Applied to Path-finding Problems
cites work: Q4083730
cites work: Injective and projective Stone algebras
cites work: Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
cites work: Computing tournament solutions using relation algebra and RelView
cites work: Q4362882
cites work: Q4213376
cites work: Q4331824
cites work: Q5331549
cites work: C-semiring Frameworks for Minimum Spanning Tree Problems
cites work: Extending Sledgehammer with SMT Solvers
cites work: Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
cites work: Lattices and ordered algebraic structures
cites work: Representations of ordered semigroups and lattices by binary relations
cites work: Q4273425
cites work: Q5639639
cites work: Q3619797
cites work: Q4178997
cites work: Relational style laws and constructs of linear algebra
cites work: Internal axioms for domain semirings
cites work: Relational Attribute Systems II: Reasoning with Relations in Information Structures
cites work: Q3416082
cites work: Q4229232
cites work: Q3995720
cites work: Q3689227
cites work: L-fuzzy sets
cites work: Graphs, dioids and semirings. New models and algorithms.
cites work: Q5639727
cites work: Algebras for iteration and infinite computations
cites work: Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm
cites work: Stone Relation Algebras
cites work: An algebraic framework for minimum spanning tree problems
cites work: Relation algebras by games
cites work: Dijkstra, Floyd and Warshall meet Kleene
cites work: Crispness in Dedekind categories
cites work: Categorical representation theorems of fuzzy relations
cites work: Relations among Matrices over a Semiring
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: A linear algebra approach to OLAP
cites work: Relation-algebraic semantics
cites work: Relation algebras
cites work: Winskel is (almost) right: Towards a mechanized semantics textbook

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Q4823141

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Concrete Semantics

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Isabelle/HOL. A proof assistant for higher-order logic

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Q4415079

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Q4892369

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Algebraically closed distributive p-algebras

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Q4041054

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: Abstract abstract reduction

Verifying minimum spanning tree algorithms with Stone relation algebras (cites work)
cites work: A new algebraic approach to L-fuzzy relations convenient to study crispness

Verifying minimum spanning tree algorithms with Stone relation algebras (Wikidata QID)
Wikidata QID: Q128988452

Verifying minimum spanning tree algorithms with Stone relation algebras (DOI)
DOI: 10.1016/J.JLAMP.2018.09.005