1894 search results - page 74 / 379 » A TLA Proof System |
79
Voted
ICSE
2000
IEEE-ACM
15 years 4 months ago
2000
IEEE-ACM
This paper presents a technique for incrementally constructing safety specifications, abstract algorithm descriptions, and simulation proofs showing that algorithms meet their spe...
139
click to vote
PEPM
2010
ACM
15 years 2 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
123
click to vote
CADE
2005
Springer
16 years 1 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
104
click to vote
ICTAC
2004
Springer
15 years 6 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
155
Voted
AML
2011
14 years 7 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...