691 search results - page 51 / 139 » Automatically Proving Linearizability |
ENTCS
2000
13 years 9 months ago
2000
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
IPL
2010
13 years 7 months ago
2010
cally Refining Abstract Interpretations Bhargav S. Gulavani1 , Supratik Chakraborty1 , Aditya V. Nori2 , and Sriram K. Rajamani2 1 IIT Bombay 2 Microsoft Research India Abstract. A...
CADE
2004
Springer
14 years 10 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
CADE
2003
Springer
14 years 10 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
ICSE
2003
IEEE-ACM
14 years 10 months ago
2003
IEEE-ACM
An information retrieval technique, latent semantic indexing, is used to automatically identify traceability links from system documentation to program source code. The results of...