"Complexity and Algorithms for Monomial and Clausal Predicate Abstraction."

Shuvendu K. Lahiri, Shaz Qadeer (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-02959-2_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cade/LahiriQ09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cade/LahiriQ09
Shuvendu K. Lahiri, Shaz Qadeer:
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction. CADE 2009: 214-229

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.