Sciweavers

535 search results - page 12 / 107
» Termination of Abstract Reduction Systems
Sort
View
CADE
2009
Springer
14 years 10 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
FSEN
2009
Springer
14 years 4 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
CORR
2011
Springer
115views Education» more  CORR 2011»
13 years 1 months ago
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
ibe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension ...
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amra...
LATA
2009
Springer
14 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
ICC
2008
IEEE
123views Communications» more  ICC 2008»
14 years 4 months ago
A Physical-Layer Technique to Enhance Authentication for Mobile Terminals
Abstract— We propose an enhanced physical-layer authentication scheme for multi-carrier wireless systems, where transmission bursts consist of multiple frames. More specifically...
Liang Xiao, Larry J. Greenstein, Narayan B. Manday...