default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive of Formal Proofs, Volume 2008
Volume 2008, 2008
- Tobias Nipkow:
Quantifier Elimination for Linear Arithmetic. - Klaus Aehlig, Tobias Nipkow:
Normalization by Evaluation. - Norbert Schirmer:
A Sequential Imperative Programming Language Syntax, Semantics, Hoare Logics and Verification Environment. - Veronika Ortner, Norbert Schirmer:
BDD Normalisation. - Michael Nedzelsky:
Recursion Theory I. - Filip Maric:
Formal Verification of Modern SAT Solvers. - Tobias Nipkow:
Fun With Functions. - Tobias Nipkow:
Arrow and Gibbard-Satterthwaite. - Gregor Snelting, Daniel Wasserrab:
A Correctness Proof for the Volpano/Smith Security Typing System. - Daniel Wasserrab:
Towards Certified Slicing. - Jasmin Christian Blanchette:
The Textbook Proof of Huffman's Algorithm. - Tobias Nipkow, Lawrence C. Paulson:
Fun With Tilings. - Peter Gammie:
Some classical results in Social Choice Theory. - Lennart Beringer, Martin Hofmann:
Secure information flow and program logics. - Lennart Beringer, Martin Hofmann:
A Bytecode Logic for JML and Types.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-15 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
