575 search results - page 71 / 115 » Model Checking Restricted Sets of Timed Paths |
108
click to vote
FSTTCS
2008
Springer
15 years 29 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
COLT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
ECOOP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
- In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing c...
103
click to vote
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
Although the counterexample returned by a model checker can help in reproducing the symptom related to a defect, a significant amount of effort is often required for the programmer...