Sciweavers

15375 search results - page 180 / 3075
» cans 2008
Sort
View
ENTCS
2008
66views more  ENTCS 2008»
13 years 8 months ago
Measuring and Evaluating Parallel State-Space Exploration Algorithms
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...
Jonathan Ezekiel, Gerald Lüttgen
ENTCS
2008
116views more  ENTCS 2008»
13 years 8 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
ENTCS
2008
85views more  ENTCS 2008»
13 years 8 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp
ENTCS
2008
98views more  ENTCS 2008»
13 years 8 months ago
Modal Expressiveness of Graph Properties
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
Mario R. F. Benevides, L. Menasché Schechte...
ENTCS
2008
158views more  ENTCS 2008»
13 years 8 months ago
Aspect-Oriented Action Semantics Descriptions
The modularity of programming language descriptions allows the designer to describe each programming language feature in a separated module that can be studied independently of ot...
Luis Carlos de Sousa Menezes