Sciweavers

181 search results - page 20 / 37
» Using Static Analysis to Find Bugs
Sort
View
KBSE
2007
IEEE
14 years 3 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ESE
2006
105views Database» more  ESE 2006»
13 years 9 months ago
Replaying development history to assess the effectiveness of change propagation tools
As developers modify software entities such as functions or variables to introduce new features, enhance old ones, or fix bugs, they must ensure that other entities in the software...
Ahmed E. Hassan, Richard C. Holt
ICSE
2007
IEEE-ACM
14 years 9 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...
ENDM
2010
86views more  ENDM 2010»
13 years 9 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
POPL
2007
ACM
14 years 9 months ago
Proving that programs eventually do something good
In recent years we have seen great progress made in the area of automatic source-level static analysis tools. However, most of today's program verification tools are limited ...
Byron Cook, Alexey Gotsman, Andreas Podelski, Andr...