default search action

combined dblp search
author search
venue search
publication search

ask others

6th SecCO@CONCUR 2008: Toronto, ON, Canada

> Home > Conferences and Workshops > SecCO
> Home > Conferences and Workshops > CONCUR

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
  - electronic edition @ sciencedirect.com
  - details & citations
- export record
  dblp key:
  - conf/secco/2008
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/secco/2008
Steve Kremer, Prakash Panangaden:
Proceedings of the 6th Workshop on Security Issues in Concurrency, SecCo@CONCUR 2008, Toronto, ON, Canada, August 23, 2008. Electronic Notes in Theoretical Computer Science 242(3), Elsevier 2009
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/KremerP09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/KremerP09
Steve Kremer, Prakash Panangaden:
Preface. 1-2
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/Borgstrom09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/Borgstrom09
Johannes Borgström:
A Complete Symbolic Bisimilarity for an Extended Spi Calculus. 3-20
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/entcs/GordonHH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entcs/GordonHH09
Andrew D. Gordon, Hans Hüttel, René Rydhof Hansen:
Type Inference for Correspondence Types. 21-36

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.