Rewriting Systems with Data

DOI10.1007/978-3-540-74240-1_1MaRDI QIDQ5444944zbMATH OpenOpenAlexFDO

Authors Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu

Publication date 26 February 2008

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74240-1_1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Rewriting systems over nested data words
• Process rewrite systems.
• Computer Science Logic
• On Bifix Systems and Generalizations
• scientific article; zbMATH DE number 1231599

Cited in

(16)

• An automata-theoretic approach to model-checking systems and specifications over infinite data domains
• Rewriting systems over nested data words
• A Logic-Based Framework for Reasoning about Composite Data Structures
• On Bifix Systems and Generalizations
• Towards SMT Model Checking of Array-Based Systems
• Algorithmic Analysis of Array-Accessing Programs
• Computing with rewrite systems
• Forward and backward application of symbolic tree transducers
• Exploiting step semantics for efficient bounded model checking of asynchronous systems
• Object-oriented data as prefix rewriting systems
• Light-weight SMT-based model checking
• scientific article; zbMATH DE number 5172485 (Why is no real title available?)
• Register-bounded synthesis
• Church synthesis on register automata over linearly ordered data domains
• Variable automata over infinite alphabets
• Church synthesis on register automata over linearly ordered data domains

This page was built for publication: Rewriting Systems with Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444944)