1274 search results - page 141 / 255 » New Proofs for |
88
Voted
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
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...
97
Voted
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
129
click to vote
TABLEAUX
1995
Springer
15 years 4 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
131
Voted
ASM
2008
ASM
15 years 3 months ago
2008
ASM
Abstract. The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical ver...
103
click to vote
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...