loading...
Automatically Proving Concurrent Programs Correct
London, England September 10-September 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SEFM.2007.10Fifth IEEE International Conference o ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Byron Cook, "Automatically Proving Concurrent Programs Correct," Software Engineering and Formal Methods, International Conference on, pp. 269-272, Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/SEFM.2007.10,
author = {Byron Cook},
title = {Automatically Proving Concurrent Programs Correct},
journal ={Software Engineering and Formal Methods, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2884-8},
pages = {269-272},
doi = {http://doi.ieeecomputersociety.org/10.1109/SEFM.2007.10},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering and Formal Methods, International Conference on
TI - Automatically Proving Concurrent Programs Correct
SN - 0-7695-2884-8
SP269
EP272
A1 - Byron Cook,
PY - 2007
KW - null
VL - 0
JA - Software Engineering and Formal Methods, International Conference on
ER -
 
Byron Cook, Microsoft
This talk will describe new advances that allow us to automatically prove both liveness properties and heap-shape properties of concurrent programs. The talk will focus on recent thread-modular extensions to the program termination prover TERMINATOR and shape analysis tool SLAyer and their application to Windows device drivers.
Citation:
Byron Cook, "Automatically Proving Concurrent Programs Correct," sefm, pp.269-272, Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.