Paper Info
Title
Thread-modular counterexample-guided abstraction refinement
Abstract
We consider the refinement of a static analysis method called thread-modular verification. It was an open question whether such a refinement can be done automatically. We present a counterexampleguided abstraction refinement algorithm for thread-modular verification and demonstrate its potential, both theoretically and practically.
Year
DOI
Venue
2010
10.1007/978-3-642-15769-1_22
SAS
Keywords
Field
DocType
counterexampleguided abstraction refinement algorithm,open question,static analysis method,thread-modular verification,static analysis
Programming language,Refinement calculus,Computer science,Critical section,Static analysis,Theoretical computer science,Refinement,Modular design,Counterexample,High-level verification,Mutual exclusion
Conference
Volume
ISSN
ISBN
6337
0302-9743
3-642-15768-8
Citations 
PageRank 
References 
8
0.49
20
Authors
3
Name
Order
Citations
PageRank
Alexander Malkis1494.65
Andreas Podelski22760197.87
Andrey Rybalchenko3143968.53