BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Brazil
1 × Portugal
1 × Serbia
2 × Australia
2 × Austria
2 × Canada
2 × Poland
2 × United Kingdom
3 × France
3 × The Netherlands
4 × Germany
4 × Japan
4 × Spain
6 × Italy
6 × USA
Collaborated with:
N.Hirokawa S.Winkler H.Zankl J.Giesl M.Korp B.Felgenhauer F.Neurauter H.Zantema T.Ida J.Nagele I.Durand T.Sternagel T.Suzuki C.Sternagel H.Ohsaki S.Okui H.Sato M.Kurihara A.Koprowski M.Marin A.Geser E.Ohlebusch S.Antoy B.Gramlich E.Hamoen Y.Toyama F.Rapp C.Kohl G.Moser C.Kop C.Fuhs P.Schneider-Kamp R.Thiemann K.Nakahara A.Yamada T.Yamada J.Avenhaus C.Loría-Sáenz
Talks about:
termin (20) rewrit (14) complet (11) system (9) tool (8) condit (7) term (7) revisit (6) narrow (6) depend (6)

Person: Aart Middeldorp

DBLP DBLP: Middeldorp:Aart

Facilitated 3 volumes:

CADE 2015Ed
RTA 2001Ed
FLOPS 1999Ed

Contributed to:

RTA 20152015
FLOPS 20142014
RTA-TLCA 20142014
RTA 20132013
CADE 20112011
RTA 20112011
IJCAR 20102010
RTA 20102010
CADE 20092009
RTA 20092009
IJCAR 20082008
LATA 20082008
RTA 20082008
CADE 20072007
RTA 20072007
SAT 20072007
RTA 20062006
RTA 20052005
PPDP 20042004
RTA 20042004
CADE 20032003
RTA 20032003
DLT 20022002
FLOPS 20012001
FoSSaCS 20012001
IJCAR 20012001
CADE 20002000
CSL 20002000
CSL 19991999
RTA 19991999
CADE 19971997
POPL 19971997
CADE 19961996
CSL 19961996
PPDP 19951995
RTA 19951995
ALP 19941994
CADE 19941994
RTA 19931993
ALP 19921992
RTA 19911991
LICS 19891989
RTA 19891989
TAPSOFT CAAP/FASE 19951995
TAPSOFT 19951996
TAPSOFT CAAP/FASE 19971997
CADE 20172017
IJCAR 20182018
CADE 20192019

Wrote 61 papers:

