The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Flemming Nielson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. René Rydhof Hansen, Christian W. Probst, Flemming Nielson
    Sandboxing in myKlaim. [Citation Graph (0, 0)][DBLP]
    ARES, 2006, pp:174-181 [Conf]
  2. Hanne Riis Nielson, Flemming Nielson
    Flow Logic: A Multi-paradigmatic Approach to Static Analysis. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:223-244 [Conf]
  3. Flemming Nielson, Hanne Riis Nielson
    Type and Effect Systems. [Citation Graph (0, 0)][DBLP]
    Correct System Design, 1999, pp:114-136 [Conf]
  4. Hanne Riis Nielson, Flemming Nielson
    Flow Logics for Constraint Based Analysis. [Citation Graph (0, 0)][DBLP]
    CC, 1998, pp:109-127 [Conf]
  5. Flemming Nielson, Hanne Riis Nielson
    Constraints for Polymorphic Behaviours of Concurrent ML. [Citation Graph (0, 0)][DBLP]
    CCL, 1994, pp:73-88 [Conf]
  6. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Control Flow Analysis for the pi-calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:84-98 [Conf]
  7. Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen, Jacob Grydholt Jensen
    Validating Firewalls in Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:463-477 [Conf]
  8. Flemming Nielson, Hanne Riis Nielson
    From CML to Process Algebras (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:493-508 [Conf]
  9. Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Automatic Validation of Protocol Narration. [Citation Graph (0, 0)][DBLP]
    CSFW, 2003, pp:126-140 [Conf]
  10. Flemming Nielson, Hanne Riis Nielson
    Multi-Level Lambda-Calculi: An Algebraic Description. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Partial Evaluation, 1996, pp:338-354 [Conf]
  11. Flemming Nielson
    Correctness of Code Generation from a Two-Level Meta-Language. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:30-40 [Conf]
  12. Hanne Riis Nielson, Flemming Nielson
    Pragmatic Aspects of Two-Level Denotational Meta-Languages. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:133-143 [Conf]
  13. Flemming Nielson, Hanne Riis Nielson
    2-level lambda-lifting. [Citation Graph (0, 0)][DBLP]
    ESOP, 1988, pp:328-343 [Conf]
  14. Hanne Riis Nielson, Flemming Nielson
    Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:291-305 [Conf]
  15. Flemming Nielson, Hanne Riis Nielson
    The Tensor Product in Wadler's Analysis of Lists. [Citation Graph (0, 0)][DBLP]
    ESOP, 1992, pp:351-370 [Conf]
  16. Flemming Nielson, Hanne Riis Nielson
    Interprocedural Control Flow Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 1999, pp:20-39 [Conf]
  17. Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
    A Kleene Analysis of Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:305-319 [Conf]
  18. Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
    Automatic Complexity Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 2002, pp:243-261 [Conf]
  19. Flemming Nielson, Helmut Seidl
    Control-Flow Analysis in Cubic Time. [Citation Graph (0, 0)][DBLP]
    ESOP, 2001, pp:252-268 [Conf]
  20. Hanne Riis Nielson, Torben Amtoft, Flemming Nielson
    Behaviour Analysis and Safety Conditions: A Case Study in CML. [Citation Graph (0, 0)][DBLP]
    FASE, 1998, pp:255-269 [Conf]
  21. Hanne Riis Nielson, Flemming Nielson, Mikael Buchholtz
    Security for Mobility. [Citation Graph (0, 0)][DBLP]
    FOSAD, 2002, pp:207-265 [Conf]
  22. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Static Analysis of Processes for No and Read-Up nad No Write-Down. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1999, pp:120-134 [Conf]
  23. Hanne Riis Nielson, Flemming Nielson
    Transformations on Higher-Order Functions. [Citation Graph (0, 0)][DBLP]
    FPCA, 1989, pp:129-143 [Conf]
  24. Alan Mycroft, Flemming Nielson
    Strong Abstract Interpretation Using Power Domains (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:536-547 [Conf]
  25. Kirsten Lackner Solberg Gasser, Flemming Nielson, Hanne Riis Nielson
    Systematic Realisation of Control Flow Analyses for CML. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:38-51 [Conf]
  26. Hanne Riis Nielson, Flemming Nielson
    Semantics Directed Compiling for Functional Languages. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1986, pp:249-257 [Conf]
  27. Hanne Riis Nielson, Flemming Nielson
    Context Information for Lazy Code Generation. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1990, pp:251-263 [Conf]
  28. Flemming Nielson, Hanne Riis Nielson
    Finiteness Conditions for Fixed Point Iteration. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1992, pp:96-108 [Conf]
  29. Torben Amtoft, Flemming Nielson, Hanne Riis Nielson, Jürgen Ammann
    Polymorphic Subtyping for Effect Analysis: The Dynamic Semantics. [Citation Graph (0, 0)][DBLP]
    LOMAPS, 1996, pp:172-206 [Conf]
  30. 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]
  31. Hanne Riis Nielson, Flemming Nielson, Torben Amtoft
    Polymorphic Subtyping for Effect Analysis: The Static Semantics. [Citation Graph (0, 0)][DBLP]
    LOMAPS, 1996, pp:141-171 [Conf]
  32. Flemming Nielson, Hanne Riis Nielson, Torben Amtoft
    Polymorphic Subtyping for Effect Analysis: The Algorithm. [Citation Graph (0, 0)][DBLP]
    LOMAPS, 1996, pp:207-243 [Conf]
  33. Flemming Nielson, Hanne Riis Nielson
    Flow Logic for Imperative Objects. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:220-228 [Conf]
  34. Chiara Bodei, Mikael Buchholtz, Michele Curti, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson, Corrado Priami
    On Evaluating the Performance of Security Protocols. [Citation Graph (0, 0)][DBLP]
    PaCT, 2005, pp:1-15 [Conf]
  35. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Static Analysis for Secrecy and Non-interference in Networks of Processes. [Citation Graph (0, 0)][DBLP]
    PaCT, 2001, pp:27-41 [Conf]
  36. Terkel K. Tolstrup, Flemming Nielson, Hanne Riis Nielson
    Information Flow Analysis for VHDL. [Citation Graph (0, 0)][DBLP]
    PaCT, 2005, pp:79-98 [Conf]
  37. Flemming Nielson
    The Typed lambda-Calculus with First-Class Processes. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1989, pp:357-373 [Conf]
  38. Flemming Nielson
    Expected forms of data flow analyses. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:172-191 [Conf]
  39. Flemming Nielson, Hanne Riis Nielson
    Code generation from two-level denotational meta-languages. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:192-205 [Conf]
  40. Flemming Nielson, Hanne Riis Nielson
    Prescriptive Frameworks for Multi-Level Lambda-Calculi. [Citation Graph (0, 0)][DBLP]
    PEPM, 1997, pp:193-202 [Conf]
  41. Flemming Nielson
    Strictness Analysis and Denotational Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    POPL, 1987, pp:120-131 [Conf]
  42. Hanne Riis Nielson, Flemming Nielson
    Shape Analysis for Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:142-154 [Conf]
  43. Hanne Riis Nielson, Flemming Nielson
    Automatic Binding Time Analysis for a Typed Lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:98-106 [Conf]
  44. Hanne Riis Nielson, Flemming Nielson
    Bounded Fixed Point Iteration. [Citation Graph (0, 0)][DBLP]
    POPL, 1992, pp:71-82 [Conf]
  45. Hanne Riis Nielson, Flemming Nielson
    Higher-Order Concurrent Programs with Finite Communication Topology. [Citation Graph (0, 0)][DBLP]
    POPL, 1994, pp:84-97 [Conf]
  46. Hanne Riis Nielson, Flemming Nielson
    Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 1997, pp:332-345 [Conf]
  47. Flemming Nielson, Hanne Riis Nielson
    Layered Predicates. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:425-456 [Conf]
  48. René Rydhof Hansen, Jacob Grydholt Jensen, Flemming Nielson, Hanne Riis Nielson
    Abstract Interpretation of Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:134-148 [Conf]
  49. Flemming Nielson
    Semantics-Directed Program Analysis: A Tool-Maker's Perspective. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:2-21 [Conf]
  50. Flemming Nielson, Hanne Riis Nielson
    Finiteness Conditions for Strictness Analysis. [Citation Graph (0, 0)][DBLP]
    WSA, 1993, pp:194-205 [Conf]
  51. Hanne Riis Nielson, Flemming Nielson, Henrik Pilegaard
    Spatial Analysis of BioAmbients. [Citation Graph (0, 0)][DBLP]
    SAS, 2004, pp:69-83 [Conf]
  52. Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
    Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:20-35 [Conf]
  53. Kirsten Lackner Solberg, Hanne Riis Nielson, Flemming Nielson
    Inference Systems for Binding Time Analysis. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:247-254 [Conf]
  54. Flemming Nielson
    Abstract Interpretation of Denotational Definions (A Survey). [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:1-20 [Conf]
  55. Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl
    The Succinct Solver Suite. [Citation Graph (0, 0)][DBLP]
    TACAS, 2004, pp:251-265 [Conf]
  56. Hanne Riis Nielson, Flemming Nielson
    Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:590-604 [Conf]
  57. Flemming Nielson
    A Denotational Framework for Data Flow Analysis. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:265-287 [Journal]
  58. Flemming Nielson
    Annotated Type and Effect Systems. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:2, pp:344-345 [Journal]
  59. Flemming Nielson
    Perspectives on Program Analysis. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:168- [Journal]
  60. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Security Analysis using Flow Logics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:70, n:, pp:112-130 [Journal]
  61. Chiara Bodei, Michele Curti, Pierpaolo Degano, Mikael Buchholtz, Flemming Nielson, Hanne Riis Nielson, Corrado Priami
    Performance Evaluation of Security Protocols Specified in LySa. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:112, n:, pp:167-189 [Journal]
  62. Mikael Buchholtz, Stephen T. Gilmore, Jane Hillston, Flemming Nielson
    Securing Statically-verified Communications Protocols Against Timing Attacks. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:4, pp:123-143 [Journal]
  63. Flemming Nielson, Hanne Riis Nielson
    Flow Logic and Operational Semantics. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal]
  64. Flemming Nielson, Hanne Riis Nielson, Helmut Seidl
    Cryptographic Analysis in Cubic Time. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:62, n:, pp:- [Journal]
  65. Christoffer Rosenkilde Nielsen, Flemming Nielson, Hanne Riis Nielson
    Cryptographic Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:168, n:, pp:91-107 [Journal]
  66. Flemming Nielson, Hanne Riis Nielson
    Heuristics for Safety and Security Constraints. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:523-543 [Journal]
  67. Henrik Pilegaard, Flemming Nielson, Hanne Riis Nielson
    Active Evaluation Contexts for Reaction Semantics. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:175, n:1, pp:57-70 [Journal]
  68. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Flow logic for Dolev-Yao secrecy in cryptographic processes. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2002, v:18, n:6, pp:747-756 [Journal]
  69. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Static Analysis for the pi-Calculus with Applications to Security. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:1, pp:68-92 [Journal]
  70. Flemming Nielson
    Strictness Analysis and Denotational Abstract Interpretation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:76, n:1, pp:29-92 [Journal]
  71. Mikael Buchholtz, Hanne Riis Nielson, Flemming Nielson
    A calculus for control flow analysis of security protocols. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2004, v:2, n:3-4, pp:145-167 [Journal]
  72. Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
    Kleene's Logic with Equality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:3, pp:131-137 [Journal]
  73. Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson
    Static validation of security protocols. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2005, v:13, n:3, pp:347-390 [Journal]
  74. Torben Amtoft, Flemming Nielson, Hanne Riis Nielson
    Type and Behaviour Reconstruction for Higher-Order Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1997, v:7, n:3, pp:321-347 [Journal]
  75. Hanne Riis Nielson, Flemming Nielson
    Using Transformations in the Implementations of Higher-Order Functions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1991, v:1, n:4, pp:459-494 [Journal]
  76. Hanne Riis Nielson, Flemming Nielson
    Bounded Fixed-Point Iteration. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:4, pp:441-464 [Journal]
  77. Hanne Riis Nielson, Flemming Nielson
    Shape Analysis for Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:2, pp:233-275 [Journal]
  78. Flemming Nielson, Hanne Riis Nielson
    Operational Semantics of Termination Types. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:2, pp:144-187 [Journal]
  79. Flemming Nielson, Helmut Seidl, Hanne Riis Nielson
    A Succinct Solver for ALFP. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:4, pp:335-372 [Journal]
  80. Kirsten Lackner Solberg Gasser, Hanne Riis Nielson, Flemming Nielson
    Strictness and Totality Analysis. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1998, v:31, n:1, pp:113-145 [Journal]
  81. Flemming Nielson, René Rydhof Hansen, Hanne Riis Nielson
    Abstract interpretation of mobile ambients. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2003, v:47, n:2-3, pp:145-175 [Journal]
  82. Hanne Riis Nielson, Flemming Nielson
    Automatic Binding Time Analysis for a Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1988, v:10, n:1, pp:139-176 [Journal]
  83. Flemming Nielson, Hanne Riis Nielson
    The Tensor Product in Wadler's Analysis of Lists. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1994, v:22, n:3, pp:327-354 [Journal]
  84. Flemming Nielson
    Perspectives on Program Analysis. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1997, v:32, n:1, pp:89-91 [Journal]
  85. Torben Amtoft, Hanne Riis Nielson, Flemming Nielson
    Behavior Analysis for Validating Communication Patterns. [Citation Graph (0, 0)][DBLP]
    STTT, 1998, v:2, n:1, pp:13-28 [Journal]
  86. Flemming Nielson
    Two-Level Semantics and Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:69, n:2, pp:117-242 [Journal]
  87. Flemming Nielson, Hanne Riis Nielson
    Two-Level Semantics and Code Generation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:59-133 [Journal]
  88. Hanne Riis Nielson, Flemming Nielson
    Functional Completeness of the Mixed lambda-Calculus and Combinatory Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:1, pp:99-126 [Journal]
  89. Flemming Nielson, Hanne Riis Nielson
    From CML to its Process Algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:155, n:1, pp:179-219 [Journal]
  90. Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen
    Validating firewalls using flow logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:283, n:2, pp:381-418 [Journal]
  91. Flemming Nielson
    Program Transformations in a Denotational Setting. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1985, v:7, n:3, pp:359-379 [Journal]
  92. Flemming Nielson, Hanne Riis Nielson
    Types from Control Flow Analysis. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:293-310 [Conf]
  93. Hanne Riis Nielson, Flemming Nielson
    Data Flow Analysis for CCS. [Citation Graph (0, 0)][DBLP]
    Program Analysis and Compilation, 2006, pp:311-327 [Conf]
  94. Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson
    Topology-Dependent Abstractions of Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:226-240 [Conf]
  95. Christian W. Probst, René Rydhof Hansen, Flemming Nielson
    Where Can an Insider Attack? [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2006, pp:127-142 [Conf]
  96. Terkel K. Tolstrup, Flemming Nielson, René Rydhof Hansen
    Locality-Based Security Policies. [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2006, pp:185-201 [Conf]
  97. Flemming Nielson, Hanne Riis Nielson, Corrado Priami, Debora Rosa
    Control Flow Analysis for BioAmbients. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:180, n:3, pp:65-79 [Journal]
  98. Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard
    What is a free name in a process algebra? [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:5, pp:188-194 [Journal]

  99. Static Validation of Licence Conformance Policies. [Citation Graph (, )][DBLP]


  100. Advice for Coordination. [Citation Graph (, )][DBLP]


  101. From Flow Logic to Static Type Systems for Coordination Languages. [Citation Graph (, )][DBLP]


  102. A flow-sensitive analysis of privacy properties. [Citation Graph (, )][DBLP]


  103. Advice from Belnap Policies. [Citation Graph (, )][DBLP]


  104. Context Dependent Analysis of BioAmbients. [Citation Graph (, )][DBLP]


  105. 06161 Working Groups' Report: The Challlenge of Combining Simulation and Verification. [Citation Graph (, )][DBLP]


  106. Static Analysis of a Model of the LDL Degradation Pathway. [Citation Graph (, )][DBLP]


  107. Iterative Specialisation of Horn Clauses. [Citation Graph (, )][DBLP]


  108. Model Checking Is Static Analysis of Modal Logic. [Citation Graph (, )][DBLP]


  109. From generic to specific: off-line optimization for a general constraint solver. [Citation Graph (, )][DBLP]


  110. A secure key establishment protocol for zigbee wireless sensor networks. [Citation Graph (, )][DBLP]


  111. A Scalable Inclusion Constraint Solver Using Unification. [Citation Graph (, )][DBLP]


  112. Modal Abstractions of Concurrent Behaviour. [Citation Graph (, )][DBLP]


  113. Relational Analysis of Correlation. [Citation Graph (, )][DBLP]


  114. Relational Analysis for Delivery of Services. [Citation Graph (, )][DBLP]


  115. A monotone framework for CCS. [Citation Graph (, )][DBLP]


Search in 2.693secs, Finished in 2.697secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002