104 search results - page 14 / 21 » Proving Termination Properties with mu-term |
CADE
2003
Springer
14 years 7 months ago
2003
Springer
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
CSFW
2005
IEEE
14 years 1 months ago
2005
IEEE
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
CCL
1994
Springer
13 years 11 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...
HOA
1993
13 years 11 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...