Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

DOI10.1007/978-3-642-02658-4_36MaRDI QIDQ3636878zbMATH OpenOpenAlexFDO

Authors Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato

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)

Recommendations

• Reducing concurrent analysis under a context bound to sequential analysis
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
• Compositionality Entails Sequentializability
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Reducing extension edges of concurrent programs for reachability analysis

Cited in

(15)

• Context-bounded analysis of TSO systems
• Bounded context switching for valence systems
• Reachability of scope-bounded multistack pushdown systems
• Reducing extension edges of concurrent programs for reachability analysis
• The decidability of verification under PS 2.0
• Sequentialization using timestamps
• CCA-secure keyed-fully homomorphic encryption
• Compositionality Entails Sequentializability
• Budget-bounded model-checking pushdown systems
• Leafy automata for higher-order concurrency
• Reducing concurrent analysis under a context bound to sequential analysis
• Data multi-pushdown automata
• On the Complexity of Bounded Context Switching.
• Reachability of multistack pushdown systems with scope-bounded matching relations
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis

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

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