Sciweavers

444 search results - page 13 / 89
» Termination by Abstraction
Sort
View
CAV
2012
Springer
198views Hardware» more  CAV 2012»
11 years 11 months ago
Termination Analysis with Algorithmic Learning
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
CADE
2009
Springer
14 years 9 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
CSL
2010
Springer
13 years 9 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 5 months ago
Energy-Efficient Precoding for Multiple-Antenna Terminals
Abstract--The problem of energy-efficient precoding is investigated when the terminals in the system are equipped with multiple antennas. Considering static and fast-fading multipl...
Elena Veronica Belmega, Samson Lasaulce
CORR
2011
Springer
115views Education» more  CORR 2011»
13 years 22 days 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...