Sciweavers

440 search results - page 49 / 88
» Local reasoning for abstraction and sharing
Sort
View
CSL
2008
Springer
15 years 3 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
ICC
2009
IEEE
125views Communications» more  ICC 2009»
15 years 8 months ago
Impact of Alliances on End-to-End QoS Satisfaction in an Interdomain Network
Abstract—This paper focuses on QoS guarantees in an interdomain selfish network where each domain may sell QoS guarantees for its transit traffic. The main objective of the pap...
Dominique Barth, Thierry Mautor, Daniel Villa Mont...
FORMATS
2007
Springer
15 years 8 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
EGC
2005
Springer
15 years 7 months ago
Grid Access Middleware for Handheld Devices
Abstract. Grid technology attempts to support flexible, secure, coordinated information sharing among dynamic collections of individuals, institutions, and resources. The use of G...
Saad Liaquat Kiani, Maria Riaz, Sungyoung Lee, Tae...
FROCOS
2005
Springer
15 years 7 months ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...