Sciweavers

147 search results - page 9 / 30
» A Factor Graph Model for Software Bug Finding
Sort
View
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 7 months ago
Bounded Model Checking of Multi-threaded Software using SMT solvers
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...
Lucas Cordeiro, Bernd Fischer 0002
CAV
2006
Springer
95views Hardware» more  CAV 2006»
13 years 11 months ago
Yasm: A Software Model-Checker for Verification and Refutation
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
Arie Gurfinkel, Ou Wei, Marsha Chechik
CC
2006
Springer
147views System Software» more  CC 2006»
13 years 7 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
ASPDAC
2006
ACM
133views Hardware» more  ASPDAC 2006»
14 years 1 months ago
An SPU reference model for simulation, random test generation and verification
– An instruction set level reference model was developed for the development of synergistic processing unit (SPU) , which is one of the key components of the cell processor [1][2...
Yukio Watanabe, Balazs Sallay, Brad W. Michael, Da...
ICSE
2010
IEEE-ACM
14 years 13 days ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers