"Termination Analysis by Dependency Pairs and Inductive Theorem Proving."

Stephan Swiderski et al. (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-02959-2_25

access: closed

type: Conference or Workshop Paper

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cade/SwiderskiPGFS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cade/SwiderskiPGFS09
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp:
Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338

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.