Bounded communication reachability analysis of process rewrite systems with ordered parallelism

DOI10.1016/J.ENTCS.2009.05.029MaRDI QIDQ5179049zbMATH OpenOpenAlexFDO

Authors 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

multithreaded programs with procedure callsprocess algebraprogram analysissynchronisationverification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Term Rewriting and Applications
• Constrained Reachability of Process Rewrite Systems
• Process rewrite systems.
• CONCUR 2004 - Concurrency Theory

Cites work

• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• A generic approach to the static analysis of concurrent programs with procedures
• Algorithmic improvements in regular model checking.
• CONCUR 2005 – Concurrency Theory
• Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 108539 (Why is no real title available?)
• scientific article; zbMATH DE number 1263840 (Why is no real title available?)
• scientific article; zbMATH DE number 1304991 (Why is no real title available?)
• scientific article; zbMATH DE number 2102701 (Why is no real title available?)
• Permutation rewriting and algorithmic verification
• Reachability analysis of synchronized PA systems
• Reachability analysis of term rewriting systems with Timbuk
• Term Rewriting and Applications
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(2)

• Constrained Reachability of Process Rewrite Systems
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Describes a project that uses

Uses Software

• MAGIC

This page was built for publication: Bounded communication reachability analysis of process rewrite systems with ordered parallelism

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