Sciweavers

632 search results - page 108 / 127
» Combining programming with theorem proving
Sort
View
CAV
2012
Springer
198views Hardware» more  CAV 2012»
11 years 10 months ago
Termination Analysis with Algorithmic Learning
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 8 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
ENTCS
2007
153views more  ENTCS 2007»
13 years 7 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
MA
2010
Springer
172views Communications» more  MA 2010»
13 years 6 months ago
On Monte Carlo methods for Bayesian multivariate regression models with heavy-tailed errors
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a distribution that is a scale mixture of normals. Such models are used to analy...
Vivekananda Roy, James P. Hobert
DLS
2008
149views Languages» more  DLS 2008»
13 years 9 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani