scientific article; zbMATH DE number 3349291

Cited in

(66)

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
Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
Recursion induction principle revisited
Sulla computazione di funzioni ricorsive
Inductive \(^{*}\)-semirings
Equational theories for automata
Generating functions for probabilistic programs
Non-terminating processes in the situation calculus
The fixed-point theory of strictly causal functions
Mathematical theory of partial correctness
Precondition inference from intermittent assertions and application to contracts on collections
Kleene theorem in partial Conway theories with applications
A formal theory of justifications
Infinite trees in normal form and recursive equations having a unique solution
Formal computations of non deterministic recursive program schemes
scientific article; zbMATH DE number 3567992 (Why is no real title available?)
scientific article; zbMATH DE number 3576674 (Why is no real title available?)
A Fully Equational Proof of Parikh's Theorem
On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
Local validity for circular proofs in linear logic with fixed points
scientific article; zbMATH DE number 7559486 (Why is no real title available?)
Meanings of model checking
Optimal coin flipping
Probabilistic program verification via inductive synthesis of inductive invariants
Language inclusion algorithms as complete abstract interpretations
Modal and temporal logics for processes
Inference of ranking functions for proving temporal properties by abstract interpretation
Proof methods of declarative properties of definite programs
Logical foundations for programming semantics
Computing expected visiting times and stationary distributions in Markov chains: fast and accurate
A Curry-Howard correspondence for linear, reversible computation
Data-driven invariant learning for probabilistic programs
Strong induction is an up-to technique
On the design of program logics
Results on the propositional \(\mu\)-calculus
Latticed \(k\)-induction with an application to probabilistic programs
Axiomatizing the equational theory of regular tree languages
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 -algebras

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 Q5624635)