Sciweavers

13383 search results - page 335 / 2677
» Abstractions from proofs
Sort
View
JGT
2010
90views more  JGT 2010»
15 years 5 months ago
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Michael Krivelevich, Raphael Yuster
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
14 years 6 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
GEOINFO
2004
15 years 8 months ago
Algebras for Moving Objects and Their Implementation
ceptual, or abstract level, a value of type moving point (type mpoint, for short) is a function from time into point values, and a moving region (mregion) value is a function from ...
Ralf Hartmut Güting
LICS
1991
IEEE
15 years 10 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
FORMATS
2004
Springer
16 years 5 days ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea