3394 search results - page 325 / 679 » A Modal Model of Memory |
165
click to vote
KBSE
2007
IEEE
16 years 1 months ago
2007
IEEE
toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device Our predicate abstraction-based tool DDVerify enables the automated ve...
158
click to vote
FORMATS
2007
Springer
16 years 28 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
164
click to vote
GLVLSI
2006
IEEE
16 years 25 days ago
2006
IEEE
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
180
click to vote
SAT
2005
Springer
16 years 7 days ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
185
Voted
DEM
2001
Springer
15 years 11 months ago
2001
Springer
With the advances in rendering hardware, it is possible to render very complex scenes in real-time. In general, computers do not have enough memory to store all the necessary infor...