Sciweavers

394 search results - page 30 / 79
» An Abstract Domain of Uninterpreted Functions
Sort
View
ESOP
2001
Springer
14 years 1 months ago
The Def-inite Approach to Dependency Analysis
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
Samir Genaim, Michael Codish
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 8 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICNS
2007
IEEE
14 years 3 months ago
Grid-enpowered Optical Burst Switched Network: Architecture, Protocols and Testbed
Abstract—This paper presents a novel architecture for Gridenabled optical burst switched networks. We suggest an overall Grid network architecture and we propose a Grid Optical U...
Georgios Zervas, Reza Nejabati, Dimitra Simeonidou
MIDDLEWARE
2005
Springer
14 years 2 months ago
Generic Middleware Substrate Through Modelware
Abstract. Conventional middleware architectures suffer from insufficient module-level reusability and the ability to adapt in face of functionality evolution and diversification....
Charles Zhang, Dapeng Gao, Hans-Arno Jacobsen
ITS
2004
Springer
124views Multimedia» more  ITS 2004»
14 years 2 months ago
A Multi-dimensional Taxonomy for Automating Hinting
Abstract. Hints are an important ingredient of natural language tutorial dialogues. Existing models of hints, however, are limited in capturing their various underlying functions, ...
Dimitra Tsovaltzi, Armin Fiedler, Helmut Horacek