Sciweavers

2780 search results - page 177 / 556
» Generalizing by Removing Detail
Sort
View
OOPSLA
1999
Springer
15 years 10 months ago
Practical Experience with an Application Extractor for Java
Java programs are routinely transmitted over low-bandwidth network connections as compressed class le archives (i.e., zip les and jar les). Since archive size is directly proporti...
Frank Tip, Chris Laffra, Peter F. Sweeney, David S...
SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
15 years 10 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
KR
1998
Springer
15 years 10 months ago
Comparing Consequence Relations
The technical problem addressed in this paper is, given two rule systems for consequence relations X and Y, how to construct Y-approximations of a given X-relation. While an upper...
Peter A. Flach
KR
1998
Springer
15 years 10 months ago
Specifying Transactions for Extended Abduction
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...
Katsumi Inoue, Chiaki Sakama
ICFP
1997
ACM
15 years 10 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves