107 search results - page 20 / 22 » Specifying the Correctness of Binding-Time Analysis |
184
click to vote
DAC
2005
ACM
16 years 6 months ago
2005
ACM
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
158
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
276
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
148
click to vote
POPL
2010
ACM
16 years 3 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...
163
click to vote
EMSOFT
2007
Springer
15 years 12 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...