Sciweavers

3335 search results - page 392 / 667
» Grid result checking
Sort
View
CADE
2006
Springer
16 years 7 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka
ICSE
2003
IEEE-ACM
16 years 6 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
ICFP
2006
ACM
16 years 6 months ago
Boxy types: inference for higher-rank types and impredicativity
Languages with rich type systems are beginning to employ a blend of type inference and type checking, so that the type inference engine is guided by programmer-supplied type annot...
Dimitrios Vytiniotis, Stephanie Weirich, Simon L. ...
184
Voted
ICS
2010
Tsinghua U.
16 years 4 months ago
Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities
We consider Fisher and Arrow-Debreu markets under additively-separable, piecewise-linear, concave utility functions, and obtain the following results: ? For both market models, if...
Vijay V. Vazirani, Mihalis Yannakakis
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
Abstract. Fault Analysis is a powerful cryptanalytic technique that enables to break cryptographic implementations embedded in portable devices more efficiently than any other tech...
Matthieu Rivain