Inductive invariants for nested recursion (2003)

by Sava Krstić , John Matthews
Venue:Theorem Proving in Higher Order Logics (TPHOLS'03), volume 2758 of LNCS
Citations:4 - 2 self

Documents Related by Co-Citation

30 Reasoning about Terminating Functional Programs – Konrad Slind - 1999
7 Another Look at Nested Recursion – Konrad Slind
10 Treating partiality in a logic of total functions – Olaf Müller, Konrad Slind - 1997
31 Partial Functions in ACL2 – Panagiotis Manolios, J Strother Moore
8 A Step Towards the Mechanization of Partial Functions: Domains as Inductive Predicates – Catherine Dubois, Véronique Viguié Donzeau-Gouge - 1998
724 M.: Isabelle/HOL - A Proof Assistant for HigherOrder Logic – T Nipkow, L C Paulson, Wenzel - 2002
17 Defining and reasoning about recursive functions: a practical tool for the coq proof assistant – Gilles Barthe, Julien Forest, David Pichardie, Vlad Rusu - 2006
8 Proof styles in operational semantics – Ip Ray, J Strother Moore - 2004
1 Information on Cryptol can be found at http://www.cryptol.net. [4 – D Dams, R Gerth, O Grumberg - 2000
5 Wellfounded Schematic Definitions – K Slind - 2000
13 The optimal approach to recursive programs – Zohar Manna, Adi Shamir - 1977
9 Ordinal arithmetic in ACL2 – Panagiotis Manolios, Daron Vroon - 2003
14 Proving Termination of Normalization Functions for Conditional Expressions – Lawrence C Paulson - 1986
11 Verifying BDD Algorithms through Monadic Interpretation – Sava Krstic, John Matthews - 2002
25 Inductive assertions and operational semantics – J Strother Moore - 2003
22 Inductive definitions: automation and application – J Harrison - 1995
22 Function definition in higher order logic – Konrad Slind - 1996
24 Nested General Recursion and Partiality in Type Theory – Ana Bove, Venanzio Capretta - 2000
5 Type-theoretic functional semantics – Yves Bertot, Venanzio Capretta, Kuntal Das Barman - 2002