scientific article; zbMATH DE number 3602653
From MaRDI portal
Publication:4168046
zbMath0387.68011MaRDI QIDQ4168046
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items (42)
Correctness of fixpoint transformations ⋮ The greatest fixed-points and rational omega-tree languages ⋮ Peirce algebras ⋮ A fixpoint theory for non-monotonic parallelism ⋮ Fixed-point extensions of first-order logic ⋮ The weakest precondition calculus: Recursion and duality ⋮ The mu-calculus and Model Checking ⋮ Relation-algebraic semantics ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Convergence of chaotic iterative least fixed point computations ⋮ A compositional dataflow semantics for Petri nets ⋮ Structural congruence for bialgebraic semantics ⋮ Programmological aspects of the fixed point method ⋮ Parallel constructions of maximal path sets and applications to short superstrings ⋮ An automata theoretic decision procedure for the propositional mu- calculus ⋮ The \(\mu\)-calculus as an assertion-language for fairness arguments ⋮ Dataflow semantics for Petri nets ⋮ A proof system for the first-order relational calculus ⋮ CPO's of measures for nondeterminism ⋮ On the total correctness of nondeterministic programs ⋮ A functional programming approach to the specification and verification of concurrent systems ⋮ A dual problem to least fixed points ⋮ Unnamed Item ⋮ Fixed point theorems and semantics: A folk tale ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ Programs as partial graphs. II: Recursion ⋮ Relation algebraic domain constructions ⋮ Unnamed Item ⋮ Extremal solutions of inequations over lattices with applications to supervisory control ⋮ On the logic of UNITY ⋮ Chain-complete posets and directed sets with applications ⋮ Completeness results for the equivalence of recursive schemas ⋮ Finiteness is mu-ineffable ⋮ On the completeness of the inductive assertion method ⋮ Categories of chain-complete posets ⋮ Dual unbounded nondeterminacy, recursion, and fixpoints ⋮ Action systems, unbounded nondeterminism, and infinite traces ⋮ On infinite computations in denotational semantics ⋮ On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics ⋮ Equivalences among logics of programs ⋮ Results on the propositional \(\mu\)-calculus ⋮ Relation-algebraic computation of fixed points with applications
This page was built for publication:
