Constrained Reachability of Process Rewrite Systems

DOI10.1007/978-3-642-03466-4_20MaRDI QIDQ3393418zbMATH OpenOpenAlexFDO

Authors Tayssir Touili

Publication date 20 August 2009

Published in Theoretical Aspects of Computing - ICTAC 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03466-4_20

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Term Rewriting and Applications
• Reachability analysis of synchronized PA systems
• Process rewrite systems.
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism

Cited in

(6)

• Reachability analysis of synchronized PA systems
• Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)
• Constraint-based reachability
• Bounded communication reachability analysis of process rewrite systems with ordered parallelism
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Term Rewriting and Applications

This page was built for publication: Constrained Reachability of Process Rewrite Systems

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