Sciweavers

1073 search results - page 80 / 215
» Formal Program Development with Approximations
Sort
View
LFP
1992
153views more  LFP 1992»
15 years 3 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
SIGSOFT
2005
ACM
16 years 3 months ago
Online testing with model programs
Online testing is a technique in which test derivation from a model program and test execution are combined into a single algorithm. We describe a practical online testing algorit...
Margus Veanes, Colin Campbell, Wolfram Schulte, Ni...
102
Voted
ESOP
2007
Springer
15 years 8 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
ICLP
2010
Springer
15 years 6 months ago
Abductive Inference in Probabilistic Logic Programs
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
Gerardo I. Simari, V. S. Subrahmanian
FSTTCS
1999
Springer
15 years 6 months ago
A Foundation for Hybrid Knowledge Bases
Abstract. Hybrid knowledge bases (HKB’s) [11] were developed to provide formal models for the mediation of data and knowledge bases [14,15]. They are based on Generalized Annotat...
James J. Lu, Neil V. Murray, Erik Rosenthal