Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ASPLOS
2011
ACM
9 years 7 months ago
Improving the performance of trace-based systems by false loop filtering
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...
Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mau...
ASPDAC
2011
ACM
157views Hardware» more  ASPDAC 2011»
9 years 7 months ago
Facilitating unreachable code diagnosis and debugging
— 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...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
CORR
1999
Springer
139views Education» more  CORR 1999»
10 years 3 months ago
Combinatorics of branchings in higher dimensional automata
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...
Philippe Gaucher
TAP
2008
Springer
93views Hardware» more  TAP 2008»
10 years 3 months ago
Pex-White Box Test Generation for .NET
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,...
Nikolai Tillmann, Jonathan de Halleux
CP
2008
Springer
10 years 5 months ago
CPBPV: A Constraint-Programming Framework for Bounded Program Verification
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...
Hélène Collavizza, Michel Rueher, Pa...
ISSS
2000
IEEE
155views Hardware» more  ISSS 2000»
10 years 8 months ago
Intervals in Software Execution Cost Analysis
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...
Fabian Wolf, Rolf Ernst
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
10 years 10 months ago
Dynamic Path Reduction for Software Model Checking
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...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
books