A generic approach to the static analysis of concurrent programs with procedures
From MaRDI portal
Publication:2942913
DOI10.1145/604131.604137zbMath1321.68185MaRDI QIDQ2942913
Ahmed Bouajjani, Tayssir Touili, Javier Esparza
Publication date: 11 September 2015
Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/604131.604137
verification; static analysis; abstraction; pushdown systems; Kleene algebras; concurrent programs with procedures
68Q45: Formal languages and automata
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, Interprocedural Analysis of Concurrent Programs Under a Context Bound, Program Analysis Using Weighted Pushdown Systems, Reachability Analysis of Pushdown Systems with an Upper Stack, A complete refinement procedure for regular separability of context-free languages, Bounded underapproximations, Derivation tree analysis for accelerated fixed-point computation, Compositional verification of sequential programs with procedures, Verification of well-formed communicating recursive state machines, Verifying parallel programs with dynamic communication structures, Model checking dynamic pushdown networks, Reasoning about Threads with Bounded Lock Chains, Model Checking Concurrent Programs, Invariant Checking for Programs with Procedure Calls, Solving Multiple Dataflow Queries Using WPDSs, Language Strength Reduction, Verifying Parallel Programs with Dynamic Communication Structures
Uses Software
Cites Work
