Sciweavers

308 search results - page 19 / 62
» Symbolic execution of data paths
Sort
View
DAC
2006
ACM
14 years 9 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu
PLDI
1999
ACM
14 years 27 days ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus
ICFEM
2009
Springer
13 years 6 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
KBSE
2010
IEEE
13 years 7 months ago
Test generation to expose changes in evolving programs
Software constantly undergoes changes throughout its life cycle, and thereby it evolves. As changes are introduced into a code base, we need to make sure that the effect of the ch...
Dawei Qi, Abhik Roychoudhury, Zhenkai Liang
JSS
2007
120views more  JSS 2007»
13 years 8 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta