16 search results - page 1 / 4 » Path Feasibility Analysis for String-Manipulating Programs |
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
BIRTHDAY
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
EDCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
PLDI
2005
ACM
13 years 10 months ago
2005
ACM
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
WCET
2008
13 years 6 months ago
2008
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...