Sciweavers

4716 search results - page 178 / 944
» Iterative-free program analysis
Sort
View
IWPC
2002
IEEE
15 years 7 months ago
Building Program Understanding Tools Using Visitor Combinators
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
Arie van Deursen, Joost Visser
ICALP
2010
Springer
15 years 7 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
CASES
2001
ACM
15 years 6 months ago
Efficient longest executable path search for programs with complex flows and pipeline effects
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
Friedhelm Stappert, Andreas Ermedahl, Jakob Engblo...
193
Voted
RTA
2011
Springer
14 years 5 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
125
Voted
ISSTA
2006
ACM
15 years 8 months ago
A regression tests selection technique for aspect-oriented programs
As the Aspect-Oriented Software Development gains popularity, there is growing interest as developing for existing object-oriented software aspects to address the crosscutting pro...
Guoqing Xu