Sciweavers

10715 search results - page 159 / 2143
» Proofs from Tests
Sort
View
101
Voted
CADE
1999
Springer
15 years 5 months ago
System Description: CutRes 0.1: Cut Elimination by Resolution
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
Matthias Baaz, Alexander Leitsch, Georg Moser
91
Voted
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 11 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
93
Voted
IANDC
2010
102views more  IANDC 2010»
14 years 11 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
97
Voted
LPAR
2010
Springer
14 years 11 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen
96
Voted
ICSR
2009
Springer
14 years 10 months ago
Verifying Component-Based Software: Deep Mathematics or Simple Bookkeeping?
Anecdotal experience constructing proofs of correctness of code built from reusable software components reveals that they tend to be relatively trivial bookkeeping exercises: they ...
Jason Kirschenbaum, Bruce M. Adcock, Derek Bronish...