518 search results - page 22 / 104 » Automating Proofs in Category Theory |
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
105
click to vote
IJCAI
2003
15 years 1 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
LPAR
2005
Springer
15 years 5 months ago
2005
Springer
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
110
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
190
click to vote
POPL
2007
ACM
16 years 1 days ago
2007
ACM
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...