The following pages link to (Q4124327):
Displaying 50 items.
- On methods for safe introduction of operations (Q293132) (← links)
- A versatile concept for the analysis of loops (Q444373) (← links)
- Total correctness in nonstandard logics of programs (Q580955) (← links)
- A theory, implementation and applications of human-like understanding (Q593790) (← links)
- Reflexive transitive invariant relations: A basis for computing loop functions (Q604384) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- Hume box calculus: Robust system development through software transformation (Q656858) (← links)
- Natural termination (Q673622) (← links)
- Proof methods of declarative properties of definite programs (Q685395) (← links)
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- Undecidability in matrices over Laurent polynomials. (Q705234) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- A logic covering undefinedness in program proofs (Q790610) (← links)
- All solutions of a system of recursion equations in infinite trees and other contraction theories (Q791310) (← links)
- Nondeterministic three-valued logic: isotonic and guarded truth-functions (Q792750) (← links)
- Fair termination revisited - with delay (Q795499) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Insertion languages (Q796994) (← links)
- Strongest invariant functions: Their use in the systematic analysis of while statements (Q797985) (← links)
- Closures and fairness in the semantics of programming logic (Q799098) (← links)
- The inverse semigroup of a sum-ordered semiring (Q800396) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Essence of generalized partial computation (Q808278) (← links)
- An analysis of refinement in an abortive paradigm (Q851133) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Algebraic specification of concurrent systems (Q914405) (← links)
- Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas (Q997992) (← links)
- A non-standard semantics for program slicing and dependence analysis (Q997995) (← links)
- The 4-way deterministic tiling problem is undecidable (Q1013128) (← links)
- A note on an expressiveness hierarchy for multi-exit iteration (Q1014386) (← links)
- Using computer algebra techniques for the specification, verification and synthesis of recursive programs (Q1025311) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- Extracting Lisp programs from constructive proofs: A formal theory of constructive mathematics based on Lisp (Q1050769) (← links)
- Programs as proofs: A synopsis (Q1051424) (← links)
- The lifeness property of on-the-fly garbage collector - a proof (Q1054471) (← links)
- On the fixpoints of nondeterministic recursive definitions (Q1059391) (← links)
- Acceptable functional programming systems (Q1061487) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Rewrite systems on a lattice of types (Q1064065) (← links)
- Optimal fixedpoints of logic programs (Q1069694) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- Relational algebraic semantics of deterministic and nondeterministic programs (Q1079010) (← links)
