The following pages link to K Prover (Q43968):
Displaying 45 items.
- (Q47962) (redirect page) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- Program equivalence by circular reasoning (Q493521) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- Formal methods for web security (Q511944) (← links)
- Language definitions as rewrite theories (Q730476) (← links)
- Implementing type systems for the IDE with Xsemantics (Q739624) (← links)
- P systems with control nuclei: the concept (Q987966) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
- Executable component-based semantics (Q1734523) (← links)
- Symbolic execution based on language transformation (Q1749128) (← links)
- Logical approximation for program analysis (Q1929363) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- An Isabelle/HOL formalisation of the SPARC instruction set architecture and the TSO memory model (Q2031429) (← links)
- Model checking of synchronized domain-specific multi-formalism models using high-level Petri nets (Q2117173) (← links)
- A framework for modeling the semantics of synchronous and asynchronous procedures with abstract state machines (Q2117610) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- A complete semantics of \(\mathbb{K}\) and its translation to Isabelle (Q2119971) (← links)
- A lazy desugaring system for evaluating programs with sugars (Q2163178) (← links)
- Dynamic structural operational semantics (Q2329443) (← links)
- A Theoretical Foundation for Programming Languages Aggregation (Q2787336) (← links)
- K-Java: a complete semantics of Java (Q2819831) (← links)
- Maximally Parallel Contextual String Rewriting (Q2827840) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- A rewrite framework for language definitions and for generation of efficient interpreters (Q2873785) (← links)
- A Truly Concurrent Semantics for the $\mathbb{K}$ Framework Based on Graph Transformations (Q2918990) (← links)
- Language Definitions as Rewrite Theories (Q2945132) (← links)
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications (Q2945720) (← links)
- From Rewriting Logic, to Programming Language Semantics, to Program Verification (Q2945730) (← links)
- Matching Logic: An Alternative to Hoare/Floyd Logic (Q3067473) (← links)
- The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
- Towards a Unified Theory of Operational and Axiomatic Semantics (Q3167025) (← links)
- A Rewriting Logic Approach to Type Inference (Q3184729) (← links)
- αCheck: A mechanized metatheory model checker (Q4593089) (← links)
- (Q4594004) (← links)
- Matching Logic (Q4600770) (← links)
- From Hoare Logic to Matching Logic Reachability (Q4647855) (← links)
- K-Maude: A Rewriting Based Tool for Semantics of Programming Languages (Q4933281) (← links)
- (Q5111306) (← links)
- All-Path Reachability Logic (Q5170834) (← links)
- Memory Representations in Rewriting Logic Semantics Definitions (Q5179135) (← links)
- Defining and Executing P Systems with Structured Data in K (Q5191176) (← links)
- A Rewriting Logic Semantics Approach to Modular Program Analysis (Q5389141) (← links)
- Operational semantics of a weak memory model with channel synchronization (Q5915975) (← links)
