1894 search results - page 255 / 379 » A TLA Proof System |
132
click to vote
LOGCOM
2007
15 years 4 months ago
2007
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
125
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
A secure timeline is a tamper-evident historic record of the states through which a system goes throughout its operational history. Secure timelines can help us reason about the t...
250
click to vote
CP
2009
Springer
16 years 4 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
152
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
140
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...