Pages that link to "Item:Q5569944"
From MaRDI portal
The following pages link to An axiomatic basis for computer programming (Q5569944):
Displaying 50 items.
- Mechanical inference of invariants for FOR-loops (Q604381) (← links)
- Reflexive transitive invariant relations: A basis for computing loop functions (Q604384) (← links)
- An elementary and unified approach to program correctness (Q607408) (← links)
- Inter-process buffers in separation logic with rely-guarantee (Q613139) (← links)
- A programming model for BSP with partitioned synchronisation (Q640293) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- An extensional treatment of lazy data flow deadlock (Q671995) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- Formalizing Dijkstra's predicate transformer wp in weak second-order logic (Q673132) (← links)
- Term rewriting and Hoare logic -- Coded rewriting (Q673226) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Loop invariants in floating point algorithms (Q685861) (← links)
- Dual choice and iteration in an abstract algebra of action (Q694489) (← links)
- Lazy behavioral subtyping (Q710675) (← links)
- Frame rule for mutually recursive procedures manipulating pointers (Q732009) (← links)
- Reasoning about goal-directed real-time teleo-reactive programs (Q736794) (← links)
- Verifying traits: an incremental proof system for fine-grained reuse (Q736803) (← links)
- Constructive modal logics. I (Q750417) (← links)
- The ''Hoare logic'' of concurrent programs (Q754637) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Synthetic programming (Q761788) (← links)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- Fine-grained concurrency with separation logic (Q763473) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- Two theorems about the completeness of Hoare's logic (Q794426) (← links)
- Fair termination revisited - with delay (Q795499) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Strongest invariant functions: Their use in the systematic analysis of while statements (Q797985) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol (Q802867) (← links)
- Weakly expressive models for Hoare logic (Q805248) (← links)
- A complete axiomatic semantics of spawning (Q808281) (← links)
- jContractor: Introducing design-by-contract to Java using reflective bytecode instrumentation (Q812054) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Extending separation logic with fixpoints and postponed substitution (Q820139) (← links)
- Ghost signals: verifying termination of busy waiting (Q832247) (← links)
- Integrating Owicki-Gries for C11-style memory models into Isabelle/HOL (Q832723) (← links)
- Certifying low-level programs with hardware interrupts and preemptive threads (Q835764) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- Proof optimization for partial redundancy elimination (Q843219) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- A method for computing the number of iterations in data dependent loops (Q853604) (← links)
- Verification conditions are code (Q855274) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- An integrated approach to high integrity software verification (Q861714) (← links)
- Towards ``dynamic domains'': totally continuous cocomplete \(\mathcal Q\)-categories (Q875519) (← links)
- A compositional natural semantics and Hoare logic for low-level languages (Q877026) (← links)
- Modeling adaptive behaviors in Context UNITY (Q882451) (← links)
