535 search results - page 39 / 107 » Termination of Abstract Reduction Systems |
118
click to vote
ISCAS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— Beamforming (BF) for multiple-input multipleoutput (MIMO) wireless communications systems can improve the error rate performance by spatial separation of the transmitte...
125
Voted
VMCAI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
136
Voted
CADE
2000
Springer
15 years 8 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 ...
127
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
122
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. ...