Sciweavers

4722 search results - page 145 / 945
» Representation-independent program analysis
Sort
View
JUCS
2010
95views more  JUCS 2010»
13 years 4 months ago
Realisability for Induction and Coinduction with Applications to Constructive Analysis
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
Ulrich Berger
SCAM
2007
IEEE
14 years 3 months ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman
DDEP
2000
Springer
14 years 1 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»
13 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
14 years 3 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