"A Scalable Parallel Algorithm for Reachability Analysis of Very Large ..."

Tamir Heyman et al. (2002)

> Home

Details and statistics

DOI: 10.1023/A:1020373206491

access: closed

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/fmsd/HeymanGGS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fmsd/HeymanGGS02
Tamir Heyman, Daniel Geist, Orna Grumberg, Assaf Schuster:
A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits. Formal Methods Syst. Des. 21(3): 317-338 (2002)

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.