4722 search results - page 44 / 945 » Representation-independent program analysis |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
PLDI
2009
ACM
14 years 8 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
ESOP
2010
Springer
14 years 2 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
COMPSAC
2000
IEEE
14 years 4 days ago
2000
IEEE
Understanding program dependencies in a computer program is essential for many software engineering tasks such as program understanding, testing, debugging, reverse engineering, a...
BIRTHDAY
2010
Springer
13 years 8 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...