Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Polyhedron over-approximation for complexity reduction in static analysis."

Yassamine Seladji, Zheng Qu (2018)

> Home

Details and statistics

DOI: 10.1080/23799927.2018.1535525

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcmcst/SeladjiQ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcmcst/SeladjiQ18
Yassamine Seladji, Zheng Qu:
Polyhedron over-approximation for complexity reduction in static analysis. Int. J. Comput. Math. Comput. Syst. Theory 3(4): 215-229 (2018)

a service of

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.