On bounded reachability analysis of shared memory systems

DOI10.4230/LIPICS.FSTTCS.2014.611MaRDI QIDQ2978551zbMATH OpenFDO

Authors Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan

Publication date 25 April 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2014.611

zbMATH Keywords

counter systemspushdown systemsreachability problem

Mathematics Subject Classification ID

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

Recommendations

• Reachability analysis of communicating pushdown systems
• Reachability analysis of communicating pushdown systems
• Reachability problem for weak multi-pushdown automata
• Reachability of scope-bounded multistack pushdown systems
• On the Reachability Analysis of Acyclic Networks of Pushdown Systems

Cited in

(7)

• On grainless footprint semantics for shared-memory programs
• MSO Logic for Unambiguous Shared-Memory Systems
• Bounded context switching for valence systems
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• On the Complexity of Bounded Context Switching.
• Fine-grained complexity of safety verification
• Satisfiability of context-free string constraints with subword-ordering and transducers

This page was built for publication: On bounded reachability analysis of shared memory systems

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