1485 search results - page 84 / 297 » Whole Program Paths |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites-a property that eliminates spurious interprocedural...
ENTCS
2010
13 years 9 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
ICPP
1996
IEEE
14 years 1 months ago
1996
IEEE
In this workshop session, three speakers present their viewpoints and contributions to the topic of portable parallel programming languages. They are Dennis Gannon from Indiana Un...
COMPSAC
2005
IEEE
14 years 3 months ago
2005
IEEE
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...