Sciweavers

444 search results - page 26 / 89
» Termination by Abstraction
Sort
View
FC
2005
Springer
80views Cryptology» more  FC 2005»
14 years 2 months ago
A User-Friendly Approach to Human Authentication of Messages
Abstract. Users are often forced to trust potentially malicious terminals when trying to interact with a remote secure system. This paper presents an approach for ensuring the inte...
Jeff King, André L. M. dos Santos
VMCAI
2007
Springer
14 years 3 months ago
On Flat Programs with Lists
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
Marius Bozga, Radu Iosif
LOPSTR
2004
Springer
14 years 2 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...
TIT
2010
140views Education» more  TIT 2010»
13 years 3 months ago
Iterative decoding threshold analysis for LDPC convolutional codes
Abstract--An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavio...
Michael Lentmaier, Arvind Sridharan, Daniel J. Cos...
CSL
2008
Springer
13 years 11 months ago
The Computability Path Ordering: The End of a Quest
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
Frédéric Blanqui, Jean-Pierre Jouann...