Sciweavers

2106 search results - page 74 / 422
» Specifying C concepts
Sort
View
ICFCA
2007
Springer
13 years 11 months ago
Performances of Galois Sub-hierarchy-building Algorithms
Abstract. The Galois Sub-hierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied to several fields, such as software engineering and linguis...
Gabriela Arévalo, Anne Berry, Marianne Huch...
CADE
2010
Springer
13 years 8 months ago
Multi-Prover Verification of Floating-Point Programs
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
Ali Ayad, Claude Marché
COCO
1993
Springer
78views Algorithms» more  COCO 1993»
13 years 11 months ago
The Quantitative Structure of Exponential Time
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
Jack H. Lutz
CCR
2008
75views more  CCR 2008»
13 years 7 months ago
Some comments on hourglasses
The hourglass concept has been undisputable ruler of networking visions on the last years. As network evolution is now a hot topic, this article aims to reflect on this concept, h...
Rui L. Aguiar
BNCOD
2006
85views Database» more  BNCOD 2006»
13 years 9 months ago
Trust Obstacle Mitigation for Database Systems
This paper introduces the Trust Obstacle Mitigation Model (TOMM), which uses the concept of trust assumptions to derive security obstacles, and the concept of misuse cases to model...
Victor Page, Robin C. Laney, Maurice Dixon, Charle...