7778 search results - page 24 / 1556 » Designing Controllers for Reachability |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
CIKM
2005
Springer
14 years 28 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
One of the several initiatives to bridge the digital divide in developing countries has been the deployment of information kiosks or knowledge centers in villages in rural parts o...
APN
2000
Springer
13 years 11 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...