Relational heuristics for the design of deterministic programs

DOI10.1007/BF00265990zbMath0595.68018MaRDI QIDQ1077919

Jules Desharnais, Fatma Mili, Ali Milli

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

heuristic solutionsdeterministic programsrelational calculirelational equations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (12)

Relation-based semantics for concurrency ⋮ Finite representability of semigroups with demonic refinement ⋮ A relational division operator: The conjugate kernel ⋮ Nondeterministic Fuzzy Operators ⋮ Regularity of relations: A measure of uniformity ⋮ Reflexive transitive invariant relations: A basis for computing loop functions ⋮ Combining relational calculus and the Dijkstra-Gries method for deriving relational programs ⋮ Embedding a demonic semilattice in a relation algebra ⋮ On the lattice of specifications: Applications to a specification methodology ⋮ A sweep-plane algorithm for generating random tuples in simple polytopes ⋮ Nondeterministic semantics of compound diagrams ⋮ Kleene under a modal demonic star

This page was built for publication: Relational heuristics for the design of deterministic programs