798 search results - page 58 / 160 » Proving More Properties with Bounded Model Checking |
144
click to vote
FMICS
2009
Springer
15 years 10 months ago
2009
Springer
Cell libraries often contain a simulation model in a system design language, such as Verilog. These languages usually involve nondeterminism, which in turn, poses a challenge to th...
148
click to vote
TROB
2010
14 years 11 months ago
2010
The property of form-closure of a grasp, as generally defined in the literature, is based on the assumption that contact points between the hand and the object are fixed in space. ...
140
click to vote
SAS
2010
Springer
15 years 2 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
163
click to vote
RTSS
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
151
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...