"Ensuring completeness of symbolic verification methods for infinite-state ..."

Parosh Aziz Abdulla, Bengt Jonsson (2001)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(00)00105-5

access: open

type: Journal Article

metadata version: 2021-08-31

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/AbdullaJ01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AbdullaJ01
Parosh Aziz Abdulla, Bengt Jonsson:
Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1-2): 145-167 (2001)

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.