![]() | ![]() |
| 2011 | ||
|---|---|---|
| 56 | Dimitar P. Guelev, Mads Dam: An Epistemic Predicate CTL* for Finite Control π-Processes. Electr. Notes Theor. Comput. Sci. 278: 229-243 (2011) | |
| 2010 | ||
| 55 | Gunnar Kreitz, Mads Dam, Douglas Wikström: Practical Private Information Aggregation in Large Networks. NordSec 2010: 89-103 | |
| 54 | 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 | |
| 53 | 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) | |
| 52 | Mads Dam, Andreas Lundblad: A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode CoRR abs/1012.2995: (2010) | |
| 51 | Fetahi Wuhib, Mads Dam, Rolf Stadler: A gossiping protocol for detecting global threshold crossings. IEEE Transactions on Network and Service Management 7(1): 42-57 (2010) | |
| 50 | Mads Dam, Bart Jacobs, Andreas Lundblad, Frank Piessens: Provably correct inline monitoring for multithreaded Java-like programs. Journal of Computer Security 18(1): 37-59 (2010) | |
| 2009 | ||
| 49 | Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco Russo: Abstraction in model checking multi-agent systems. AAMAS (2) 2009: 945-952 | |
| 48 | Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu: A Data Symmetry Reduction Technique for Temporal-epistemic Logic. ATVA 2009: 69-83 | |
| 47 | Mads Dam, Bart Jacobs, Andreas Lundblad, Frank Piessens: Security Monitor Inlining for Multithreaded Java. ECOOP 2009: 546-569 | |
| 46 | Mika Cohen, Mads Dam, Alessio Lomuscio, Hongyang Qu: A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic. IJCAI 2009: 721-726 | |
| 45 | Fetahi Wuhib, Rolf Stadler, Mads Dam: Gossiping for threshold detection. Integrated Network Management 2009: 259-266 | |
| 44 | Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm: Robust monitoring of network-wide aggregates through gossiping. IEEE Transactions on Network and Service Management 6(2): 95-109 (2009) | |
| 43 | Irem Aktug, Mads Dam, Dilian Gurov: Provably correct runtime monitoring. J. Log. Algebr. Program. 78(5): 304-339 (2009) | |
| 2008 | ||
| 42 | Irem Aktug, Mads Dam, Dilian Gurov: Provably Correct Runtime Monitoring. FM 2008: 262-277 | |
| 41 | Fetahi Wuhib, Mads Dam, Rolf Stadler: Decentralized detection of global threshold crossings using aggregation trees. Computer Networks 52(9): 1745-1761 (2008) | |
| 2007 | ||
| 40 | Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm: Robust Monitoring of Network-wide Aggregates through Gossiping. Integrated Network Management 2007: 226-235 | |
| 39 | Mika Cohen, Mads Dam: A Complete Axiomatization of Knowledge and Cryptography. LICS 2007: 77-88 | |
| 2006 | ||
| 38 | Mads Dam: Decidability and proof systems for language-based noninterference relations. POPL 2006: 67-78 | |
| 2005 | ||
| 37 | Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm: Decentralized Computation of Threshold Crossing Alerts. DSOM 2005: 220-232 | |
| 2004 | ||
| 36 | Pablo Giambiagi, Mads Dam: On the secure implementation of security protocols. Sci. Comput. Program. 50(1-3): 73-99 (2004) | |
| 2003 | ||
| 35 | Pablo Giambiagi, Mads Dam: On the Secure Implementation of Security Protocols. ESOP 2003: 144-158 | |
| 34 | Christoph Sprenger, Mads Dam: On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus. FoSSaCS 2003: 425-440 | |
| 33 | Mads Dam: Regular SPKI. Security Protocols Workshop 2003: 134-150 | |
| 32 | Mads Dam: Regular SPKI (Discussion). Security Protocols Workshop 2003: 151-152 | |
| 31 | Mads Dam, Lars-Åke Fredlund, Dillian Guruv: Formal Methods Research at SICS and KTH: An Overview. Electr. Notes Theor. Comput. Sci. 80: 267-272 (2003) | |
| 30 | Christoph Sprenger, Mads Dam: On global induction mechanisms in a µ-calculus with explicit approximations. ITA 37(4): 365-391 (2003) | |
| 29 | Lars-Åke Fredlund, Dilian Gurov, Thomas Noll, Mads Dam, Thomas Arts, Gennady Chugunov: A verification tool for ERLANG. STTT 4(4): 405-420 (2003) | |
| 2002 | ||
| 28 | Christoph Sprenger, Mads Dam: A note on global induction in a mu-calculus with explicit approximations. FICS 2002: 22-24 | |
| 27 | Olav L. Bandmann, Babak Sadighi Firozabadi, Mads Dam: Constrained Delegation. IEEE Symposium on Security and Privacy 2002: 131- | |
| 26 | Mads Dam, Dilian Gurov: µ-Calculus with Explicit Points and Approximations. J. Log. Comput. 12(2): 255-269 (2002) | |
| 2000 | ||
| 25 | Mads Dam, Pablo Giambiagi: Confidentiality for Mobile Code: The Case of a Simple Payment Protocol. CSFW 2000: 233-244 | |
| 1999 | ||
| 24 | Mads Dam, Dilian Gurov: Compositional Verification of CCS Processes. Ershov Memorial Conference 1999: 247-256 | |
| 23 | Thomas Arts, Mads Dam: Verifying a Distributed Database Lookup Manager Written in Erlang. World Congress on Formal Methods 1999: 682-700 | |
| 1998 | ||
| 22 | Thomas Arts, Mads Dam, Lars-Åke Fredlund, Dilian Gurov: System Description: Verification of Distributed Erlang Programs. CADE 1998: 38-41 | |
| 21 | José-Luis Vivas, Mads Dam: From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators. CONCUR 1998: 115-130 | |
| 20 | Mads Dam, Lars-Åke Fredlund: On the verification of open distributed systems. SAC 1998: 532-540 | |
| 19 | Mads Dam: Proving Properties of Dynamic Process Networks. Inf. Comput. 140(2): 95-114 (1998) | |
| 1997 | ||
| 18 | Mads Dam: Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, Stockholm, Sweden, June 24-26, 1996, Selected Papers Springer 1997 | |
| 17 | Mads Dam, Lars-Åke Fredlund, Dilian Gurov: Toward Parametric Verification of Open Distributed Systems. COMPOS 1997: 150-185 | |
| 16 | Mads Dam: On the Decidability of Process Equivalences for the pi-Calculus. Theor. Comput. Sci. 183(2): 215-228 (1997) | |
| 1996 | ||
| 15 | Roberto M. Amadio, Mads Dam: Toward a Modal Theory of Types for the pi-Calculus. FTRTFT 1996: 347-365 | |
| 14 | Flemming Nielson, Patrick Cousot, Mads Dam, Pierpaolo Degano, Pierre Jouvelot, Alan Mycroft, Bent Thomsen: Logical and Operational Methods in the Analysis of Programs and Systems. LOMAPS 1996: 1-21 | |
| 13 | Mads Dam: Modalities in Analysis and Verification. ACM Comput. Surv. 28(2): 346-348 (1996) | |
| 12 | Mads Dam: Model Checking Mobile Processes. Inf. Comput. 129(1): 35-51 (1996) | |
| 1995 | ||
| 11 | Mads Dam: On the Decidability of Process Equivalences for the pi-calculus. AMAST 1995: 169-183 | |
| 10 | Mads Dam: Compositional Proof Systems for Model Checking Infinite State Processes. CONCUR 1995: 12-26 | |
| 9 | Roberto M. Amadio, Mads Dam: Reasoning about Higher-Order Processes. TAPSOFT 1995: 202-216 | |
| 1994 | ||
| 8 | Mads Dam: Process-Algebraic Interpretations of Positive Linear and Relevant Logics. J. Log. Comput. 4(6): 939-973 (1994) | |
| 7 | Mads Dam: CTL* and ECTL* as Fragments of the Modal mu-Calculus. Theor. Comput. Sci. 126(1): 77-96 (1994) | |
| 1993 | ||
| 6 | Mads Dam: Model Checking Mobile Processes. CONCUR 1993: 22-36 | |
| 1992 | ||
| 5 | Mads Dam: CTL* and ECTL* as Fragments of the Modal µ-Calculus. CAAP 1992: 145-164 | |
| 4 | Mads Dam: Fixed Points of Büchi Automata. FSTTCS 1992: 39-50 | |
| 3 | Mads Dam: R-Generability, and Definability in Branching Time Logics. Inf. Process. Lett. 41(5): 281-287 (1992) | |
| 1988 | ||
| 2 | Mads Dam: Relevance Logic and Concurrent Composition LICS 1988: 178-185 | |
| 1986 | ||
| 1 | Mads Dam, Frank Jensen: Compiler Generation from Relational Semantics. ESOP 1986: 1-29 | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page