1206 search results - page 117 / 242 » Concurrent Abstract Predicates |
128
click to vote
CADE
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
122
Voted
FM
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
127
click to vote
LPAR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
110
Voted
ECSQARU
1997
Springer
15 years 6 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
141
Voted
FOIKS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...