15372 search results - page 2899 / 3075 » The Semantics of Semantic Annotation |
104
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
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...
109
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
125
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
102
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
113
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
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...