Sciweavers

521 search results - page 71 / 105
» Reduction Strategies and Acyclicity
Sort
View
JFP
2000
91views more  JFP 2000»
13 years 7 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
KBSE
2005
IEEE
14 years 1 months ago
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
Mark Hennessy, James F. Power
JAR
2006
94views more  JAR 2006»
13 years 7 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ICFP
2003
ACM
14 years 7 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
LCTRTS
2007
Springer
14 years 2 months ago
Compiler-managed partitioned data caches for low power
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes that have high energy overheads. Ideally, the caching strategy should be tailor...
Rajiv A. Ravindran, Michael L. Chu, Scott A. Mahlk...