Sciweavers

15777 search results - page 2996 / 3156
» Engineering in Software
Sort
View
132
Voted
POPL
2010
ACM
16 years 1 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
129
Voted
POPL
2010
ACM
16 years 1 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
143
Voted
POPL
2010
ACM
16 years 1 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
173
Voted
POPL
2010
ACM
16 years 1 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
141
Voted
SOSP
2009
ACM
16 years 20 days ago
Improving application security with data flow assertions
RESIN is a new language runtime that helps prevent security vulnerabilities, by allowing programmers to specify application-level data flow assertions. RESIN provides policy obje...
Alexander Yip, Xi Wang, Nickolai Zeldovich, M. Fra...
« Prev « First page 2996 / 3156 Last » Next »