Sciweavers

3680 search results - page 149 / 736
» cases 2010
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
JCS
2010
80views more  JCS 2010»
15 years 1 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
SIGMOBILE
2010
147views more  SIGMOBILE 2010»
15 years 1 months ago
TCPSpeaker: clean and dirty sides of the same slate
As new approaches toward clean-slate network transport continue to emerge in the wireless domain and beyond, so grows the difficulty of conducting reproducible, head-to-head evalu...
Dan Levin, Harald Schiöberg, Ruben Merz, Cigd...
AICOM
2010
127views more  AICOM 2010»
15 years 6 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
IOR
2010
98views more  IOR 2010»
15 years 3 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith