"Formalizing non-termination of recursive programs."

Reinhard Kahle, Thomas Studer (2001)

> Home

Details and statistics

DOI: 10.1016/S1567-8326(01)00006-6

access: open

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jlp/KahleS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlp/KahleS01
Reinhard Kahle, Thomas Studer:
Formalizing non-termination of recursive programs. J. Log. Algebraic Methods Program. 49(1-2): 1-14 (2001)

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.