"Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems."

Martin Korp, Aart Middeldorp (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-88282-4_30

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lata/KorpM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lata/KorpM08
Martin Korp, Aart Middeldorp:
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems. LATA 2008: 321-332

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.