Sciweavers

3552 search results - page 586 / 711
» Proof theory in the abstract
Sort
View
SAS
2004
Springer
16 years 13 days ago
On Logics of Aliasing
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
Marius Bozga, Radu Iosif, Yassine Lakhnech
WADT
2004
Springer
16 years 12 days ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
ICALP
2003
Springer
16 years 8 days ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren
201
Voted
AFRICACRYPT
2010
Springer
16 years 6 days ago
Strong Cryptography from Weak Secrets
the full version of the extended abstract which appears in Africacrypt ’10 (3 – 6 may 2010, Stellenbosch, South Africa) D. Bernstein and T. Lange Eds., Springer-Verlag, LNCS 60...
Xavier Boyen, Céline Chevalier, Georg Fuchs...
MFCS
2009
Springer
15 years 11 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...