Hans Zantema - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged termination

Well-Definedness of Streams by TerminationHans Zantema. RTA 2009: 164-178 [doi]

A Transformational Approach to Prove Outermost Termination AutomaticallyMatthias Raffelsieper, Hans Zantema. ENTCS, 237:3-21, 2009. [doi]

Atrial Anatomy Influences Onset and Termination of Atrial Fibrillation: A Computer Model StudyNico Kuijpers, Huub M. M. ten Eikelder, Sander Verheule. fimh 2009: 285-294 [doi]

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. JAR, 40(2-3):195-220, 2008. [doi]

Certification of Proving Termination of Term Rewriting by Matrix InterpretationsAdam Koprowski, Hans Zantema. sofsem 2008: 328-339 [doi]

The Termination CompetitionClaude Marché, Hans Zantema. RTA 2007: 303-313 [doi]

Termination by Quasi-periodic InterpretationsHans Zantema, Johannes Waldmann. RTA 2007: 404-418 [doi]

On tree automata that certify termination of left-linear term rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. iandc, 205(4):512-534, 2007. [doi]

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. cade 2006: 574-588 [doi]

Reducing Right-Hand Sides for TerminationHans Zantema. BIRTHDAY 2005: 173-197 [doi]

On Tree Automata that Certify Termination of Left-Linear Term Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. RTA 2005: 353-367 [doi]

Finding finite automata that certify termination of string rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. ijfcs, 16(3):471-486, 2005. [doi]

Termination of String Rewriting Proved AutomaticallyHans Zantema. JAR, 34(2):105-139, 2005. [doi]

Termination of Polynomial ProgramsAaron R. Bradley, Zohar Manna, Henny B. Sipma. vmcai 2005: 113-129 [doi]

Finding Finite Automata That Certify Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. wia 2004: 134-145 [doi]

TORPA: Termination of Rewriting Proved AutomaticallyHans Zantema. RTA 2004: 95-104 [doi]

Relative Undecidability in Term Rewriting: I. The Termination HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):101-131, 2002. [doi]

Approximations for Strategies and TerminationENTCS, 70(6):1-20, 2002. [doi]

Outermost ground terminationOlivier Fissore, Isabelle Gnaedig, Hélène Kirchner. ENTCS, 71:188-207, 2002. [doi]

The Termination Hierarchy for Term RewritingHans Zantema. aaecc, 12(1/2):3-19, 2001. [doi]

A Complete Characterization of Termination of 0:::p::: 1:::q:::-> 1:::r::: 0:::s:::Hans Zantema, Alfons Geser. aaecc, 11(1):1-25, 2000. [doi]

Ensuring Termination in ESFPAlastair Telford, David Turner. jucs, 6(4):474-488, 2000. [doi]

Termination and normalisation under strategy Proofs in ELANHélène Kirchner, Isabelle Gnaedig. ENTCS, 36:93-120, 2000. [doi]

Termination of Context-Sensitive RewritingHans Zantema. RTA 1997: 172-186

Termination Modulo Equations by Abstract Commutation with an Application to IterationWan Fokkink, Hans Zantema. TCS, 177(2):407-423, 1997. [doi]

Simple Termination of Rewrite SystemsAart Middeldorp, Hans Zantema. TCS, 175(1):127-158, 1997. [doi]

Relative Undecidability in the Termination Hierarchy of Single Rewrite RulesAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. tapsoft 1997: 237-248

Task Dependence and Termination in AdaLaura K. Dillon. TOSEM, 6(1):80-110, 1997. [doi]

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. aaecc, 7(2):133-162, 1996. [doi]

Transforming Termination by Self-LabellingAart Middeldorp, Hitoshi Ohsaki, Hans Zantema. cade 1996: 373-387

Strong Termination for the Epsilong Substitution MethodGrigori Mints. JSYML, 61(4):1193-1205, 1996.

Dummy Elimination: Making Termination EasierMaria C. F. Ferreira, Hans Zantema. fct 1995: 243-252

A Complete Characterization of Termination of O:::p::: 1:::q::: -> 1:::r::: O:::s:::Hans Zantema, Alfons Geser. RTA 1995: 41-55

Termination of Logic Programs Using Semantic UnificationThomas Arts, Hans Zantema. LOPSTR 1996: 219-233

Termination of Term Rewriting by Semantic LabellingHans Zantema. FUIN, 24(1/2):89-105, 1995.

Total Termination of Term Rewriting is UndecidableHans Zantema. JSC, 20(1):43-60, 1995.

Termination Criteria for Linear ProblemsSpassimir H. Paskov. jc, 11(1):105-137, 1995. [doi]

Syntactical Analysis of Total TerminationMaria C. F. Ferreira, Hans Zantema. icalp 1994: 204-222

Termination of Term Rewriting: Interpretation and Type EliminationHans Zantema. JSC, 17(1):23-50, 1994.

Simple Termination RevisitedAart Middeldorp, Hans Zantema. cade 1994: 451-465

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. RTA 1993: 213-227

Some Undecidable Termination Problems for Semi-Thue Systems (Abstract)Géraud Sénizergues. RTA 1993: 434

Termination of Term Rewriting by InterpretationHans Zantema. ctrs 1993: 155-167

Distributed Termination EnforcementMartin Rudalics. parle 1992: 363-378

Delay and Crosstalk Simulation of High-Speed VLSI Interconnects with Nonlinear TerminationsDong H. Xie, Michel S. Nakhla. iccad 1991: 66-69

Algorithms for Distributed Termination DetectionFriedemann Mattern. dc, 2(3):161-175, 1987.

The SV40 termination region exhibits an altered helical DNA conformationL. G. Poljak, J. D. Gralla. nar, 15(13):5433-5442, 1987.

Experience with a New Distributed Termination Detection AlgorithmFriedemann Mattern. wdag 1988: 127-143

A Formalism for Reasoning about Fair TerminationWillem P. de Roever. lop 1982: 113-121

Distributed TerminationNissim Francez. TOPLAS, 2(1):42-55, 1980. [doi]

runs on WebDSL