Sciweavers

9 search results - page 1 / 2
» SAT-Based Compositional Verification Using Lazy Learning
Sort
View
CAV
2007
Springer
164views Hardware» more  CAV 2007»
13 years 8 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
FMSD
2008
110views more  FMSD 2008»
13 years 4 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
DAC
2006
ACM
14 years 5 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
VLSID
2010
IEEE
155views VLSI» more  VLSID 2010»
13 years 2 months ago
Synchronized Generation of Directed Tests Using Satisfiability Solving
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
Xiaoke Qin, Mingsong Chen, Prabhat Mishra