Sciweavers

198 search results - page 37 / 40
» Lightweight reasoning about program correctness
Sort
View
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
14 years 1 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
PLDI
2011
ACM
12 years 10 months ago
Understanding POWER multiprocessors
Exploiting today’s multiprocessors requires highperformance and correct concurrent systems code (optimising compilers, language runtimes, OS kernels, etc.), which in turn requir...
Susmit Sarkar, Peter Sewell, Jade Alglave, Luc Mar...
ECOOP
2009
Springer
14 years 8 months ago
Failboxes: Provably Safe Exception Handling
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
Bart Jacobs 0002, Frank Piessens
ISSTA
2004
ACM
14 years 27 days ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer
CD
2005
Springer
14 years 1 months ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper