4940 search results - page 130 / 988 » On the Complexity of Universal Programs |
142
click to vote
ECAI
1992
Springer
15 years 8 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
136
click to vote
ECOOP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
113
click to vote
APLAS
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...
103
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
143
click to vote
ICST
2009
IEEE
15 years 11 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...