Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
From MaRDI portal
Publication:3224694
DOI10.2168/LMCS-7(4:4)2011zbMath1237.68056OpenAlexW2044772623MaRDI QIDQ3224694
Ahmed Bouajjani, Mohamed Faouzi Atig, Shaz Qadeer
Publication date: 2 April 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-7(4:4)2011
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Parameterized Verification of Communicating Automata under Context Bounds, Reachability in pushdown register automata, A theory of formal synthesis via inductive learning, Are bundles good deals for first-order modal logic?, Existential Definability over the Subword Ordering, Small vertex cover makes Petri net coverability and boundedness easier, Decidable models of integer-manipulating programs with recursive parallelism, Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads, Unnamed Item, On the Complexity of Bounded Context Switching., Verification of Asynchronous Programs with Nested Locks
Uses Software
