Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism

DOI10.1016/j.entcs.2009.05.029zbMath1347.68274MaRDI QIDQ5179049

Mihaela Sighireanu, Tayssir Touili

Publication date: 19 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.029

zbMATH Keywords

verification; process algebra; program analysis; synchronisation; multithreaded programs with procedure calls

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q42: Grammars and rewriting systems

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Uses Software

• MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation rewriting and algorithmic verification
• A generic approach to the static analysis of concurrent programs with procedures
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Tools and Algorithms for the Construction and Analysis of Systems
• Term Rewriting and Applications
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification