"Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions."

Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-34175-6_19

access: closed

type: Conference or Workshop Paper

metadata version: 2019-11-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aplas/TatsutaNK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aplas/TatsutaNK19
Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura:
Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions. APLAS 2019: 367-387

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.