Sciweavers

8 search results - page 2 / 2
» Case-Analysis for Rippling and Inductive Proof
Sort
View
90
Voted
FUIN
2010
103views more  FUIN 2010»
14 years 6 months ago
Automation for Dependently Typed Functional Programming
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
Sean Wilson, Jacques D. Fleuriot, Alan Smaill
TPHOL
2008
IEEE
15 years 3 months ago
Nominal Inversion Principles
When reasoning about inductively defined predicates, such as typing judgements or reduction relations, proofs are often done by inversion, that is by a case analysis on the last r...
Stefan Berghofer, Christian Urban
73
Voted
TPHOL
2000
IEEE
15 years 1 months ago
Routing Information Protocol in HOL/SPIN
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
Karthikeyan Bhargavan, Carl A. Gunter, Davor Obrad...