An exercise in program synthesis: algorithms for computing the transitive closure of a relation

DOI10.1016/0167-6423(82)90017-XzbMath0479.68038OpenAlexW2010459536MaRDI QIDQ1162146

Lothar Schmitz

Publication date: 1982

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(82)90017-x

zbMATH Keywords

unfoldingfoldingrecursion equationssynthesis of transitive closure algorithms

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Other classical set theory (including functions, relations, and set algebra) (03E20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Related Items (1)

On synthesis of scheduling algorithms

This page was built for publication: An exercise in program synthesis: algorithms for computing the transitive closure of a relation