Sciweavers

3458 search results - page 556 / 692
» Abstracting Control
Sort
View
WADT
1998
Springer
15 years 2 months ago
Complete Strategies for Term Graph Narrowing
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
Annegret Habel, Detlef Plump
DAC
1997
ACM
15 years 2 months ago
System Level Fixed-Point Design Based on an Interpolative Approach
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
Markus Willems, Volker Bürsgens, Holger Kedin...
AGP
1996
IEEE
15 years 2 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
CIKM
1997
Springer
15 years 2 months ago
A Framework for the Management of Past Experiences with Time-Extended Situations
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
Michel Jaczynski
ICDT
1997
ACM
138views Database» more  ICDT 1997»
15 years 2 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin