ASPLOS
2011
ACM
12 years 8 months ago
2011
ACM
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
ASPDAC
2011
ACM
12 years 8 months ago
2011
ACM
— Code coverage is a popular method to find design bugs and verification loopholes. However, once a piece of code is determined to be unreachable, diagnosing the cause of the p...
CORR
1999
Springer
13 years 4 months ago
1999
Springer
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
TAP
2008
Springer
13 years 4 months ago
2008
Springer
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
ISSS
2000
IEEE
13 years 9 months ago
2000
IEEE
Timing and power consumption of embedded systems are state and input data dependent. Formal analysis of such dependencies leads to intervals rather than single values. These inter...
IFM
2009
Springer
13 years 11 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...