859 search results - page 61 / 172 » Explaining Synthesized Software |
CISSE
2009
Springer
14 years 1 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
CSFW
2004
IEEE
14 years 1 months ago
2004
IEEE
We present a system, BLF, that combines an authorization logic based on the Binder language with a logical framework, LF, able to express semantic properties of programs. BLF is a...
EDBTW
2006
Springer
14 years 1 months ago
2006
Springer
In my thesis I will address the problem of interoperation between information spaces on the web. We explain how this problem is different to traditional database integration scenar...
GCSE
2000
Springer
14 years 1 months ago
2000
Springer
Combinations of C++ features, like inheritance, templates, and class nesting, allow for the expression of powerful component patterns. In particular, research has demonstrated that...
WSC
2007
14 years 7 days ago
2007
This paper describes the selection and automation of a method for estimating how many replications should be run to achieve a required accuracy in the output. The motivation is to...