Mads Dam

Orcid: 0000-0001-5432-6442

Affiliations:
  • Swedish Institute of Computer Science, Stockholm, Sweden


According to our database1, Mads Dam authored at least 85 papers between 1986 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Proof-Producing Symbolic Execution for Binary Code Verification.
CoRR, 2023

Formal Verification of Correctness and Information Flow Security for an In-Order Pipelined Processor.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

2022
Foundations and Tools in HOL4 for Analysis of Microarchitectural Out-of-Order Execution.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

HOL4P4: semantics for a verified data plane.
Proceedings of the 5th International Workshop on P4 in Europe, 2022

A Case Study in Information Flow Refinement for Low Level Systems.
Proceedings of the Logic of Software. A Tasting Menu of Formal Methods, 2022

2021
Refinement-Based Verification of Device-to-Device Information Flow.
Proceedings of the Formal Methods in Computer Aided Design, 2021

On Compositional Information Flow Aware Refinement.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Hoare-Style Logic for Unstructured Programs.
Proceedings of the Software Engineering and Formal Methods - 18th International Conference, 2020

InSpectre: Breaking and Fixing Microarchitectural Vulnerabilities by Formal Analysis.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
On the verification of system-level information flow properties for virtualized execution platforms.
J. Cryptogr. Eng., 2019

2018
Formal Verification of Integrity-Preserving Countermeasures Against Cache Storage Side-Channels.
Proceedings of the Principles of Security and Trust - 7th International Conference, 2018

2017
Compositional Verification of Security Properties for Embedded Execution Platforms.
Proceedings of the PROOFS 2017, 2017

2016
Provably secure memory isolation for Linux on ARM.
J. Comput. Secur., 2016

Cache Storage Channels: Alias-Driven Attacks and Verified Countermeasures.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Automatic Derivation of Platform Noninterference Properties.
Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

2015
Location-independent routing in process network overlays.
Serv. Oriented Comput. Appl., 2015

Security monitor inlining and certification for multithreaded Java.
Math. Struct. Comput. Sci., 2015

Trustworthy Memory Isolation of Linux on Embedded Devices.
Proceedings of the Trust and Trustworthy Computing - 8th International Conference, 2015

Trustworthy Virtualization of the ARMv7 Memory Subsystem.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Trustworthy Prevention of Code Injection in Linux on Embedded Devices.
Proceedings of the Computer Security - ESORICS 2015, 2015

2014
Formal Verification of Secure User Mode Device Execution with DMA.
Proceedings of the Hardware and Software: Verification and Testing, 2014

Automating Information Flow Analysis of Low Level Code.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013
ABS-NET: Fully Decentralized Runtime Adaptation for Distributed Objects.
Proceedings of the Proceedings 6th Interaction and Concurrency Experience, 2013

Machine Assisted Proof of ARMv7 Instruction Level Isolation Properties.
Proceedings of the Certified Programs and Proofs - Third International Conference, 2013

Machine code verification of a tiny ARM hypervisor.
Proceedings of the TrustED'13, 2013

Formal verification of information flow security for a simple arm-based separation kernel.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Efficient and fully abstract routing of futures in object network overlays.
Proceedings of the 2013 Workshop on Programming based on Actors, 2013

2012
ENCoVer: Symbolic Exploration for Information Flow Security.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

TreeDroid: a tree automaton based approach to enforcing data processing policies.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
An Epistemic Predicate CTL<sup>*</sup> for Finite Control π-Processes.
Proceedings of the 7th Workshop on Methods for Modalities, 2011

Epistemic temporal logic for information flow security.
Proceedings of the 2011 Workshop on Programming Languages and Analysis for Security, 2011

2010
In-Network Monitoring.
Proceedings of the Algorithms for Next Generation Networks, 2010

A gossiping protocol for detecting global threshold crossings.
IEEE Trans. Netw. Serv. Manag., 2010

Provably correct inline monitoring for multithreaded Java-like programs.
J. Comput. Secur., 2010

A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode
CoRR, 2010

The Accuracy of Tree-based Counting in Dynamic Networks
CoRR, 2010

Brief announcement: the accuracy of tree-based counting in dynamic networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Practical Private Information Aggregation in Large Networks.
Proceedings of the Information Security Technology for Applications, 2010

Towards Flexible and Secure Distributed Aggregation.
Proceedings of the Mechanisms for Autonomous Management of Networks and Services, 2010

2009
Robust monitoring of network-wide aggregates through gossiping.
IEEE Trans. Netw. Serv. Manag., 2009

Provably correct runtime monitoring.
J. Log. Algebraic Methods Program., 2009

Gossiping for threshold detection.
Proceedings of the Integrated Network Management, 2009

A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic.
Proceedings of the IJCAI 2009, 2009

Security Monitor Inlining for Multithreaded Java.
Proceedings of the ECOOP 2009, 2009

A Data Symmetry Reduction Technique for Temporal-epistemic Logic.
Proceedings of the Automated Technology for Verification and Analysis, 2009

Abstraction in model checking multi-agent systems.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Decentralized detection of global threshold crossings using aggregation trees.
Comput. Networks, 2008

Decentralized real-time monitoring of network-wide aggregates.
Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware, 2008

2007
A Complete Axiomatization of Knowledge and Cryptography.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
Decidability and proof systems for language-based noninterference relations.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

2005
Decentralized Computation of Threshold Crossing Alerts.
Proceedings of the Ambient Networks, 2005

2004
On the secure implementation of security protocols.
Sci. Comput. Program., 2004

2003
A verification tool for ERLANG.
Int. J. Softw. Tools Technol. Transf., 2003

On global induction mechanisms in a µ-calculus with explicit approximations.
RAIRO Theor. Informatics Appl., 2003

Formal Methods Research at SICS and KTH: An Overview.
Proceedings of the Eighth International Workshop on Formal Methods for Industrial Critical Systems, 2003

Regular SPKI (Discussion).
Proceedings of the Security Protocols, 2003

Regular SPKI.
Proceedings of the Security Protocols, 2003

On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

Proof Systems for π-Calculus Logics.
Proceedings of the Logic for Concurrency and Synchronisation, 2003

2002
µ-Calculus with Explicit Points and Approximations.
J. Log. Comput., 2002

Constrained Delegation.
Proceedings of the 2002 IEEE Symposium on Security and Privacy, 2002

A note on global induction in a mu-calculus with explicit approximations.
Proceedings of the Fixed Points in Computer Science, 2002

2000
Confidentiality for Mobile Code: The Case of a Simple Payment Protocol.
Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000

1999
Verifying a Distributed Database Lookup Manager Written in Erlang.
Proceedings of the FM'99 - Formal Methods, 1999

Compositional Verification of CCS Processes.
Proceedings of the Perspectives of System Informatics, 1999

1998
Proving Properties of Dynamic Process Networks.
Inf. Comput., 1998

On the verification of open distributed systems.
Proceedings of the 1998 ACM symposium on Applied Computing, 1998

Proving Trust in Systems of 2nd-Order Processes: Preliminary Results.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

System Description: Verification of Distributed Erlang Programs.
Proceedings of the Automated Deduction, 1998

1997
On the Decidability of Process Equivalences for the pi-Calculus.
Theor. Comput. Sci., 1997

Toward Parametric Verification of Open Distributed Systems.
Proceedings of the Compositionality: The Significant Difference, International Symposium, 1997

1996
Model Checking Mobile Processes.
Inf. Comput., 1996

Modalities in Analysis and Verification.
ACM Comput. Surv., 1996

Logical and Operational Methods in the Analysis of Programs and Systems.
Proceedings of the Analysis and Verification of Multiple-Agent Languages, 1996

Toward a Modal Theory of Types for the pi-Calculus.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

1995
Reasoning about Higher-Order Processes.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Compositional Proof Systems for Model Checking Infinite State Processes.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
CTL* and ECTL* as Fragments of the Modal mu-Calculus.
Theor. Comput. Sci., 1994

Process-Algebraic Interpretations of Positive Linear and Relevant Logics.
J. Log. Comput., 1994

1992
R-Generability, and Definability in Branching Time Logics.
Inf. Process. Lett., 1992

Fixed Points of Büchi Automata.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

CTL* and ECTL* as Fragments of the Modal µ-Calculus.
Proceedings of the CAAP '92, 1992

1988
Relevance Logic and Concurrent Composition
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1986
Compiler Generation from Relational Semantics.
Proceedings of the ESOP 86, 1986


  Loading...