The following pages link to JavaFAN (Q14483):
Displaying 28 items.
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. (Q997833) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
- Fast machine words in Isabelle/HOL (Q1791180) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude (Q1951606) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- The rewriting logic semantics project (Q2852094) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- Partial order reduction for rewriting semantics of programming languages (Q2873775) (← links)
- José Meseguer: Scientist and Friend Extraordinaire (Q2945698) (← links)
- Animating the Formalised Semantics of a Java-Like Language (Q3088008) (← links)
- The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- The tccp Interpreter (Q5170191) (← links)
- Memory Representations in Rewriting Logic Semantics Definitions (Q5179135) (← links)
- One-Path Reachability Logic (Q5271073) (← links)
- Automated Reasoning (Q5307047) (← links)
- Algebraic Methodology and Software Technology (Q5312993) (← links)
- Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics (Q5387854) (← links)
- A trusted mechanised JavaScript specification (Q5408408) (← links)
- Rewriting Approximations for Fast Prototyping of Static Analyzers (Q5432332) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)
- Memory Policy Analysis for Semantics Specifications in Maude (Q5743600) (← links)
