Documents Related by Co-Citation

585 Isabelle/HOL: A Proof Assistant for Higher-Order Logic – T Nipkow, L C Paulson, M Wenzel - 2002
14 Finding lexicographic orders for termination proofs in Isabelle/HOL – Lukas Bulwahn, Er Krauss, Tobias Nipkow - 2007
4 Formalising Huffman’s Algorithm – Laurent Théry - 2004
3 A Correctness Proof of Huffman Algorithm. http://coq. inria.fr/contribs/Huffman.html – Laurent Théry - 2003
10 A code generator framework for Isabelle/HOL – Florian Haftmann, Tobias Nipkow - 2007
773 A method for the construction of minimum-redundancy codes – D A Huffman - 1952
90 Generalized Kraft inequality and arithmetic coding – J Rissanen - 1976
21 The Definition of Standard ML, Revised Edition – Robin Milner, Mads Tofte, Robert Harper, David MacQueen - 1997
540 Introduction to Algorithms, second edition – Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein - 2001
644 Data Structures and Algorithms – A Aho, J Hopcroft, J D Ullman - 1983
184 Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic – M J C Gordon, T F - 1993
36 Random testing in isabelle/hol – Stefan Berghofer, Tobias Nipkow, Technische Universität München - 2004
28 The Isabelle/Isar Reference Manual – Markus Wenzel - 2007
6 Automating Recursive Definitions and Termination Proofs in Higher-Order Logic. PhD thesis, Institut für Informatik, Technische Universität – A Krauss - 2009
12 Towards mechanical metamathematics – N. Shankar, N. Bourbaki [bourbaki - 1985
1 Formalization and Implementation of Modern SAT Solvers – Filip Marić
1 The mechanical verification of a DPLLbased satisfiability solver. Manuscript submitted for publication – N Shankar, M Vaucher - 2008
2 Proof general in Eclipse: system and architecture overview – D Aspinall - 2006
1 Adding native specifications to JML. Formal Techniques for Java-like Programs – J Charles - 2006