1410 search results - page 7 / 282 » Proving theorems by reuse |
CAV
2003
Springer
14 years 3 months ago
2003
Springer
Many verification problems reduce to proving the validity of formulas involving both propositional connectives and domain-specific functions and predicates. This paper presents ...
LICS
2012
IEEE
12 years 7 days ago
2012
IEEE
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas...
ICFP
2005
ACM
14 years 9 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 ...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...