Predicate abstraction and refinement for verifying multi-threaded programs
DOI10.1145/1926385.1926424zbMath1284.68427OpenAlexW4236040576MaRDI QIDQ5408554
Ashutosh Gupta, Andrey Rybalchenko, Corneliu Popeea
Publication date: 10 April 2014
Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1926385.1926424
safetyHorn clausesmulti-threaded programsabstraction refinementmodular reasoningproof rule(transition) predicate abstractionenvironment transitions
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items