Sciweavers

4716 search results - page 110 / 944
» Iterative-free program analysis
Sort
View
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 1 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
AAAI
1994
14 years 11 months ago
Termination Analysis of OPS5 Expert Systems
Bounded response time is an important requirement when rule-based expert systems are used in real-time applications. In the case the rule-based system cannot terminate in bounded ...
Hsiu-yen Tsai, Albert Mo Kim Cheng
FASE
2005
Springer
15 years 3 months ago
Kaveri: Delivering the Indus Java Program Slicer to Eclipse
This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it’s Eclipse-based user interface called Kaveri. Indus pro...
Ganeshan Jayaraman, Venkatesh Prasad Ranganath, Jo...
SMALLTALK
2007
Springer
15 years 4 months ago
Object flow analysis: taking an object-centric view on dynamic analysis
To extract abstract views of the behavior of an object-oriented system for reverse engineering, a body of research exists that analyzes a system’s runtime execution. Those approa...
Adrian Lienhard, Stéphane Ducasse, Tudor G&...
SAC
2009
ACM
15 years 4 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe