default search action
Mads Dam
Mads F. Dam
Person information
- affiliation: Swedish Institute of Computer Science, Stockholm, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j21]Anoud Alshnakat, Didrik Lundberg
, Roberto Guanciale, Mads Dam
HOL4P4: Mechanized Small-Step Semantics for P4. Proc. ACM Program. Lang. 8(OOPSLA1): 223-249 (2024) - 2023
- [c66]Ning Dong, Roberto Guanciale, Mads Dam, Andreas Lööw:
Formal Verification of Correctness and Information Flow Security for an In-Order Pipelined Processor. FMCAD 2023: 247-256 - [i5]Andreas Lindner, Roberto Guanciale, Mads Dam:
Proof-Producing Symbolic Execution for Binary Code Verification. CoRR abs/2304.08848 (2023) - 2022
- [c65]Roberto Guanciale, Christoph Baumann, Pablo Buiras, Mads Dam, Hamed Nemati
A Case Study in Information Flow Refinement for Low Level Systems. The Logic of Software. A Tasting Menu of Formal Methods 2022: 54-79 - [c64]Anoud Alshnakat, Didrik Lundberg, Roberto Guanciale, Mads Dam, Karl Palmskog:
HOL4P4: semantics for a verified data plane. EuroP4@CoNEXT 2022: 39-45 - [c63]Karl Palmskog
Foundations and Tools in HOL4 for Analysis of Microarchitectural Out-of-Order Execution. FMCAD 2022: 129-138 - 2021
- [c62]Christoph Baumann, Mads Dam, Roberto Guanciale, Hamed Nemati
On Compositional Information Flow Aware Refinement. CSF 2021: 1-16 - [c61]Ning Dong, Roberto Guanciale, Mads Dam:
Refinement-Based Verification of Device-to-Device Information Flow. FMCAD 2021: 123-132 - 2020
- [c60]Roberto Guanciale, Musard Balliu, Mads Dam:
InSpectre: Breaking and Fixing Microarchitectural Vulnerabilities by Formal Analysis. CCS 2020: 1853-1869 - [c59]Didrik Lundberg
Hoare-Style Logic for Unstructured Programs. SEFM 2020: 193-213
2010 – 2019
- 2019
- [j20]Christoph Baumann
On the verification of system-level information flow properties for virtualized execution platforms. J. Cryptogr. Eng. 9(3): 243-261 (2019) - [i4]Musard Balliu, Mads Dam, Roberto Guanciale:
InSpectre: Breaking and Fixing Microarchitectural Vulnerabilities by Formal Analysis. CoRR abs/1911.00868 (2019) - 2018
- [c58]Hamed Nemati
Formal Verification of Integrity-Preserving Countermeasures Against Cache Storage Side-Channels. POST 2018: 109-133 - 2017
- [c57]Christoph Baumann, Oliver Schwarz, Mads Dam:
Compositional Verification of Security Properties for Embedded Execution Platforms. PROOFS 2017: 1-16 - [e3]Valentin Goranko, Mads Dam:
26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden. LIPIcs 82, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-045-3 [contents] - 2016
- [j19]Roberto Guanciale
Provably secure memory isolation for Linux on ARM. J. Comput. Secur. 24(6): 793-837 (2016) - [c56]Oliver Schwarz, Mads Dam:
Automatic Derivation of Platform Noninterference Properties. SEFM 2016: 27-44 - [c55]Roberto Guanciale
Cache Storage Channels: Alias-Driven Attacks and Verified Countermeasures. IEEE Symposium on Security and Privacy 2016: 38-55 - 2015
- [j18]Mads Dam, Bart Jacobs
Security monitor inlining and certification for multithreaded Java. Math. Struct. Comput. Sci. 25(3): 528-565 (2015) - [j17]Mads Dam, Karl Palmskog:
Location-independent routing in process network overlays. Serv. Oriented Comput. Appl. 9(3-4): 285-309 (2015) - [c54]Hind Chfouka, Hamed Nemati
Trustworthy Prevention of Code Injection in Linux on Embedded Devices. ESORICS (1) 2015: 90-107 - [c53]Hamed Nemati
Trustworthy Virtualization of the ARMv7 Memory Subsystem. SOFSEM 2015: 578-589 - [c52]Hamed Nemati
Trustworthy Memory Isolation of Linux on Embedded Devices. TRUST 2015: 125-142 - [e2]Sonja Buchegger, Mads Dam:
Secure IT Systems, 20th Nordic Conference, NordSec 2015, Stockholm, Sweden, October 19-21, 2015, Proceedings. Lecture Notes in Computer Science 9417, Springer 2015, ISBN 978-3-319-26501-8 [contents] - 2014
- [c51]Musard Balliu, Mads Dam, Roberto Guanciale
Automating Information Flow Analysis of Low Level Code. CCS 2014: 1080-1091 - [c50]Oliver Schwarz, Mads Dam:
Formal Verification of Secure User Mode Device Execution with DMA. Haifa Verification Conference 2014: 236-251 - [c49]Mads Dam, Karl Palmskog:
Location Independent Routing in Process Network Overlays. PDP 2014: 715-724 - 2013
- [c48]Mads Dam, Karl Palmskog:
Efficient and fully abstract routing of futures in object network overlays. AGERE!@SPLASH 2013: 49-60 - [c47]Mads Dam, Roberto Guanciale
Machine code verification of a tiny ARM hypervisor. TrustED@CCS 2013: 3-12 - [c46]Mads Dam, Roberto Guanciale
Formal verification of information flow security for a simple arm-based separation kernel. CCS 2013: 223-234 - [c45]Narges Khakpour
Machine Assisted Proof of ARMv7 Instruction Level Isolation Properties. CPP 2013: 276-291 - [c44]Karl Palmskog, Mads Dam, Andreas Lundblad, Ali Jafari:
ABS-NET: Fully Decentralized Runtime Adaptation for Distributed Objects. ICE 2013: 85-100 - 2012
- [c43]Mads Dam, Gurvan Le Guernic
TreeDroid: a tree automaton based approach to enforcing data processing policies. CCS 2012: 894-905 - [c42]Musard Balliu, Mads Dam, Gurvan Le Guernic
ENCoVer: Symbolic Exploration for Information Flow Security. CSF 2012: 30-44 - [i3]Musard Balliu, Mads Dam, Gurvan Le Guernic:
Epistemic Temporal Logic for Information Flow Security. CoRR abs/1208.6106 (2012) - 2011
- [c41]Musard Balliu, Mads Dam, Gurvan Le Guernic:
Epistemic temporal logic for information flow security. PLAS 2011: 6 - [c40]Dimitar P. Guelev, Mads Dam:
An Epistemic Predicate CTL* for Finite Control π-Processes. M4M/LAMAS 2011: 229-243 - 2010
- [j16]Mads Dam, Bart Jacobs
Provably correct inline monitoring for multithreaded Java-like programs. J. Comput. Secur. 18(1): 37-59 (2010) - [j15]Fetahi Wuhib, Mads Dam, Rolf Stadler:
A gossiping protocol for detecting global threshold crossings. IEEE Trans. Netw. Serv. Manag. 7(1): 42-57 (2010) - [c39]Kristján Valur Jónsson, Mads F. Dam:
Towards Flexible and Secure Distributed Aggregation. AIMS 2010: 159-162 - [c38]Gunnar Kreitz, Mads Dam, Douglas Wikström:
Practical Private Information Aggregation in Large Networks. NordSec 2010: 89-103 - [c37]Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Zebenigus Wuhib:
Brief announcement: the accuracy of tree-based counting in dynamic networks. PODC 2010: 291-292 - [p2]Danny Raz, Rolf Stadler, Constantine Elster, Mads Dam:
In-Network Monitoring. Algorithms for Next Generation Networks 2010: 287-317 - [i2]Supriya Krishnamurthy, John Ardelius, Erik Aurell, Mads Dam, Rolf Stadler, Fetahi Wuhib:
The Accuracy of Tree-based Counting in Dynamic Networks. CoRR abs/1004.4559 (2010) - [i1]Mads Dam, Andreas Lundblad:
A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode. CoRR abs/1012.2995 (2010)
2000 – 2009
- 2009
- [j14]Irem Aktug, Mads Dam, Dilian Gurov
Provably correct runtime monitoring. J. Log. Algebraic Methods Program. 78(5): 304-339 (2009) - [j13]Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm:
Robust monitoring of network-wide aggregates through gossiping. IEEE Trans. Netw. Serv. Manag. 6(2): 95-109 (2009) - [c36]Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco Russo:
Abstraction in model checking multi-agent systems. AAMAS (2) 2009: 945-952 - [c35]Mika Cohen, Mads Dam, Alessio Lomuscio
A Data Symmetry Reduction Technique for Temporal-epistemic Logic. ATVA 2009: 69-83 - [c34]Mads Dam, Bart Jacobs
Security Monitor Inlining for Multithreaded Java. ECOOP 2009: 546-569 - [c33]Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu:
A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic. IJCAI 2009: 721-726 - [c32]Fetahi Wuhib, Rolf Stadler, Mads Dam:
Gossiping for threshold detection. Integrated Network Management 2009: 259-266 - 2008
- [j12]Fetahi Wuhib, Mads Dam, Rolf Stadler:
Decentralized detection of global threshold crossings using aggregation trees. Comput. Networks 52(9): 1745-1761 (2008) - [c31]Irem Aktug, Mads Dam, Dilian Gurov
Provably Correct Runtime Monitoring. FM 2008: 262-277 - [c30]Rolf Stadler, Mads Dam, Alberto Gonzalez Prieto, Fetahi Wuhib:
Decentralized real-time monitoring of network-wide aggregates. LADIS 2008: 7:1-7:6 - 2007
- [c29]Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm:
Robust Monitoring of Network-wide Aggregates through Gossiping. Integrated Network Management 2007: 226-235 - [c28]Mika Cohen, Mads Dam:
A Complete Axiomatization of Knowledge and Cryptography. LICS 2007: 77-88 - 2006
- [c27]Mads Dam:
Decidability and proof systems for language-based noninterference relations. POPL 2006: 67-78 - 2005
- [c26]Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm:
Decentralized Computation of Threshold Crossing Alerts. DSOM 2005: 220-232 - 2004
- [j11]Pablo Giambiagi, Mads Dam:
On the secure implementation of security protocols. Sci. Comput. Program. 50(1-3): 73-99 (2004) - 2003
- [j10]Christoph Sprenger
On global induction mechanisms in a µ-calculus with explicit approximations. RAIRO Theor. Informatics Appl. 37(4): 365-391 (2003) - [j9]Lars-Åke Fredlund
A verification tool for ERLANG. Int. J. Softw. Tools Technol. Transf. 4(4): 405-420 (2003) - [c25]Pablo Giambiagi, Mads Dam:
On the Secure Implementation of Security Protocols. ESOP 2003: 144-158 - [c24]Christoph Sprenger
On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus. FoSSaCS 2003: 425-440 - [c23]Mads Dam:
Regular SPKI. Security Protocols Workshop 2003: 134-150 - [c22]Mads Dam:
Regular SPKI (Discussion). Security Protocols Workshop 2003: 151-152 - [c21]Mads Dam, Lars-Åke Fredlund
Formal Methods Research at SICS and KTH: An Overview. FMICS 2003: 267-272 - [p1]Mads Dam:
Proof Systems for π-Calculus Logics. Logic for Concurrency and Synchronisation 2003: 145-212 - 2002
- [j8]Mads Dam, Dilian Gurov
µ-Calculus with Explicit Points and Approximations. J. Log. Comput. 12(2): 255-269 (2002) - [c20]Christoph Sprenger, Mads Dam:
A note on global induction in a mu-calculus with explicit approximations. FICS 2002: 22-24 - [c19]Olav L. Bandmann, Babak Sadighi Firozabadi, Mads Dam:
Constrained Delegation. S&P 2002: 131-140 - 2000
- [c18]Mads Dam, Pablo Giambiagi:
Confidentiality for Mobile Code: The Case of a Simple Payment Protocol. CSFW 2000: 233-244
1990 – 1999
- 1999
- [c17]Mads Dam, Dilian Gurov
Compositional Verification of CCS Processes. Ershov Memorial Conference 1999: 247-256 - [c16]Thomas Arts, Mads Dam:
Verifying a Distributed Database Lookup Manager Written in Erlang. World Congress on Formal Methods 1999: 682-700 - 1998
- [j7]Mads Dam:
Proving Properties of Dynamic Process Networks. Inf. Comput. 140(2): 95-114 (1998) - [c15]Thomas Arts, Mads Dam, Lars-Åke Fredlund, Dilian Gurov
System Description: Verification of Distributed Erlang Programs. CADE 1998: 38-41 - [c14]José-Luis Vivas, Mads Dam:
From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators. CONCUR 1998: 115-130 - [c13]Mads Dam:
Proving Trust in Systems of 2nd-Order Processes: Preliminary Results. HICSS (7) 1998: 255-264 - [c12]Mads Dam, Lars-Åke Fredlund
On the verification of open distributed systems. SAC 1998: 532-540 - 1997
- [j6]Mads Dam:
On the Decidability of Process Equivalences for the pi-Calculus. Theor. Comput. Sci. 183(2): 215-228 (1997) - [c11]Mads Dam, Lars-Åke Fredlund, Dilian Gurov
Toward Parametric Verification of Open Distributed Systems. COMPOS 1997: 150-185 - [e1]Mads Dam:
Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, Stockholm, Sweden, June 24-26, 1996, Selected Papers. Lecture Notes in Computer Science 1192, Springer 1997, ISBN 3-540-62503-8 [contents] - 1996
- [j5]Mads Dam:
Modalities in Analysis and Verification. ACM Comput. Surv. 28(2): 346-348 (1996) - [j4]Mads Dam:
Model Checking Mobile Processes. Inf. Comput. 129(1): 35-51 (1996) - [c10]Roberto M. Amadio, Mads Dam:
Toward a Modal Theory of Types for the pi-Calculus. FTRTFT 1996: 347-365 - [c9]Flemming Nielson, Patrick Cousot, Mads Dam, Pierpaolo Degano, Pierre Jouvelot, Alan Mycroft
Logical and Operational Methods in the Analysis of Programs and Systems. LOMAPS 1996: 1-21 - 1995
- [c8]Mads Dam:
On the Decidability of Process Equivalences for the pi-calculus. AMAST 1995: 169-183 - [c7]Mads Dam:
Compositional Proof Systems for Model Checking Infinite State Processes. CONCUR 1995: 12-26 - [c6]Roberto M. Amadio, Mads Dam:
Reasoning about Higher-Order Processes. TAPSOFT 1995: 202-216 - 1994
- [j3]Mads Dam:
Process-Algebraic Interpretations of Positive Linear and Relevant Logics. J. Log. Comput. 4(6): 939-973 (1994) - [j2]Mads Dam:
CTL* and ECTL* as Fragments of the Modal mu-Calculus. Theor. Comput. Sci. 126(1): 77-96 (1994) - 1993
- [c5]Mads Dam:
Model Checking Mobile Processes. CONCUR 1993: 22-36 - 1992
- [j1]Mads Dam:
R-Generability, and Definability in Branching Time Logics. Inf. Process. Lett. 41(5): 281-287 (1992) - [c4]Mads Dam:
CTL* and ECTL* as Fragments of the Modal µ-Calculus. CAAP 1992: 145-164 - [c3]Mads Dam:
Fixed Points of Büchi Automata. FSTTCS 1992: 39-50
1980 – 1989
- 1988
- [c2]Mads Dam:
Relevance Logic and Concurrent Composition. LICS 1988: 178-185 - 1986
- [c1]Mads Dam, Frank Jensen:
Compiler Generation from Relational Semantics. ESOP 1986: 1-29
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: