Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

We define a call-by-value variant of Gödel’s system T with references, and equip it with a linear dependent type and effect system, called d ℓ T , that can estimate the time complexity of programs, as a function of the size of their inputs. We prove that the type system is intentionally sound, in th...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of automated reasoning Ročník 63; číslo 4; s. 813 - 855
Hlavní autori:	Baillot, Patrick, Barthe, Gilles, Dal Lago, Ugo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.12.2019 Springer Nature B.V
Predmet:	Abstract machines Algorithms Artificial Intelligence Complexity Computer Science Cryptography Mathematical Logic and Formal Languages Mathematical Logic and Foundations Sound Symbolic and Algebraic Manipulation Upper bounds Complexity analysis Cryptographic proofs Linear dependent types Implicit computational complexity
ISSN:	0168-7433, 1573-0670
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!