The following pages link to (Q3141916):
Displayed 50 items.
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- Ontology population as algebraic information system processing based on multi-agent natural language text analysis algorithms (Q300340) (← links)
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Aspects preserving properties (Q436364) (← links)
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- Verification conditions for source-level imperative programs (Q465685) (← links)
- Definition of flat poset and existence theorems for recursive call (Q467805) (← links)
- Quantum computation: from a programmer's perspective (Q468591) (← links)
- On theorem prover-based testing (Q470025) (← links)
- A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL (Q541222) (← links)
- Hoare logic-based genetic programming (Q543275) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- Structural operational semantics through context-dependent behaviour (Q638568) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- On behavioural abstraction and behavioural satisfaction in higher-order logic (Q671672) (← links)
- Fixed-point operations on ccc's. I (Q672122) (← links)
- On Gabbay's temporal fixed point operator (Q673958) (← links)
- Two models of synthetic domain theory (Q678839) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- A practical decision procedure for propositional projection temporal logic with infinite models (Q744099) (← links)
- From IF to BI. A tale of dependence and separation (Q833040) (← links)
- Prime algebraicity (Q843107) (← links)
- Transfinite semantics in the form of greatest fixpoint (Q843215) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- CPO semantics of timed interactive actor networks (Q959824) (← links)
- On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion (Q963342) (← links)
- The axiomatization of override and update (Q975885) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++ (Q1015388) (← links)
- Parallelism increases iterative learning power (Q1017664) (← links)
- Operating system verification---an overview (Q1040002) (← links)
- An extensible encoding of object-oriented data models in HOL. With an application to IMP++ (Q1040775) (← links)
- Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding (Q1127524) (← links)
- Group axioms for iteration (Q1283821) (← links)
- Computational adequacy of the FIX-logic (Q1349677) (← links)
- Adequacy for a lazy functional language with recursive and polymorphic types (Q1349683) (← links)
- Equivalence of formal semantics definition methods (Q1355752) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- From regular expressions to DFA's using compressed NFA's (Q1391526) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- A general adequacy result for a linear functional language (Q1391860) (← links)
- Completeness of Park induction (Q1391869) (← links)
- An equational notion of lifting monad (Q1398461) (← links)
- Domain theory for concurrency (Q1434357) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Reasoning about graded strategy quantifiers (Q1706169) (← links)