"On the Complexity of Dataflow Analysis of Logic Programs."

Saumya K. Debray (1995)

> Home

Details and statistics

DOI: 10.1145/201059.201068

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toplas/Debray95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toplas/Debray95
Saumya K. Debray:
On the Complexity of Dataflow Analysis of Logic Programs. ACM Trans. Program. Lang. Syst. 17(2): 331-365 (1995)

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.