Publication:5624635
From MaRDI portal
zbMath0219.68007MaRDI QIDQ5624635
Publication date: 1969
68N01: General topics in the theory of software
Related Items
A Fully Equational Proof of Parikh's Theorem, Proof methods of declarative properties of definite programs, Logical foundations for programming semantics, Results on the propositional \(\mu\)-calculus, A functional programming approach to the specification and verification of concurrent systems, A declarative semantics of flat guarded Horn clauses for programs with perpetual processes, Completions of \(\mu \)-algebras, An approach to automating the verification of compact parallel coordination programs. I, Fixed-point extensions of first-order logic, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic, Varieties of chain-complete algebras, A unified approach for studying the properties of transition systems, Programs as partial graphs. I: Flow equivalence and correctness, Co-induction in relational semantics, SEMANOL (73), a metalanguage for programming the semantics of programming languages, Least fixed points revisited, Formal derivation of strongly correct concurrent programs, Program invariants as fixedpoints, Reasoning about nondeterministic and concurrent actions: A process algebra approach, Group axioms for iteration, A co-induction principle for recursively defined domains, Stratified least fixpoint logic, Relation-algebraic semantics, 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, On the equational definition of the least prefixed point., On temporal logic versus Datalog, Mathematical modal logic: A view of its evolution, Algebraic specification of reactive systems, Swinging types=functions+relations+transition systems, Constructive design of a hierarchy of semantics of a transition system by abstract interpretation, Recursion induction principle revisited, Sulla computazione di funzioni ricorsive, Inductive \(^{*}\)-semirings, Mathematical theory of partial correctness, Infinite trees in normal form and recursive equations having a unique solution, Formal computations of non deterministic recursive program schemes, Unnamed Item, Unnamed Item
