"Proving Termination Using Recursive Path Orders and SAT Solving."

Peter Schneider-Kamp et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-74621-8_18

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/frocos/Schneider-KampTACG07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/frocos/Schneider-KampTACG07
Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl:
Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282

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.