The following pages link to (Q5624635):
Displaying 50 items.
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- Proof methods of declarative properties of definite programs (Q685395) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Axiomatizing the equational theory of regular tree languages (Q844887) (← links)
- A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
- A declarative semantics of flat guarded Horn clauses for programs with perpetual processes (Q915481) (← links)
- Completions of \(\mu \)-algebras (Q925850) (← links)
- An approach to automating the verification of compact parallel coordination programs. I (Q1056221) (← links)
- Fixed-point extensions of first-order logic (Q1090327) (← links)
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs (Q1136494) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- A unified approach for studying the properties of transition systems (Q1161289) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Co-induction in relational semantics (Q1177158) (← links)
- SEMANOL (73), a metalanguage for programming the semantics of programming languages (Q1219158) (← links)
- Least fixed points revisited (Q1234588) (← links)
- Formal derivation of strongly correct concurrent programs (Q1251066) (← links)
- Program invariants as fixedpoints (Q1254848) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Group axioms for iteration (Q1283821) (← links)
- A co-induction principle for recursively defined domains (Q1318702) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Relation-algebraic semantics (Q1350513) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Completeness of Park induction (Q1391869) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- On temporal logic versus Datalog (Q1401358) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Algebraic specification of reactive systems (Q1575270) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- Sulla computazione di funzioni ricorsive (Q1844080) (← links)
- Inductive \(^{*}\)-semirings (Q1882911) (← links)
- Equational theories for automata (Q2074221) (← links)
- Generating functions for probabilistic programs (Q2119118) (← links)
- Non-terminating processes in the situation calculus (Q2188782) (← links)
- The fixed-point theory of strictly causal functions (Q2257306) (← links)
- Mathematical theory of partial correctness (Q2545842) (← links)
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections (Q3075478) (← links)
- Kleene Theorem in Partial Conway Theories with Applications (Q3098034) (← links)
- A Formal Theory of Justifications (Q3449209) (← links)
- Infinite trees in normal form and recursive equations having a unique solution (Q3851585) (← links)
- Formal computations of non deterministic recursive program schemes (Q3883492) (← links)