RTA-2015-HirokawaMM #revisited
Leftmost Outermost Revisited (NH, AM, GM), pp. 209–222.
RTA-2015-KopMS #complexity
Conditional Complexity (CK, AM, TS), pp. 223–240.
RTA-2015-NageleFM #analysis #automation #confluence #term rewriting
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules (JN, BF, AM), pp. 257–268.
FLOPS-2014-YamadaWHM #revisited
AC-KBO Revisited (AY, SW, NH, AM), pp. 319–335.
RTA-TLCA-2014-SternagelM #confluence
Conditional Confluence (TS, AM), pp. 456–465.
RTA-2013-WinklerM #normalisation #revisited
Normalized Completion Revisited (SW, AM), pp. 319–334.
RTA-2013-WinklerZM #automation #proving #sequence #termination
Beyond Peano Arithmetic — Automatically Proving Termination of the Goodstein Sequence (SW, HZ, AM), pp. 335–351.
CADE-2011-WinklerM #termination #tool support
AC Completion with Termination Tools (SW, AM), pp. 492–498.
CADE-2011-ZanklFM #confluence #named
CSI — A Confluence Tool (HZ, BF, AM), pp. 499–505.
RTA-2011-NeurauterM #matrix #proving #term rewriting #termination
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting (FN, AM), pp. 251–266.
RTA-2011-ZanklFM #diagrams
Labelings for Decreasing Diagrams (HZ, BF, AM), pp. 377–392.
IJCAR-2010-HirokawaM #diagrams #termination
Decreasing Diagrams and Relative Termination (NH, AM), pp. 487–501.
IJCAR-2010-NeurauterMZ #polynomial
Monotonicity Criteria for Polynomial Interpretations over the Naturals (FN, AM, HZ), pp. 502–517.
IJCAR-2010-WinklerM #order #termination #tool support
Termination Tools in Ordered Completion (SW, AM), pp. 518–532.
RTA-2010-NeurauterM #integer #polynomial
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers (FN, AM), pp. 243–258.
RTA-2010-WinklerSMK #optimisation
Optimizing mkbTT (SW, HS, AM, MK), pp. 373–384.
CADE-2009-KorpM #dependence #graph
Beyond Dependency Graphs (MK, AM), pp. 339–354.
RTA-2009-KorpSZM #termination
Tyrolean Termination Tool 2 (MK, CS, HZ, AM), pp. 295–304.
IJCAR-2008-SatoWKM #multi #termination #tool support
Multi-completion with Termination Tools (HS, SW, MK, AM), pp. 306–312.
LATA-2008-KorpM #bound #dependence #proving #term rewriting #termination
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (MK, AM), pp. 321–332.
RTA-2008-FuhsGMSTZ #termination
Maximal Termination (CF, JG, AM, PSK, RT, HZ), pp. 110–125.
RTA-2008-SternagelM
Root-Labeling (CS, AM), pp. 336–350.
CADE-2007-KoprowskiM #dependence #predict #satisfiability #using
Predictive Labeling with Dependency Pairs Using SAT (AK, AM), pp. 410–425.
RTA-2007-KorpM #bound #proving #term rewriting #termination #using
Proving Termination of Rewrite Systems Using Bounds (MK, AM), pp. 273–287.
RTA-2007-ZanklM #constraints
Satisfying KBO Constraints (HZ, AM), pp. 389–403.
SAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination
SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.
RTA-2006-HirokawaM #predict
Predictive Labeling (NH, AM), pp. 313–327.
RTA-2005-HirokawaM #termination
Tyrolean Termination Tool (NH, AM), pp. 175–184.
PPDP-2004-MarinM #lazy evaluation
New completeness results for lazy conditional narrowing (MM, AM), pp. 120–131.
RTA-2004-HirokawaM #dependence #revisited
Dependency Pairs Revisited (NH, AM), pp. 249–268.
CADE-2003-HirokawaM #automation #dependence
Automating the Dependency Pair Method (NH, AM), pp. 32–46.
RTA-2003-HirokawaM #termination
Tsukuba Termination Tool (NH, AM), pp. 311–320.
DLT-2002-GieslM #termination
Innermost Termination of Context-Sensitive Rewriting (JG, AM), pp. 231–244.
FLOPS-2001-SuzukiM #lazy evaluation
A Complete Selection Function for Lazy Conditional Narrowing (TS, AM), pp. 201–215.
FoSSaCS-2001-DurandM #call-by #composition #on the
On the Modularity of Deciding Call-by-Need (ID, AM), pp. 199–213.
IJCAR-2001-Middeldorp #approximate #automaton #dependence #graph #using
Approximating Dependency Graphs Using Tree Automata Techniques (AM), pp. 593–610.
CADE-2000-GieslM
Eliminating Dummy Elimination (JG, AM), pp. 309–323.
CSL-2000-OhsakiMG #equation #semantics #termination
Equational Termination by Semantic Labelling (HO, AM, JG), pp. 457–471.
CSL-1999-Middeldorp #term rewriting
Term Rewriting (AM), p. 577.
RTA-1999-GieslM #term rewriting
Transforming Context-Sensitive Rewrite Systems (JG, AM), pp. 271–287.
CADE-1997-DurandM #call-by #decidability #term rewriting
Decidable Call by Need Computations in term Rewriting (ID, AM), pp. 4–18.
POPL-1997-Middeldorp #call-by
Call by Need Computations to Root-Stable Form (AM), pp. 94–105.
CADE-1996-MiddeldorpOZ #self #termination
Transforming Termination by Self-Labelling (AM, HO, HZ), pp. 373–387.
CSL-1996-GeserMOZ #term rewriting
Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.
PLILP-1995-NakaharaMI #calculus #functional #higher-order #logic programming
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming (KN, AM, TI), pp. 97–114.
RTA-1995-SuzukiMI #term rewriting
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides (TS, AM, TI), pp. 179–193.
ALP-1994-AntoyM #reduction
A Sequential Reduction Strategy (SA, AM), pp. 168–185.
CADE-1994-MiddeldorpZ #revisited #termination
Simple Termination Revisited (AM, HZ), pp. 451–465.
RTA-1993-MiddeldorpG #termination
Simple Termination is Difficult (AM, BG), pp. 228–242.
ALP-1992-MiddeldorpH
Counterexamples to Completeness Results for Basic Narrowing (AM, EH), pp. 244–258.
RTA-1991-MiddeldorpT
Completeness of Combinations of Constructor Systems (AM, YT), pp. 188–199.
LICS-1989-Middeldorp #term rewriting #termination
A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.
RTA-1989-Middeldorp #aspect-oriented #composition #normalisation #term rewriting
Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms (AM), pp. 263–277.
TAPSOFT-1995-OkuiMI #lazy evaluation
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract) (SO, AM, TI), pp. 394–408.
TAPSOFT-J-1995-MiddeldorpOI96 #lazy evaluation
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (AM, SO, TI), pp. 95–130.
TAPSOFT-1997-GeserMOZ #termination
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules (AG, AM, EO, HZ), pp. 237–248.
TAPSOFT-1997-YamadaALM #term rewriting
Logicality of Conditional Rewrite Systems (TY, JA, CLS, AM), pp. 141–152.
CADE-2017-NageleFM #named
CSI: New Evidence - A Progress Report (JN, BF, AM), pp. 385–397.
IJCAR-2018-HirokawaNM #confluence #framework #tool support
Cops and CoCoWeb: Infrastructure for Confluence Tools (NH, JN, AM), pp. 346–353.
IJCAR-2018-RappM
FORT 2.0 (FR, AM), pp. 81–88.
CADE-2019-KohlM #proving
Composing Proof Terms (CK, AM), pp. 337–353.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.