Rewriting Strategies and Strategic Rewrite Programs
From MaRDI portal
Publication:2945718
DOI10.1007/978-3-319-23165-5_18zbMath1321.68331OpenAlexW2294815028MaRDI QIDQ2945718
Publication date: 14 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01254205/file/Revised-RewStrat.pdf
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
The Maude strategy language, A Maude environment for CafeOBJ, Unnamed Item, Labelled port graph -- a formal structure for models and computations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sequential reduction strategy
- The lambda calculus. Its syntax and semantics. Rev. ed.
- TPS: A hybrid automatic-interactive system for developing proofs
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Operational termination of conditional term rewriting systems
- Computing in systems described by equations
- Conditional rewriting logic as a unified model of concurrency
- ELAN from a rewriting logic point of view
- Automata, logics, and infinite games. A guide to current research
- A structural approach to operational semantics
- A survey of strategies in rule-based program transformation systems
- The rewriting calculus - part II
- Double-pushout graph transformation revisited
- Just-in-time
- Strong and Weak Operational Termination of Order-Sorted Rewrite Theories
- Termination of rewriting under strategies
- Termination of Rewriting with Strategy Annotations
- GrGen: A Fast SPO-Based Graph Rewriting Tool
- Constraint Based Strategies
- The Graph Programming Language GP
- Handbook of Graph Grammars and Computing by Graph Transformation
- A Strategy Language for Graph Rewriting
- The Strategy Challenge in SMT Solving
- A Port Graph Calculus for Autonomic Computing and Invariant Verification
- A Rewriting Semantics for Maude Strategies
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- Semantic Guidance for Saturation Provers
