22 search results - page 1 / 5 » Trace Compaction using SAT-based Reachability Analysis |
ASPDAC
2007
ACM
13 years 8 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...
CSMR
2005
IEEE
13 years 10 months ago
2005
IEEE
Software developers are constantly required to modify and adapt application features in response to changing requirements. The problem is that just by reading the source code, it ...
CIKM
2005
Springer
13 years 10 months 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...
DATE
2003
IEEE
13 years 10 months ago
2003
IEEE
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
UAI
1998
13 years 6 months ago
1998
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...