Sciweavers

33 search results - page 7 / 7
» Improved Algorithms for the Automata-Based Approach to Model...
Sort
View
126
Voted
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
15 years 9 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
132
Voted
PLDI
2003
ACM
15 years 7 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
KBSE
2010
IEEE
15 years 1 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer