Hopscotch -- reaching the target hop by hop
From MaRDI portal
Publication:406451
DOI10.1016/j.jlap.2014.02.009zbMath1371.68210OpenAlexW2137815065MaRDI QIDQ406451
Annabelle McIver, Peter Höfner
Publication date: 8 September 2014
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2014.02.009
Graph theory (including graph drawing) in computer science (68R10) Cylindric and polyadic algebras; relation algebras (03G15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kleene modules and linear languages
- Relation algebras
- Relational measures and integration in preference modeling
- Relation algebras: Concept of points and representability
- A completeness theorem for Kleene algebras and the algebra of regular events
- Graph-theoretic concepts in computer science. 20th International Workshop. WG '94, Herrsching, Germany, June 16-18, 1994. Proceedings
- Towards a refinement algebra
- Dijkstra, Floyd and Warshall meet Kleene
- An Algebraic Calculus of Database Preferences
- Unifying Lazy and Strict Computations
- Relational Concepts in Social Choice
- Algebraic Notions of Termination
- Towards an Algebra of Routing Tables
- On Automating the Calculus of Relations
- Regular Algebra Applied to Path-finding Problems
- Kleene algebra with domain
- NetKAT
- On the Cardinality of Relations
- On Hoare logic and Kleene algebra with tests
- Matrix development of the calculus of relations
- Relational Methods in Computer Science
This page was built for publication: Hopscotch -- reaching the target hop by hop
