1894 search results - page 118 / 379 » A TLA Proof System |
108
click to vote
LICS
1991
IEEE
15 years 4 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
104
Voted
FLAIRS
2000
15 years 2 months ago
2000
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify the verification process in practice. We study this question using a prominent e...
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
118
Voted
ENTCS
2008
15 years 1 months ago
2008
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic. A heterogeneou...
119
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...