Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,829,376 papers from all fields of science
Search
Sign In
Create Free Account
Termination analysis
Known as:
Termination
, Measure (termination)
, Termination proof
Expand
In computer science, a termination analysis is program analysis which attempts to determine whether the evaluation of a given program will definitely…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
AC-3 algorithm
Agda
Algorithm
Analysis of algorithms
Expand
Broader (1)
Static program analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Managing the reproductive cycle in the bitch.
M. Kustritz
2012
Corpus ID: 196398340
2009
2009
Understanding Patterns of Human Interactions and Decision Making: An Initial Map of Podocarpus National Park, Ecuador
D. Cherney
,
Alice C. Bond
,
S. G. Clark
2009
Corpus ID: 15841408
Successful conservation is as much about people and how they make decisions as it is about flora and fauna. Just as it is…
Expand
2006
2006
Accurate programmable electrocardiogram generator using a dynamical model implemented on a microcontroller
Jiaju Chang
,
C. Tai
2006
Corpus ID: 28848997
This article reports on the design and development of a complete, programmable electrocardiogram (ECG) generator, which can be…
Expand
2001
2001
Termination Proofs by Context-Dependent Interpretations
D. Hofbauer
International Conference on Rewriting Techniques…
2001
Corpus ID: 39624053
Proving termination of a rewrite system by an interpretation over the natural numbers directly implies an upper bound on the…
Expand
1999
1999
Applying Rewriting Techniques to the Verification of Erlang Processes
T. Arts
,
J. Giesl
Annual Conference for Computer Science Logic
1999
Corpus ID: 1447250
Erlang is a functional programming language developed by Ericsson Telecom which is particularly well suited for implementing…
Expand
1995
1995
Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq
F. Leclerc
International Conference on Typed Lambda Calculus…
1995
Corpus ID: 41497477
We propose a constructive termination proof in the Calculus of Constructions of any finite term rewriting systems whose rules can…
Expand
1994
1994
Generating Polynomial Orderings
J. Steinbach
Information Processing Letters
1994
Corpus ID: 13585161
1991
1991
Ectomycorrhizae and Drought Acclimation Influence Water Relations and Growth of Loblolly Pine
S. Svenson
,
F. Davies
,
C. E. Meier
1991
Corpus ID: 88837319
The influence of ectomycorrhizae on drought acclimation was studied in an open-pollinated family of loblolly pine (Pinus taeda L…
Expand
1985
1985
Automatic segmentation of continuous speech signals
R. André-Obrecht
ICASSP '86. IEEE International Conference on…
1985
Corpus ID: 60826170
A statistical approach of the automatic segmentation of the speech signal is discussed. The purpose is to detect acoustic events…
Expand
1966
1966
An Iterative Spike Separation Technique
D. Keehn
1966
Corpus ID: 62597205
A spike separation technique which combines data processing methods with extracellular probing techniques to allow simultaneous…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE