Pages that link to "Item:Q987974"

The following pages link to An overview of the K semantic framework (Q987974):

Displaying 40 items.

• K Prover (Q43968) (← 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)
• 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)
• Twenty years of rewriting logic (Q1931904) (← links)
• An Isabelle/HOL formalisation of the SPARC instruction set architecture and the TSO memory model (Q2031429) (← links)
• On the effectiveness of higher-order logic programming in language-oriented programming (Q2039939) (← links)
• System description: lang-n-change -- a tool for transforming languages (Q2039949) (← 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)
• \( \mathbb{K}\) and KIV: towards deductive verification for arbitrary programming languages (Q2237340) (← links)
• Dynamic structural operational semantics (Q2329443) (← links)
• Maximally Parallel Contextual String Rewriting (Q2827840) (← 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)
• A Calculus for Language Transformations (Q3297783) (← links)
• αCheck: A mechanized metatheory model checker (Q4593089) (← links)
• Abstract Contract Synthesis and Verification in the Symbolic 𝕂 Framework (Q4988925) (← links)
• A Proof Score Approach to Formal Verification of an Imperative Programming Language Compiler (Q5056076) (← links)
• (Q5111306) (← links)
• All-Path Reachability Logic (Q5170834) (← links)
• Software Model Checking for Mobile Security – Collusion Detection in $$\mathbb {K}$$K (Q5883569) (← links)
• Operational semantics of a weak memory model with channel synchronization (Q5915975) (← links)
• Operational semantics of a weak memory model with channel synchronization (Q5918263) (← links)
• Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
• The Right Kind of Non-Determinism: Using Concurrency to Verify C Programs with Underspecified Semantics (Q6122639) (← links)
• Formally verified animation for RoboChart using interaction trees (Q6151624) (← links)