1894 search results - page 264 / 379 » A TLA Proof System |
112
Voted
ICCBR
1999
Springer
15 years 8 months ago
1999
Springer
We discuss several problems of analogy-driven proof plan construction which prevent a solution for more diæcult target problems or make a solution very expensive. Some of these pr...
142
Voted
CSFW
1997
IEEE
15 years 8 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
189
click to vote
VL
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fra...
131
click to vote
TACAS
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
153
click to vote
CCL
1994
Springer
15 years 8 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...