Sciweavers

4716 search results - page 123 / 944
» Iterative-free program analysis
Sort
View
DDEP
2000
Springer
15 years 2 months ago
A Link-Oriented Comparison of Hyperdocuments and Programs
There are parallels between the construction of programs and the construction of hypertexts, and in ar between the abstractions available to the application programmer and those a...
Heather Brown, Peter J. Brown, Les Carr, Wendy Hal...
JUCS
2007
80views more  JUCS 2007»
14 years 9 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa
IPPS
2007
IEEE
15 years 4 months ago
ExPert: Dynamic Analysis Based Fault Location via Execution Perturbations
We are designing dynamic analysis techniques to identify executed program statements where a fault lies, i.e. the fault candidate set. To narrow the set of statements in the fault...
Neelam Gupta, Rajiv Gupta
ACE
2004
222views Education» more  ACE 2004»
14 years 11 months ago
Learning about Software Development - Should Programming Always Come First?
The issues surrounding curriculum design of many Computer Science and Software Engineering degree programs1 are many and complex. In particular, the question of whether prior prog...
Margaret Hamilton, Liz Haywood
CC
2004
Springer
110views System Software» more  CC 2004»
15 years 3 months ago
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
Venkatesh Prasad Ranganath, John Hatcliff