Sciweavers

1818 search results - page 54 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
EJC
2008
13 years 9 months ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang
ENTCS
2008
121views more  ENTCS 2008»
13 years 9 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
ENTCS
2007
83views more  ENTCS 2007»
13 years 8 months ago
Enhancing Theorem Prover Interfaces with Program Slice Information
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
Louise A. Dennis
SCP
2008
89views more  SCP 2008»
13 years 8 months ago
A challenge for atomicity verification
An unpublished algorithm of Haldar and Vidyasankar implements an atomic variable of an arbitrary type T for one writer and one reader by means of 4 unsafe variables of type T , th...
Wim H. Hesselink
AIEDU
2005
93views more  AIEDU 2005»
13 years 8 months ago
The Logic-ITA in the Classroom: A Medium Scale Experiment
This paper presents the experiment and consequent evaluation of introducing the Logic-ITA in a second year tertiary undergraduate class. The Logic-ITA is a web-based Intelligent Te...
Kalina Yacef