Relational heuristics for the design of deterministic programs
From MaRDI portal
(Redirected from Publication:1077919)
It has been shown that the design of deterministic programs can be formulated as the resolution of relational equations. Because relational calculi are not sufficently structured, there are no algorithmic solutions to relational equations. In this paper, we formulate some heuristic solutions to these equations.
Recommendations
- A RELATIONAL MODEL OF DEMONIC NONDETERMINISTIC PROGRAMS
- scientific article; zbMATH DE number 2063843
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- scientific article; zbMATH DE number 177458
- Relational algebraic semantics of deterministic and nondeterministic programs
Cited in
(13)- On the lattice of specifications: Applications to a specification methodology
- Relation-based semantics for concurrency
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
- Heuristic search for invariants for one class of programs. 6
- A relational division operator: The conjugate kernel
- Nondeterministic semantics of compound diagrams
- Regularity of relations: A measure of uniformity
- Nondeterministic Fuzzy Operators
- A sweep-plane algorithm for generating random tuples in simple polytopes
- Reflexive transitive invariant relations: A basis for computing loop functions
- Embedding a demonic semilattice in a relation algebra
- Kleene under a modal demonic star
- Finite representability of semigroups with demonic refinement
This page was built for publication: Relational heuristics for the design of deterministic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077919)
