444 search results - page 25 / 89 » Termination by Abstraction |
FMCAD
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
CAV
2006
Springer
14 years 26 days ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
CADE
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...