Sciweavers

3299 search results - page 175 / 660
» A general mathematics of names
Sort
View
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
15 years 10 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
DAC
2007
ACM
15 years 10 months ago
Side-Channel Attack Pitfalls
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
Kris Tiri
ITP
2010
159views Mathematics» more  ITP 2010»
15 years 10 months ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...
ADG
2006
Springer
191views Mathematics» more  ADG 2006»
15 years 10 months ago
Automatic Verification of Regular Constructions in Dynamic Geometry Systems
We present an application of an automatic theorem proving (ATP) in the verification of constructions made with dynamic geometry software (DGS). Given a specification language for g...
Predrag Janicic, Pedro Quaresma
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 10 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom