Sciweavers

580 search results - page 82 / 116
» On the Foundations of Answer Set Programming
Sort
View
ICFP
2005
ACM
16 years 6 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ECOOP
2010
Springer
15 years 10 months ago
Capabilities for Uniqueness and Borrowing
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
Philipp Haller, Martin Odersky
ESOP
2011
Springer
14 years 9 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
KBSE
2002
IEEE
15 years 11 months ago
Generating Product-Lines of Product-Families
GenVoca is a methodology and technology for generating product-lines, i.e. building variants of a program. The primitive components from which applications are constructed are ref...
Don S. Batory, Roberto E. Lopez-Herrejon, Jean-Phi...
CCS
2006
ACM
15 years 9 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...