Aart Middeldorp - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged termination

Tyrolean Termination Tool 2Martin Korp, Christian Sternagel, Harald Zankl, Aart Middeldorp. RTA 2009: 295-304 [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]

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

Uncurrying for TerminationNao Hirokawa, Aart Middeldorp, Harald Zankl. lpar 2008: 667-681 [doi]

Maximal TerminationCarsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl. RTA 2008: 110-125 [doi]

Alternative Methods in Proving Loop TerminationTennyson X. Chen, Martin D. Meyer. sede 2008: 194-197

Modular Termination of Basic NarrowingMaría Alpuente, Santiago Escobar, José Iborra. RTA 2008: 1-16 [doi]

Proving Termination of Rewrite Systems Using BoundsMartin Korp, Aart Middeldorp. RTA 2007: 273-287 [doi]

Semi-continuous Sized Types and TerminationAndreas Abel. csl 2006: 72-88 [doi]

Tyrolean Termination ToolNao Hirokawa, Aart Middeldorp. RTA 2005: 175-184 [doi]

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

Tsukuba Termination ToolNao Hirokawa, Aart Middeldorp. RTA 2003: 311-320 [doi]

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

Innermost Termination of Context-Sensitive RewritingJürgen Giesl, Aart Middeldorp. dlt 2003: 231-244 [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]

Simulation of Conflict in an Agent World: Access to Resources and Possibility of Termination of the PopulationJaak Tepandi. informaticaLT, 13(4):501-512, 2002. [doi]

Equational Termination by Semantic LabellingHitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl. csl 2000: 457-471 [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]

A Termination Detection Algorithm: Specification and VerificationRobert Eschbach. FM 1999: 1720-1737 [doi]

Termination of Permutative Conversions in Intuitionistic Gentzen CalculiHelmut Schwichtenberg. TCS, 212(1-2):247-260, 1999. [doi]

Computation calculus = sequential calculus + discreteness and terminationBurghard von Karger. RelMiCS 1998: 122-126

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

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

Task Dependence and Termination in AdaLaura K. Dillon. TOSEM, 6(1):80-110, 1997. [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.

Simple Termination DifficultAart Middeldorp, Bernhard Gramlich. aaecc, 6:115-128, 1995.

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

Some Undecidable Termination Problems for Semi-Thue SystemsGéraud Sénizergues. TCS, 142(2):257-276, 1995. [doi]

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

A New Characterisation of AC-Termination and ApplicationJean-Michel Gélis. ctrs 1995: 124-143

On Proving the Termination of Algorithms by MachineChristoph Walther. ai, 71(1):101-157, 1994.

Simple Termination is DifficultAart Middeldorp, Bernhard Gramlich. RTA 1993: 228-242

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

Delay and crosstalk simulation of high-speed VLSI interconnects with nonlinear terminationsDong H. Xie, Michel S. Nakhla. tcad, 12(11):1798-1811, 1993. [doi]

Distributed Termination EnforcementMartin Rudalics. parle 1992: 363-378

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation LengthsDieter Hofbauer. TCS, 105(1):129-140, 1992.

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

Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo AlgorithmsFriedemann Mattern. algorithmica, 5(3):325-340, 1990.

A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting SystemsAart Middeldorp. lics 1989: 396-401

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

Detecting Termination of Distributed Computations Using MarkersJayadev Misra. podc 1983: 290-294

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

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

On Achieving Distributed TerminationNissim Francez. scc 1979: 300-315

runs on WebDSL