3820 search results - page 31 / 764 » Bounded Model Debugging |
ASP
2001
Springer
14 years 6 days ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
JSYML
2007
13 years 7 months ago
2007
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follo...
FORMATS
2004
Springer
14 years 1 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...