scientific article; zbMATH DE number 3349291
From MaRDI portal
zbMath0219.68007MaRDI QIDQ5624635
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Stratified least fixpoint logic, Inductive \(^{*}\)-semirings, Latticed \(k\)-induction with an application to probabilistic programs, Fixed-point extensions of first-order logic, A Formal Theory of Justifications, Axiomatizing the equational theory of regular tree languages, Relation-algebraic semantics, Unnamed Item, Unnamed Item, Parallel constructions of maximal path sets and applications to short superstrings, Fixed point characterization of infinite behavior of finite-state systems, The equational logic of fixed points, Completeness of Park induction, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Non-terminating processes in the situation calculus, Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic, On the equational definition of the least prefixed point., On temporal logic versus Datalog, Varieties of chain-complete algebras, A functional programming approach to the specification and verification of concurrent systems, A unified approach for studying the properties of transition systems, A declarative semantics of flat guarded Horn clauses for programs with perpetual processes, Mathematical modal logic: A view of its evolution, Programs as partial graphs. I: Flow equivalence and correctness, Completions of \(\mu \)-algebras, Co-induction in relational semantics, Inference of ranking functions for proving temporal properties by abstract interpretation, Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics, Proof methods of declarative properties of definite programs, Logical foundations for programming semantics, Optimal Coin Flipping, The fixed-point theory of strictly causal functions, Infinite trees in normal form and recursive equations having a unique solution, SEMANOL (73), a metalanguage for programming the semantics of programming languages, Unnamed Item, Meanings of Model Checking, Unnamed Item, Least fixed points revisited, Formal derivation of strongly correct concurrent programs, Formal computations of non deterministic recursive program schemes, Program invariants as fixedpoints, Precondition Inference from Intermittent Assertions and Application to Contracts on Collections, Kleene Theorem in Partial Conway Theories with Applications, Mathematical theory of partial correctness, Reasoning about nondeterministic and concurrent actions: A process algebra approach, Group axioms for iteration, Equational theories for automata, Algebraic specification of reactive systems, Swinging types=functions+relations+transition systems, Recursion induction principle revisited, Sulla computazione di funzioni ricorsive, An approach to automating the verification of compact parallel coordination programs. I, On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics, Results on the propositional \(\mu\)-calculus, A co-induction principle for recursively defined domains, Constructive design of a hierarchy of semantics of a transition system by abstract interpretation, A Fully Equational Proof of Parikh's Theorem, Generating functions for probabilistic programs
