Sciweavers

35 search results - page 1 / 7
» Program Analysis via Satisfiability Modulo Path Programs
Sort
View
POPL
2010
ACM
14 years 2 months ago
Program Analysis via Satisfiability Modulo Path Programs
William R. Harris, Sriram Sankaranarayanan, Franjo...
ICDCIT
2005
Springer
13 years 10 months ago
Analyzing Loop Paths for Execution Time Estimation
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
Abhik Roychoudhury, Tulika Mitra, Hemendra Singh N...
PTS
2010
175views Hardware» more  PTS 2010»
13 years 2 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
TACAS
2009
Springer
136views Algorithms» more  TACAS 2009»
13 years 11 months ago
Path Feasibility Analysis for String-Manipulating Programs
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...
Nikolaj Bjørner, Nikolai Tillmann, Andrei V...
FORTE
2008
13 years 6 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...