Sciweavers

15777 search results - page 2695 / 3156
» The Reformulation-Optimization Software Engine
Sort
View
FSTTCS
2010
Springer
15 years 4 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák
FSTTCS
2010
Springer
15 years 4 months ago
Determining the Winner of a Dodgson Election is Hard
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...
ICFEM
2010
Springer
15 years 4 months ago
Reasoning about Safety and Progress Using Contracts
Designing concurrent or distributed systems with complex architectures while preserving a set of high-level requirements through all design steps is not a trivial task. Building up...
Imene Ben Hafaiedh, Susanne Graf, Sophie Quinton
ICST
2010
IEEE
15 years 4 months ago
GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...
Minh Duc Nguyen, Hélène Waeselynck, ...
ICSE
2009
IEEE-ACM
16 years 7 months ago
Taint-based directed whitebox fuzzing
We present a new automated white box fuzzing technique and a tool, BuzzFuzz, that implements this technique. Unlike standard fuzzing techniques, which randomly change parts of the...
Vijay Ganesh, Tim Leek, Martin C. Rinard
« Prev « First page 2695 / 3156 Last » Next »