Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Mads Dam

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 Gurvan Le Guernic

> Home > Persons > Mads Dam

Publications

2012
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/ccs/DamGL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccs/DamGL12
Mads Dam, Gurvan Le Guernic, Andreas Lundblad:
TreeDroid: a tree automaton based approach to enforcing data processing policies. CCS 2012: 894-905
[c42]
- view
  authority control:
- export record
  dblp key:
  - conf/csfw/BalliuDG12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csfw/BalliuDG12
Musard Balliu, Mads Dam, Gurvan Le Guernic:
ENCoVer: Symbolic Exploration for Information Flow Security. CSF 2012: 30-44
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1208-6106
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1208-6106
Musard Balliu, Mads Dam, Gurvan Le Guernic:
Epistemic Temporal Logic for Information Flow Security. CoRR abs/1208.6106 (2012)
2011
[c41]
- view
  authority control:
- export record
  dblp key:
  - conf/pldi/BalliuDG11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pldi/BalliuDG11
Musard Balliu, Mads Dam, Gurvan Le Guernic:
Epistemic temporal logic for information flow security. PLAS 2011: 6

a service of

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.