scientific article; zbMATH DE number 3551848
From MaRDI portal
Publication:4125720
Cited in
(19)- On the fixpoints of nondeterministic recursive definitions
- Relational algebraic semantics of deterministic and nondeterministic programs
- A theory for nondeterminism, parallelism, communication, and concurrency
- CPO's of measures for nondeterminism
- Semantics of nondeterminism, concurrency, and communication
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
- Formalization of properties of nondeterministic recursive definitions
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
- A unified approach for studying the properties of transition systems
- Programs as partial graphs. I: Flow equivalence and correctness
- Functional behavior in data spaces
- Relation-algebraic semantics
- Parallel constructions of maximal path sets and applications to short superstrings
- Infinite executions of lazy and strict computations
- Lazy Relations
- Étude et implémentation d'un système de déduction pour logique algorithmique
- Formal computations of non deterministic recursive program schemes
- Logical foundations for programming semantics
- Algebras for iteration and infinite computations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125720)
