Sciweavers

1194 search results - page 207 / 239
» A Calculus for Predicative Programming
Sort
View
ICSE
2008
IEEE-ACM
14 years 11 months ago
Scalable detection of semantic clones
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
Mark Gabel, Lingxiao Jiang, Zhendong Su
ICLP
2009
Springer
14 years 11 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
14 years 5 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
ISCA
1996
IEEE
99views Hardware» more  ISCA 1996»
14 years 3 months ago
Performance Comparison of ILP Machines with Cycle Time Evaluation
Many studies have investigated performance improvement through exploiting instruction-level parallelism (ILP) with a particular architecture. Unfortunately, these studies indicate...
Tetsuya Hara, Hideki Ando, Chikako Nakanishi, Masa...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 11 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon