425 search results - page 60 / 85 » The TPS Theorem Proving System |
ECSQARU
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we examine the ability to perform causal reasoning with equilibrium models. We explicate a postulate, which we term the Manipulation Postulate, that is required in o...
CSFW
1997
IEEE
15 years 1 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...
TACAS
1997
Springer
15 years 1 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 ...
104
click to vote
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
APLAS
2001
ACM
15 years 1 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...