Sciweavers

277 search results - page 23 / 56
» Precise reasoning for programs using containers
Sort
View
CACM
2010
179views more  CACM 2010»
13 years 8 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
ECOOP
2009
Springer
14 years 9 months ago
Supporting Framework Use via Automatically Extracted Concept-Implementation Templates
Abstract. Application frameworks provide reusable concepts that are instantiated in application code through potentially complex implementation steps such as subclassing, implement...
Abbas Heydarnoori, Krzysztof Czarnecki, Thiago T. ...
CAV
2007
Springer
173views Hardware» more  CAV 2007»
14 years 2 months ago
Array Abstractions from Proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Ranjit Jhala, Kenneth L. McMillan
TPHOL
2003
IEEE
14 years 2 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
SAS
1997
Springer
162views Formal Methods» more  SAS 1997»
14 years 27 days ago
Exact Flow Analysis
We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis ...
Christian Mossin