The following pages link to KIV (Q22029):
Displayed 48 items.
- Proving linearizability with temporal logic (Q539223) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- Predicate abstraction in a program logic calculus (Q549686) (← links)
- ASM refinement and generalizations of forward simulation in data refinement: a comparison (Q555790) (← links)
- Automated flaw detection in algebraic specifications (Q616853) (← links)
- Relational concurrent refinement. II: Internal operations and outputs (Q1019018) (← links)
- Mechanized proofs of opacity: a comparison of two techniques (Q1673658) (← links)
- \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages (Q2237340) (← links)
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← links)
- Compositional reasoning using intervals and time reversal (Q2251129) (← links)
- Atomic actions, and their refinements to isolated protocols (Q2268472) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Refinement and retrenchment for programming language data types (Q2432217) (← links)
- A program logic for resources (Q2463560) (← links)
- (Q2701734) (← links)
- (Q2702600) (← links)
- (Q2709209) (← links)
- (Q2709812) (← links)
- (Q2757838) (← links)
- A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time (Q2904627) (← links)
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743) (← links)
- Specifying Imperative ML-Like Programs Using Dynamic Logic (Q3067541) (← links)
- Formal Verification of a Lock-Free Stack with Hazard Pointers (Q3105753) (← links)
- Verifying Concurrent Systems with Symbolic Execution (Q3146300) (← links)
- Towards Interactive Verification of Programmable Logic Controllers Using Modal Kleene Algebra and KIV (Q3460629) (← links)
- (Q3539946) (← links)
- Automating Algebraic Specifications of Non-freely Generated Data Types (Q3540070) (← links)
- A Compiled Implementation of Normalization by Evaluation (Q3543648) (← links)
- Interactive verification of concurrent systems using symbolic execution (Q3568235) (← links)
- Temporal Logic Verification of Lock-Freedom (Q3575281) (← links)
- Abstract Interpretation of Symbolic Execution with Explicit State Updates (Q3638994) (← links)
- (Q3805959) (← links)
- (Q4411865) (← links)
- (Q4435460) (← links)
- (Q4524768) (← links)
- (Q4858951) (← links)
- One Logic to Use Them All (Q4928425) (← links)
- (Q4934522) (← links)
- Verification of Concurrent Systems with VerCors (Q5175776) (← links)
- Formal Fault Tree Analysis - Practical Experiences (Q5178999) (← links)
- Verifying Opacity of a Transactional Mutex Lock (Q5206950) (← links)
- Plagiator — A learning prover (Q5234707) (← links)
- Automated Reasoning (Q5307058) (← links)
- Algebraic Methodology and Software Technology (Q5313002) (← links)
- Completeness of ASM Refinement (Q5403462) (← links)
- Bounded Relational Analysis of Free Data Types (Q5458813) (← links)
- Verification of Java Programs with Generics (Q5505432) (← links)
- MUNCH - Automated Reasoner for Sets and Multisets (Q5747757) (← links)