2947 search results - page 210 / 590 » Analyzing Program Analyses |
146
Voted
FM
2001
Springer
15 years 11 months ago
2001
Springer
A static program checker that performs modular checking can check one program module for errors without needing to analyze the entire program. Modular checking requires that each m...
165
click to vote
ISCOPE
1999
Springer
15 years 10 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
146
click to vote
ESOP
1990
Springer
15 years 10 months ago
1990
Springer
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
159
click to vote
AAAI
1994
15 years 7 months ago
1994
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 ...
169
click to vote
JUCS
2006
15 years 6 months ago
2006
: PEWS is a language for the implementation of web service interfaces. PEWS programs can be used for the description of both individual and composed web services. Individual web se...