Sciweavers

816 search results - page 92 / 164
» Automating Verification by Functional Abstraction at the Sys...
Sort
View
ALP
1992
Springer
14 years 1 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
ACSD
2006
IEEE
102views Hardware» more  ACSD 2006»
13 years 11 months ago
Models of Computation for Networks on Chip
Networks on chip platforms offer the opportunity to introduce a new abstraction level that defines a set of platform services with performance and power characteristics. By making...
Axel Jantsch
CADE
2007
Springer
14 years 3 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...
PROCEDIA
2010
148views more  PROCEDIA 2010»
13 years 3 months ago
SysCellC: a data-flow programming model on multi-GPU
High performance computing with low cost machines becomes a reality with GPU. Unfortunately, high performances are achieved when the programmer exploits the architectural specific...
Dominique Houzet, Sylvain Huet, Anis Rahman
EKAW
2000
Springer
14 years 23 days ago
Torture Tests: A Quantitative Analysis for the Robustness of Knowledge-Based Systems
Abstract. The overall aim of this paper is to provide a general setting for quantitative quality measures of Knowledge-Based System behavior which is widely applicable to many Know...
Perry Groot, Frank van Harmelen, Annette ten Teije