Sciweavers

12 search results - page 3 / 3
» nfm 2011
Sort
View
NFM
2011
252views Formal Methods» more  NFM 2011»
13 years 4 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
NFM
2011
223views Formal Methods» more  NFM 2011»
13 years 4 months ago
Generating Data Race Witnesses by an SMT-Based Analysis
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakal...