Lenore D. Zuck

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ariel Cohen 0002

> Home > Persons > Lenore D. Zuck

Publications

2010
[c50]
- view
  authority control:
- export record
  dblp key:
  - conf/hvc/CohenNSZK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hvc/CohenNSZK10
Ariel Cohen, Kedar S. Namjoshi, Yaniv Sa'ar, Lenore D. Zuck, Katya I. Kisyova:
Parallelizing a Symbolic Compositional Model-Checking Algorithm. Haifa Verification Conference 2010: 46-59
2008
[c48]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/cav/CohenPZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cav/CohenPZ08
Ariel Cohen, Amir Pnueli, Lenore D. Zuck:
Mechanical Verification of Transactional Memories with Non-transactional Memory Accesses. CAV 2008: 121-134
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/ifip1-7/CohenMZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip1-7/CohenMZ08
Ariel Cohen, Ron van der Meyden, Lenore D. Zuck:
Access Control and Information Flow in Transactional Memory. Formal Aspects in Security and Trust 2008: 316-330
2007
[c45]
- view
  authority control:
- export record
  dblp key:
  - conf/fmcad/0002OPTZ07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fmcad/0002OPTZ07
Ariel Cohen, John W. O'Leary, Amir Pnueli, Mark R. Tuttle, Lenore D. Zuck:
Verifying Correctness of Transactional Memories. FMCAD 2007: 37-44

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.