The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Mads Dam: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mads Dam
    On the Decidability of Process Equivalences for the pi-calculus. [Citation Graph (0, 0)][DBLP]
    AMAST, 1995, pp:169-183 [Conf]
  2. Mads Dam
    CTL* and ECTL* as Fragments of the Modal µ-Calculus. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:145-164 [Conf]
  3. Thomas Arts, Mads Dam, Lars-Åke Fredlund, Dilian Gurov
    System Description: Verification of Distributed Erlang Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:38-41 [Conf]
  4. Mads Dam, Lars-Åke Fredlund, Dilian Gurov
    Toward Parametric Verification of Open Distributed Systems. [Citation Graph (0, 0)][DBLP]
    COMPOS, 1997, pp:150-185 [Conf]
  5. Mads Dam
    Model Checking Mobile Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:22-36 [Conf]
  6. Mads Dam
    Compositional Proof Systems for Model Checking Infinite State Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:12-26 [Conf]
  7. José-Luis Vivas, Mads Dam
    From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:115-130 [Conf]
  8. Mads Dam, Pablo Giambiagi
    Confidentiality for Mobile Code: The Case of a Simple Payment Protocol. [Citation Graph (0, 0)][DBLP]
    CSFW, 2000, pp:233-244 [Conf]
  9. Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm
    Decentralized Computation of Threshold Crossing Alerts. [Citation Graph (0, 0)][DBLP]
    DSOM, 2005, pp:220-232 [Conf]
  10. Mads Dam, Dilian Gurov
    Compositional Verification of CCS Processes. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1999, pp:247-256 [Conf]
  11. Pablo Giambiagi, Mads Dam
    On the Secure Implementation of Security Protocols. [Citation Graph (0, 0)][DBLP]
    ESOP, 2003, pp:144-158 [Conf]
  12. Mads Dam, Frank Jensen
    Compiler Generation from Relational Semantics. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:1-29 [Conf]
  13. Christoph Sprenger, Mads Dam
    A note on global induction in a mu-calculus with explicit approximations. [Citation Graph (0, 0)][DBLP]
    FICS, 2002, pp:22-24 [Conf]
  14. Thomas Arts, Mads Dam
    Verifying a Distributed Database Lookup Manager Written in Erlang. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:682-700 [Conf]
  15. Christoph Sprenger, Mads Dam
    On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:425-440 [Conf]
  16. Mads Dam
    Fixed Points of Büchi Automata. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:39-50 [Conf]
  17. Roberto M. Amadio, Mads Dam
    Toward a Modal Theory of Types for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1996, pp:347-365 [Conf]
  18. Mads Dam
    Relevance Logic and Concurrent Composition [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:178-185 [Conf]
  19. 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. [Citation Graph (0, 0)][DBLP]
    LOMAPS, 1996, pp:1-21 [Conf]
  20. Mads Dam
    Decidability and proof systems for language-based noninterference relations. [Citation Graph (0, 0)][DBLP]
    POPL, 2006, pp:67-78 [Conf]
  21. Mads Dam, Lars-Åke Fredlund
    On the verification of open distributed systems. [Citation Graph (0, 0)][DBLP]
    SAC, 1998, pp:532-540 [Conf]
  22. Olav L. Bandmann, Babak Sadighi Firozabadi, Mads Dam
    Constrained Delegation. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2002, pp:131-0 [Conf]
  23. Mads Dam
    Regular SPKI. [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 2003, pp:134-150 [Conf]
  24. Mads Dam
    Regular SPKI (Discussion). [Citation Graph (0, 0)][DBLP]
    Security Protocols Workshop, 2003, pp:151-152 [Conf]
  25. Roberto M. Amadio, Mads Dam
    Reasoning about Higher-Order Processes. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:202-216 [Conf]
  26. Mads Dam
    Modalities in Analysis and Verification. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:2, pp:346-348 [Journal]
  27. Mads Dam, Lars-Åke Fredlund, Dillian Guruv
    Formal Methods Research at SICS and KTH: An Overview. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:80, n:, pp:- [Journal]
  28. Mads Dam
    Model Checking Mobile Processes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:129, n:1, pp:35-51 [Journal]
  29. Mads Dam
    Proving Properties of Dynamic Process Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:2, pp:95-114 [Journal]
  30. Mads Dam
    R-Generability, and Definability in Branching Time Logics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:5, pp:281-287 [Journal]
  31. Christoph Sprenger, Mads Dam
    On global induction mechanisms in a µ-calculus with explicit approximations. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:4, pp:365-391 [Journal]
  32. Mads Dam, Dilian Gurov
    µ-Calculus with Explicit Points and Approximations. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:2, pp:255-269 [Journal]
  33. Mads Dam
    Process-Algebraic Interpretations of Positive Linear and Relevant Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1994, v:4, n:6, pp:939-973 [Journal]
  34. Pablo Giambiagi, Mads Dam
    On the secure implementation of security protocols. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2004, v:50, n:1-3, pp:73-99 [Journal]
  35. Lars-Åke Fredlund, Dilian Gurov, Thomas Noll, Mads Dam, Thomas Arts, Gennady Chugunov
    A verification tool for ERLANG. [Citation Graph (0, 0)][DBLP]
    STTT, 2003, v:4, n:4, pp:405-420 [Journal]
  36. Mads Dam
    CTL* and ECTL* as Fragments of the Modal mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:126, n:1, pp:77-96 [Journal]
  37. Mads Dam
    On the Decidability of Process Equivalences for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:183, n:2, pp:215-228 [Journal]
  38. Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Clemm
    Robust Monitoring of Network-wide Aggregates through Gossiping. [Citation Graph (0, 0)][DBLP]
    Integrated Network Management, 2007, pp:226-235 [Conf]
  39. Mika Cohen, Mads Dam
    A Complete Axiomatization of Knowledge and Cryptography. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:77-88 [Conf]

  40. Abstraction in model checking multi-agent systems. [Citation Graph (, )][DBLP]


  41. A Data Symmetry Reduction Technique for Temporal-epistemic Logic. [Citation Graph (, )][DBLP]


  42. Security Monitor Inlining for Multithreaded Java. [Citation Graph (, )][DBLP]


  43. Provably Correct Runtime Monitoring. [Citation Graph (, )][DBLP]


  44. A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic. [Citation Graph (, )][DBLP]


  45. Gossiping for threshold detection. [Citation Graph (, )][DBLP]


  46. Brief announcement: the accuracy of tree-based counting in dynamic networks. [Citation Graph (, )][DBLP]


  47. Decentralized detection of global threshold crossings using aggregation trees. [Citation Graph (, )][DBLP]


  48. The Accuracy of Tree-based Counting in Dynamic Networks [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.156secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002