A relational division operator: The conjugate kernel
DOI10.1016/0304-3975(93)90074-4zbMATH Open0779.68058OpenAlexW2039689198WikidataQ57526145 ScholiaQ57526145MaRDI QIDQ2367540FDOQ2367540
Authors: Ali Jaoua, Noureddine Boudriga, Jules Desharnais, Fatma Mili, Ali Mili
Publication date: 19 January 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90074-4
Recommendations
relation algebraprogram correctnessweakest preconditionaxiomatic semanticsprogram constructionweakest prespecificationrelational division operator
Discrete mathematics in relation to computer science (68R99) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
- Relational heuristics for the design of deterministic programs
- Programs as partial graphs. I: Flow equivalence and correctness
- A relational approach to the design of deterministic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Varieties of relation algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming as a Discipline of Mathematical Nature
- The weakest prespecification
- Symmetric quotients and domain constructions
- Relations binaires, fermetures, correspondances de Galois
- Heuristics for constructing while loops
- Title not available (Why is that?)
- Regularity of relations: A measure of uniformity
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A relational division operator: The conjugate kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367540)