Sciweavers

601 search results - page 115 / 121
» Verifiable Network-Performance Measurements
Sort
View
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
13 years 11 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
ACSAC
2001
IEEE
13 years 11 months ago
Practical Automated Filter Generation to Explicitly Enforce Implicit Input Assumptions
Vulnerabilities in distributed applications are being uncovered and exploited faster than software engineers can patch the security holes. All too often these weaknesses result fr...
Valentin Razmov, Daniel R. Simon
CHI
1995
ACM
13 years 11 months ago
The ScienceWare Modeler: a learner-centered tool for students building models
The Modeler is designed using a learner-centered approach [5], with scaffolding to address the specific needs of learners. Scaffolding [3] is an educational term that refers to pro...
Shari L. Jackson
TIC
2000
Springer
137views System Software» more  TIC 2000»
13 years 11 months ago
Scalable Certification for Typed Assembly Language
Abstract. A type-based certifying compiler maps source code to machine code and target-level type annotations. The target-level annotations make it possible to prove easily that th...
Dan Grossman, J. Gregory Morrisett
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch