4722 search results - page 134 / 945 » Representation-independent program analysis |
SIGSOFT
2010
ACM
13 years 7 months ago
2010
ACM
Most software tools and environments help developers analyze the present and past development states of their software systems. Few approaches have investigated the potential cons...
APLAS
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
APLAS
2008
ACM
13 years 11 months ago
2008
ACM
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
CADE
2001
Springer
14 years 9 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...