Interprocedural Analysis of Concurrent Programs Under a Context Bound

DOI10.1007/978-3-540-78800-3_20zbMath1134.68349OpenAlexW1545371423MaRDI QIDQ5458333

Nicholas Kidd, Akash Lal, Tayssir Touili, Thomas W. Reps

Publication date: 11 April 2008

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_20

Mathematics Subject Classification ID

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

Related Items (15)

Realizability of concurrent recursive programs ⋮ A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ Summarization for termination: No return! ⋮ Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis ⋮ Reachability of scope-bounded multistack pushdown systems ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete ⋮ Context-Bounded Analysis of TSO Systems ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads ⋮ Interprocedural Analysis of Concurrent Programs Under a Context Bound ⋮ Program Analysis Using Weighted Pushdown Systems ⋮ Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations ⋮ Reasoning about Threads with Bounded Lock Chains ⋮ Reducing concurrent analysis under a context bound to sequential analysis

Uses Software

• Bebop
• MAGIC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the regular structure of prefix rewriting
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Weighted pushdown systems and their application to interprocedural dataflow analysis
• A generic approach to the static analysis of concurrent programs with procedures
• On the analysis of interacting pushdown systems
• Precise interprocedural analysis through linear algebra
• Abstract Error Projection
• Precise interprocedural dataflow analysis with applications to constant propagation
• Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Tools and Algorithms for the Construction and Analysis of Systems
• CONCUR 2005 – Concurrency Theory
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Reachability analysis of pushdown automata: Application to model-checking

This page was built for publication: Interprocedural Analysis of Concurrent Programs Under a Context Bound