Sciweavers

4716 search results - page 281 / 944
» Iterative-free program analysis
Sort
View
LPNMR
1997
Springer
15 years 10 months ago
Improving the Alternating Fixpoint: The Transformation Approach
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
Ulrich Zukowski, Burkhard Freitag, Stefan Brass
ESOP
1992
Springer
15 years 10 months ago
Dynamic Typing
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
Fritz Henglein
JMLC
2000
Springer
15 years 10 months ago
Modularisation of Software Configuration Management
The principle of modularisation is one of the main techniques that software designers use to tame the complexity of programming. A software project, however, is complex in many oth...
Henrik Bærbak Christensen
SIGSOFT
2006
ACM
16 years 7 months ago
Finding failure-inducing changes in java programs using change classification
Testing and code editing are interleaved activities during program development. When tests fail unexpectedly, the changes that caused the failure(s) are not always easy to find. W...
Barbara G. Ryder, Frank Tip, Maximilian Störz...
HICSS
2009
IEEE
108views Biometrics» more  HICSS 2009»
16 years 1 months ago
Approximate Dynamic Programming in Knowledge Discovery for Rapid Response
One knowledge discovery problem in the rapid response setting is the cost of learning which patterns are indicative of a threat. This typically involves a detailed follow-through,...
Peter Frazier, Warren B. Powell, Savas Dayanik, Pa...