Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

DOI10.1007/978-3-642-02658-4_36zbMath1242.68057OpenAlexW2143502475MaRDI QIDQ3636878

P. Madhusudan, Gennaro Parlato, Salvatore La Torre

Publication date: 30 June 2009

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/272456/1/fulltext.pdf

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (11)

Reachability of scope-bounded multistack pushdown systems ⋮ Sequentialization Using Timestamps ⋮ Budget-bounded model-checking pushdown systems ⋮ Compositionality Entails Sequentializability ⋮ Leafy automata for higher-order concurrency ⋮ The decidability of verification under PS 2.0 ⋮ Bounded Context Switching for Valence Systems ⋮ Context-Bounded Analysis of TSO Systems ⋮ CCA-Secure Keyed-Fully Homomorphic Encryption ⋮ Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations ⋮ Data Multi-Pushdown Automata

This page was built for publication: Reducing Context-Bounded Concurrent Reachability to Sequential Reachability