1511 search results - page 14 / 303 » Relational Parametricity for Computational Effects |
137
Voted
BIRTHDAY
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
130
Voted
ICCAD
2006
IEEE
16 years 17 days ago
2006
IEEE
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
120
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
117
Voted
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
145
Voted
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...