Sciweavers

1199 search results - page 174 / 240
» Parameterized Proof Complexity
Sort
View
ITP
2010
179views Mathematics» more  ITP 2010»
14 years 22 days ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler
ASIACRYPT
2006
Springer
14 years 18 days ago
Finding SHA-1 Characteristics: General Results and Applications
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...
Christophe De Cannière, Christian Rechberge...
CIARP
2006
Springer
14 years 17 days ago
A New Approach to Multi-class Linear Dimensionality Reduction
Linear dimensionality reduction (LDR) is quite important in pattern recognition due to its efficiency and low computational complexity. In this paper, we extend the two-class Chern...
Luis Rueda, Myriam Herrera
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
14 years 5 days ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
ASM
2008
ASM
13 years 11 months ago
Model Checking Event-B by Encoding into Alloy
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
Paulo J. Matos, João Marques-Silva