503 search results - page 48 / 101 » Verifying Quantitative Properties Using Bound Functions |
POPL
2010
ACM
15 years 9 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
116
click to vote
TAP
2010
Springer
14 years 9 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
103
click to vote
CAV
2004
Springer
15 years 3 months ago
2004
Springer
Predicate abstraction has been proved effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatinstructed given a set of predi...
CSDA
2010
14 years 12 months ago
2010
In empirical work on multivariate financial time series, it is common to postulate a Multivariate GARCH model. We show that the popular Gaussian quasi-maximum likelihood estimator...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...