"Distilling critical attack graph surface iteratively through minimum-cost ..."

Heqing Huang et al. (2011)

> Home

Details and statistics

DOI: 10.1145/2076732.2076738

access: closed

type: Conference or Workshop Paper

metadata version: 2021-05-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/acsac/HuangZOPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acsac/HuangZOPS11
Heqing Huang, Su Zhang, Xinming Ou, Atul Prakash, Karem A. Sakallah:
Distilling critical attack graph surface iteratively through minimum-cost SAT solving. ACSAC 2011: 31-40

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.