Sciweavers

369 search results - page 62 / 74
» Execution Synthesis: A Technique for Automated Software Debu...
Sort
View
ISSTA
2010
ACM
13 years 9 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
PLDI
2009
ACM
14 years 2 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
METRICS
1999
IEEE
13 years 12 months ago
Metrics for Quantifying the Disparity, Concentration, and Dedication between Program Components and Features
One of the most important steps towards effective software maintenance of a large complicated system is to understand how program features are spread over the entire system and th...
W. Eric Wong, Swapna S. Gokhale, Joseph Robert Hor...
NFM
2011
242views Formal Methods» more  NFM 2011»
13 years 2 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
DAC
2003
ACM
14 years 8 months ago
A scalable software-based self-test methodology for programmable processors
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...