1894 search results - page 265 / 379 » A TLA Proof System |
151
click to vote
ICTL
1994
15 years 8 months ago
1994
We introduce a temporal logic TAL and prove that it has several nice features. The formalism is a two-dimensional modal system in the sense that formulas of the language are evalua...
145
click to vote
LFCS
1994
Springer
15 years 8 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
145
click to vote
VLDB
1990
ACM
15 years 8 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
144
Voted
APLAS
2007
ACM
15 years 8 months ago
2007
ACM
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
114
Voted
AMAST
2006
Springer
15 years 8 months ago
2006
Springer
This paper revolves around the so-called plan revision rules of the agent programming language 3APL. These rules can be viewed as a generalization of procedures. This generalizatio...