344 search results - page 2 / 69 » Some Theorems We Should Prove |
CADE
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
IANDC
1998
13 years 5 months ago
1998
We present a model for representing search in theorem proving. This model captures the notion of contraction, which has been central in some of the recent developments in theorem ...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
TABLEAUX
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a clausal connection calculus for first-order intuitionistic logic. It extends the classical connection calculus by adding prefixes that encode the character...
JAR
2008
13 years 6 months ago
2008
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...