Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Flemming Nielson
2010 – today
- 2013
[c102]Hanne Riis Nielson, Flemming Nielson: Probabilistic Analysis of the Quality Calculus. FMOODS/FORTE 2013: 258-272- [c101]Roberto Vigo, Flemming Nielson, Hanne Riis Nielson: Broadcast, Denial-of-Service, and Secure Communication. IFM 2013: 412-427
- [c100]Sebastian Mödersheim, Flemming Nielson, Hanne Riis Nielson: Lazy Mobile Intruders. POST 2013: 147-166
- [i10]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson: Design-Efficiency in Security. CoRR abs/1302.1111 (2013)
- 2012
- [j49]Hanne Riis Nielson, Flemming Nielson, Henrik Pilegaard: Flow Logic for Process Calculi. ACM Comput. Surv. 44(1): 3 (2012)
- [j48]Nataliya Skrypnyuk, Flemming Nielson, Henrik Pilegaard: Static Analysis of IMC. J. Log. Algebr. Program. 81(4): 522-540 (2012)
- [c99]Michal Terepeta, Hanne Riis Nielson, Flemming Nielson: Recursive Advice for Coordination. COORDINATION 2012: 137-151
- [c98]
- [c97]Fuyuan Zhang, Flemming Nielson, Hanne Riis Nielson: Model Checking as Static Analysis: Revisited. IFM 2012: 99-112
- [c96]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson: Key Update Assistant for resource-constrained networks. ISCC 2012: 75-81
- [c95]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson, Bo Friis Nielsen: LBTool: A stochastic toolkit for leave-based key updates. ISCC 2012: 868-875
- [c94]Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming Nielson: XACML 3.0 in Answer Set Programming. LOPSTR 2012: 89-105
- [c93]David N. Jansen, Flemming Nielson, Lijun Zhang: Belief Bisimulation for Hidden Markov Models - Logical Characterisation and Decision Algorithm. NASA Formal Methods 2012: 326-340
- [c92]
- [c91]Ender Yüksel, Huibiao Zhu, Hanne Riis Nielson, Heqing Huang, Flemming Nielson: Modelling and Analysis of Smart Grid: A Stochastic Model Checking Case Study. TASE 2012: 25-32
- [i9]Fan Yang, Chris Hankin, Flemming Nielson, Hanne Riis Nielson: Secondary use of data in EHR systems. CoRR abs/1201.4262 (2012)
- [i8]Piotr Filipiuk, Flemming Nielson, Hanne Riis Nielson: Layered Fixed Point Logic. CoRR abs/1204.2768 (2012)
- [i7]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson, Huibiao Zhu, Heqing Huang: Modelling Chinese Smart Grid: A Stochastic Model Checking Case Study. CoRR abs/1205.6664 (2012)
- [i6]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson, Matthias Fruth, Marta Z. Kwiatkowska: Optimizing ZigBee Security using Stochastic Model Checking. CoRR abs/1205.6675 (2012)
- [i5]Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming Nielson: XACML 3.0 in Answer Set Programming. CoRR abs/1206.5327 (2012)
- [i4]Piotr Filipiuk, Flemming Nielson, Hanne Riis Nielson: Lattice based Least Fixed Point Logic. CoRR abs/1207.5384 (2012)
- [i3]Bo Friis Nielsen, Flemming Nielson, Henrik Pilegaard, Michael James Andrew Smith, Ender Yüksel, Kebin Zeng, Lijun Zhang: Roadmap Document on Stochastic Analysis. CoRR abs/1209.6578 (2012)
- 2011
- [j47]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson: A Secure Key Establishment Protocol for ZigBee Wireless Sensor Networks. Comput. J. 54(4): 589-601 (2011)
- [j46]Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns: Automata-Based CSL Model Checking. Logical Methods in Computer Science 8(2) (2011)
- [j45]Alejandro Mario Hernandez, Flemming Nielson, Hanne Riis Nielson: Designing, Capturing and Validating History-Sensitive Security Policies for Distributed Systems. Sci. Ann. Comp. Sci. 21(1): 107-149 (2011)
- [j44]Han Gao, Flemming Nielson, Hanne Riis Nielson: CaPiTo: protocol stacks for services. Formal Asp. Comput. 23(4): 541-565 (2011)
- [j43]Flemming Nielson, Sebastian Nanz, Hanne Riis Nielson: Modal abstractions of concurrent behavior. ACM Trans. Comput. Log. 12(3): 18 (2011)
- [p2]Han Gao, Flemming Nielson, Hanne Riis Nielson: Analysing Protocol Stacks for Services. Results of the SENSORIA Project 2011: 369-389
- [c90]Hanne Riis Nielson, Flemming Nielson, Jörg Kreiker, Henrik Pilegaard: From Explicit to Symbolic Types for Communication Protocols in CCS. Formal Modeling: Actors, Open Systems, Biological Systems 2011: 74-89
- [c89]Fan Yang, Tomoyuki Aotani, Hidehiko Masuhara, Flemming Nielson, Hanne Riis Nielson: Combining Static Analysis and Runtime Checking in Security Aspects for Distributed Tuple Spaces. COORDINATION 2011: 202-218
- [c88]Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming Nielson: The Logic of XACML. FACS 2011: 205-222
- [c87]Piotr Filipiuk, Michal Terepeta, Hanne Riis Nielson, Flemming Nielson: Galois Connections for Flow Algebras. FMOODS/FORTE 2011: 138-152
- [c86]Lijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns: Automata-Based CSL Model Checking. ICALP (2) 2011: 271-282
- [c85]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson: Resilience analysis of key update strategies for resource-constrained networks. ICUMT 2011: 1-8
- [c84]Michael J. A. Smith, Flemming Nielson, Hanne Riis Nielson: Controlling Modelling Artifacts. QEST 2011: 171-180
- [c83]Nataliya Skrypnyuk, Flemming Nielson: Reachability for Finite-State Process Algebras Using Static Analysis. RP 2011: 231-244
- [c82]
- [i2]Carroline Dewi Puspa Kencana Ramli, Hanne Riis Nielson, Flemming Nielson: The Logic of XACML - Extended. CoRR abs/1110.3706 (2011)
- 2010
- [j42]Piotr Filipiuk, Hanne Riis Nielson, Flemming Nielson: Explicit Versus Symbolic Algorithms for Solving ALFP Constraints. Electr. Notes Theor. Comput. Sci. 267(2): 15-28 (2010)
- [j41]Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson: Static analysis of topology-dependent broadcast networks. Inf. Comput. 208(2): 117-139 (2010)
- [j40]Rocco De Nicola, Daniele Gorla, René Rydhof Hansen, Flemming Nielson, Hanne Riis Nielson, Christian W. Probst, Rosario Pugliese: From Flow Logic to static type systems for coordination languages. Sci. Comput. Program. 75(6): 376-397 (2010)
- [c81]Flemming Nielson, Hanne Riis Nielson: Model Checking Is Static Analysis of Modal Logic. FOSSACS 2010: 191-205
- [c80]Flemming Nielson, Han Gao, Hanne Riis Nielson: The CaPiTo Approach to Protocol Validation - (Invited Talk). ARSPA-WITS 2010: 1
- [c79]Bo Friis Nielsen, Flemming Nielson, Hanne Riis Nielson: Model Checking Multivariate State Rewards. QEST 2010: 7-16
- [c78]Chris Hankin, Flemming Nielson, Hanne Riis Nielson: Probabilistic Aspects: Checking Security in an Imperfect World. TGC 2010: 348-363
- [c77]Alejandro Mario Hernandez, Flemming Nielson: History-sensitive versus future-sensitive approaches to security in distributed systems. ICE 2010: 29-43
2000 – 2009
- 2009
- [j39]Hanne Riis Nielson, Flemming Nielson: A monotone framework for CCS. Computer Languages, Systems & Structures 35(4): 365-394 (2009)
- [c76]
- [c75]Ender Yüksel, Hanne Riis Nielson, Flemming Nielson: A secure key establishment protocol for zigbee wireless sensor networks. ISCIS 2009: 340-345
- [e1]Christos Kaklamanis, Flemming Nielson (Eds.): Trustworthy Global Computing, 4th International Symposium, TGC 2008, Barcelona, Spain, November 3-4, 2008, Revised Selected Papers. Lecture Notes in Computer Science 5474, Springer 2009, ISBN 978-3-642-00944-0
- 2008
- [j38]Henrik Pilegaard, Flemming Nielson, Hanne Riis Nielson: Pathway analysis for BioAmbients. J. Log. Algebr. Program. 77(1-2): 92-130 (2008)
- [c74]René Rydhof Hansen, Flemming Nielson, Hanne Riis Nielson, Christian W. Probst: Static Validation of Licence Conformance Policies. ARES 2008: 1104-1111
- [c73]Rocco De Nicola, Daniele Gorla, René Rydhof Hansen, Flemming Nielson, Hanne Riis Nielson, Christian W. Probst, Rosario Pugliese: From Flow Logic to Static Type Systems for Coordination Languages. COORDINATION 2008: 100-116
- [c72]Chris Hankin, Flemming Nielson, Hanne Riis Nielson, Fan Yang: Advice for Coordination. COORDINATION 2008: 153-168
- [c71]Christoffer Rosenkilde Nielsen, Flemming Nielson, Hanne Riis Nielson: Iterative Specialisation of Horn Clauses. ESOP 2008: 131-145
- [c70]Ye Zhang, Torben Amtoft, Flemming Nielson: From generic to specific: off-line optimization for a general constraint solver. GPCE 2008: 45-54
- [c69]Jörg Bauer, Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard: Relational Analysis of Correlation. SAS 2008: 32-46
- [c68]Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson: Modal Abstractions of Concurrent Behaviour. SAS 2008: 159-173
- 2007
- [j37]Christoffer Rosenkilde Nielsen, Flemming Nielson, Hanne Riis Nielson: Cryptographic Pattern Matching. Electr. Notes Theor. Comput. Sci. 168: 91-107 (2007)
- [j36]Flemming Nielson, Hanne Riis Nielson: Heuristics for Safety and Security Constraints. Electr. Notes Theor. Comput. Sci. 172: 523-543 (2007)
- [j35]Henrik Pilegaard, Flemming Nielson, Hanne Riis Nielson: Active Evaluation Contexts for Reaction Semantics. Electr. Notes Theor. Comput. Sci. 175(1): 57-70 (2007)
- [j34]Flemming Nielson, Hanne Riis Nielson, Corrado Priami, Debora Rosa: Control Flow Analysis for BioAmbients. Electr. Notes Theor. Comput. Sci. 180(3): 65-79 (2007)
- [j33]Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard: What is a free name in a process algebra? Inf. Process. Lett. 103(5): 188-194 (2007)
- [c67]Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson: Topology-Dependent Abstractions of Broadcast Networks. CONCUR 2007: 226-240
- [c66]Hanne Riis Nielson, Flemming Nielson: A flow-sensitive analysis of privacy properties. CSF 2007: 249-264
- [c65]Ye Zhang, Flemming Nielson: A Scalable Inclusion Constraint Solver Using Unification. LOPSTR 2007: 121-137
- [c64]Flemming Nielson, Hanne Riis Nielson, Jörg Bauer, Christoffer Rosenkilde Nielsen, Henrik Pilegaard: Relational Analysis for Delivery of Services. TGC 2007: 73-89
- 2006
- [c63]René Rydhof Hansen, Christian W. Probst, Flemming Nielson: Sandboxing in myKlaim. ARES 2006: 174-181
- [c62]Flemming Nielson, Hanne Riis Nielson: Types from Control Flow Analysis. Program Analysis and Compilation 2006: 293-310
- [c61]Hanne Riis Nielson, Flemming Nielson: Data Flow Analysis for CCS. Program Analysis and Compilation 2006: 311-327
- [c60]Grégory Batt, Jeremy T. Bradley, Roland Ewald, François Fages, Holger Hermanns, Jane Hillston, Peter Kemper, Alke Martens, Pieter J. Mosterman, Flemming Nielson, Oleg Sokolsky, Adelinde M. Uhrmacher: 06161 Working Groups' Report: The Challlenge of Combining Simulation and Verification. Simulation and Verification of Dynamic Systems 2006
- [c59]Henrik Pilegaard, Hanne Riis Nielson, Flemming Nielson: Static Analysis of a Model of the LDL Degradation Pathway. Simulation and Verification of Dynamic Systems 2006
- [c58]Henrik Pilegaard, Hanne Riis Nielson, Flemming Nielson: Context Dependent Analysis of BioAmbients. Simulation and Verification of Dynamic Systems 2006
- [c57]Christian W. Probst, René Rydhof Hansen, Flemming Nielson: Where Can an Insider Attack? Formal Aspects in Security and Trust 2006: 127-142
- [c56]Terkel K. Tolstrup, Flemming Nielson, René Rydhof Hansen: Locality-Based Security Policies. Formal Aspects in Security and Trust 2006: 185-201
- 2005
- [b4]Flemming Nielson, Hanne Riis Nielson, Chris Hankin: Principles of program analysis (2. corr. print). Springer 2005, ISBN 978-3-540-65410-0, pp. I-XXI, 1-452
- [j32]Chiara Bodei, Michele Curti, Pierpaolo Degano, Mikael Buchholtz, Flemming Nielson, Hanne Riis Nielson, Corrado Priami: Performance Evaluation of Security Protocols Specified in LySa. Electr. Notes Theor. Comput. Sci. 112: 167-189 (2005)
- [j31]Mikael Buchholtz, Stephen T. Gilmore, Jane Hillston, Flemming Nielson: Securing Statically-verified Communications Protocols Against Timing Attacks. Electr. Notes Theor. Comput. Sci. 128(4): 123-143 (2005)
- [j30]Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Static validation of security protocols. Journal of Computer Security 13(3): 347-390 (2005)
- [c55]Chiara Bodei, Mikael Buchholtz, Michele Curti, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson, Corrado Priami: On Evaluating the Performance of Security Protocols. PaCT 2005: 1-15
- [c54]Terkel K. Tolstrup, Flemming Nielson, Hanne Riis Nielson: Information Flow Analysis for VHDL. PaCT 2005: 79-98
- 2004
- [j29]Mikael Buchholtz, Hanne Riis Nielson, Flemming Nielson: A calculus for control flow analysis of security protocols. Int. J. Inf. Sec. 2(3-4): 145-167 (2004)
- [c53]Hanne Riis Nielson, Flemming Nielson, Henrik Pilegaard: Spatial Analysis of BioAmbients. SAS 2004: 69-83
- [c52]Flemming Nielson, Hanne Riis Nielson, Hongyan Sun, Mikael Buchholtz, René Rydhof Hansen, Henrik Pilegaard, Helmut Seidl: The Succinct Solver Suite. TACAS 2004: 251-265
- 2003
- [j28]Flemming Nielson, René Rydhof Hansen, Hanne Riis Nielson: Abstract interpretation of mobile ambients. Sci. Comput. Program. 47(2-3): 145-175 (2003)
- [c51]Chiara Bodei, Mikael Buchholtz, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Automatic Validation of Protocol Narration. CSFW 2003: 126-140
- 2002
- [j27]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Flow logic for Dolev-Yao secrecy in cryptographic processes. Future Generation Comp. Syst. 18(6): 747-756 (2002)
- [j26]Flemming Nielson, Helmut Seidl, Hanne Riis Nielson: A Succinct Solver for ALFP. Nord. J. Comput. 9(4): 335-372 (2002)
- [j25]Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen: Validating firewalls using flow logics. Theor. Comput. Sci. 283(2): 381-418 (2002)
- [c50]Hanne Riis Nielson, Flemming Nielson: Flow Logic: A Multi-paradigmatic Approach to Static Analysis. The Essence of Computation 2002: 223-244
- [c49]Flemming Nielson, Hanne Riis Nielson, Helmut Seidl: Automatic Complexity Analysis. ESOP 2002: 243-261
- [c48]
- [c47]Flemming Nielson, Hanne Riis Nielson, Helmut Seidl: Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. SAS 2002: 20-35
- 2001
- [j24]Flemming Nielson, Hanne Riis Nielson, Helmut Seidl: Cryptographic Analysis in Cubic Time. Electr. Notes Theor. Comput. Sci. 62: 7-23 (2001)
- [j23]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Static Analysis for the pi-Calculus with Applications to Security. Inf. Comput. 168(1): 68-92 (2001)
- [j22]Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv: Kleene's Logic with Equality. Inf. Process. Lett. 80(3): 131-137 (2001)
- [j21]Hanne Riis Nielson, Flemming Nielson: Shape Analysis for Mobile Ambients. Nord. J. Comput. 8(2): 233-275 (2001)
- [p1]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Security Analysis Using Flow Logics. Current Trends in Theoretical Computer Science 2001: 525-542
- [c46]
- [c45]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Static Analysis for Secrecy and Non-interference in Networks of Processes. PaCT 2001: 27-41
- [i1]Flemming Nielson, Helmut Seidl: Succinct Solvers. Universität Trier, Mathematik/Informatik, Forschungsbericht 01-12 (2001)
- 2000
- [j20]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Security Analysis using Flow Logics. Bulletin of the EATCS 70: 112-130 (2000)
- [c44]Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv: A Kleene Analysis of Mobile Ambients. ESOP 2000: 305-319
- [c43]
1990 – 1999
- 1999
- [b3]Torben Amtoft, Hanne Riis Nielson, Flemming Nielson: Type and effect systems - behaviours for concurrency. Imperial College Press 1999, ISBN 978-1-86094-154-2, pp. 1-253
- [b2]Flemming Nielson, Hanne Riis Nielson, Chris Hankin: Principles of program analysis. Springer 1999, ISBN 978-3-540-65410-0, pp. I-XXI, 1-450
- [c42]
- [c41]Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen, Jacob Grydholt Jensen: Validating Firewalls in Mobile Ambients. CONCUR 1999: 463-477
- [c40]
- [c39]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Static Analysis of Processes for No and Read-Up nad No Write-Down. FoSSaCS 1999: 120-134
- [c38]René Rydhof Hansen, Jacob Grydholt Jensen, Flemming Nielson, Hanne Riis Nielson: Abstract Interpretation of Mobile Ambients. SAS 1999: 134-148
- 1998
- [j19]Kirsten Lackner Solberg Gasser, Hanne Riis Nielson, Flemming Nielson: Strictness and Totality Analysis. Sci. Comput. Program. 31(1): 113-145 (1998)
- [j18]Torben Amtoft, Hanne Riis Nielson, Flemming Nielson: Behavior Analysis for Validating Communication Patterns. STTT 2(1): 13-28 (1998)
- [c37]
- [c36]Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson: Control Flow Analysis for the pi-calculus. CONCUR 1998: 84-98
- [c35]Hanne Riis Nielson, Torben Amtoft, Flemming Nielson: Behaviour Analysis and Safety Conditions: A Case Study in CML. FASE 1998: 255-269
- [c34]
- 1997
- [j17]Flemming Nielson, Hanne Riis Nielson: Flow Logic and Operational Semantics. Electr. Notes Theor. Comput. Sci. 10: 150-169 (1997)
- [j16]Torben Amtoft, Flemming Nielson, Hanne Riis Nielson: Type and Behaviour Reconstruction for Higher-Order Concurrent Programs. J. Funct. Program. 7(3): 321-347 (1997)
- [j15]
- [c33]Kirsten Lackner Solberg Gasser, Flemming Nielson, Hanne Riis Nielson: Systematic Realisation of Control Flow Analyses for CML. ICFP 1997: 38-51
- [c32]Flemming Nielson, Hanne Riis Nielson: Prescriptive Frameworks for Multi-Level Lambda-Calculi. PEPM 1997: 193-202
- [c31]Hanne Riis Nielson, Flemming Nielson: Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis. POPL 1997: 332-345
- 1996
- [j14]
- [j13]
- [j12]Flemming Nielson, Hanne Riis Nielson: Operational Semantics of Termination Types. Nord. J. Comput. 3(2): 144-187 (1996)
- [j11]Flemming Nielson, Hanne Riis Nielson: From CML to its Process Algebra. Theor. Comput. Sci. 155(1): 179-219 (1996)
- [c30]Flemming Nielson, Hanne Riis Nielson: Multi-Level Lambda-Calculi: An Algebraic Description. Dagstuhl Seminar on Partial Evaluation 1996: 338-354
- [c29]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
- [c28]Hanne Riis Nielson, Flemming Nielson, Torben Amtoft: Polymorphic Subtyping for Effect Analysis: The Static Semantics. LOMAPS 1996: 141-171
- [c27]Torben Amtoft, Flemming Nielson, Hanne Riis Nielson, Jürgen Ammann: Polymorphic Subtyping for Effect Analysis: The Dynamic Semantics. LOMAPS 1996: 172-206
- [c26]Flemming Nielson, Hanne Riis Nielson, Torben Amtoft: Polymorphic Subtyping for Effect Analysis: The Algorithm. LOMAPS 1996: 207-243
- [c25]
- 1995
- [c24]Hanne Riis Nielson, Flemming Nielson: Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages. TAPSOFT 1995: 590-604
- 1994
- [j10]Flemming Nielson, Hanne Riis Nielson: The Tensor Product in Wadler's Analysis of Lists. Sci. Comput. Program. 22(3): 327-354 (1994)
- [c23]Flemming Nielson, Hanne Riis Nielson: Constraints for Polymorphic Behaviours of Concurrent ML. CCL 1994: 73-88
- [c22]Hanne Riis Nielson, Flemming Nielson: Higher-Order Concurrent Programs with Finite Communication Topology. POPL 1994: 84-97
- 1993
- [c21]Flemming Nielson, Hanne Riis Nielson: From CML to Process Algebras (Extended Abstract). CONCUR 1993: 493-508
- [c20]Flemming Nielson, Hanne Riis Nielson: Finiteness Conditions for Strictness Analysis. WSA 1993: 194-205
- 1992
- [b1]Hanne Riis Nielson, Flemming Nielson: Semantics with applications - a formal introduction. Wiley professional computing, Wiley 1992, ISBN 978-0-471-92980-2, pp. I-XII, 1-240
- [j9]Hanne Riis Nielson, Flemming Nielson: Bounded Fixed-Point Iteration. J. Log. Comput. 2(4): 441-464 (1992)
- [c19]Flemming Nielson, Hanne Riis Nielson: The Tensor Product in Wadler's Analysis of Lists. ESOP 1992: 351-370
- [c18]Flemming Nielson, Hanne Riis Nielson: Finiteness Conditions for Fixed Point Iteration. LISP and Functional Programming 1992: 96-108
- [c17]
- [c16]
- [c15]Kirsten Lackner Solberg, Hanne Riis Nielson, Flemming Nielson: Inference Systems for Binding Time Analysis. WSA 1992: 247-254
- 1991
- [j8]Hanne Riis Nielson, Flemming Nielson: Using Transformations in the Implementations of Higher-Order Functions. J. Funct. Program. 1(4): 459-494 (1991)
- 1990
- [j7]Hanne Riis Nielson, Flemming Nielson: Functional Completeness of the Mixed lambda-Calculus and Combinatory Logic. Theor. Comput. Sci. 70(1): 99-126 (1990)
- [c14]Hanne Riis Nielson, Flemming Nielson: Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations. ESOP 1990: 291-305
- [c13]Hanne Riis Nielson, Flemming Nielson: Context Information for Lazy Code Generation. LISP and Functional Programming 1990: 251-263
1980 – 1989
- 1989
- [j6]Flemming Nielson: Two-Level Semantics and Abstract Interpretation. Theor. Comput. Sci. 69(2): 117-242 (1989)
- [c12]
- [c11]
- 1988
- [j5]Flemming Nielson: Strictness Analysis and Denotational Abstract Interpretation. Inf. Comput. 76(1): 29-92 (1988)
- [j4]Hanne Riis Nielson, Flemming Nielson: Automatic Binding Time Analysis for a Typed lambda-Calculus. Sci. Comput. Program. 10(1): 139-176 (1988)
- [j3]Flemming Nielson, Hanne Riis Nielson: Two-Level Semantics and Code Generation. Theor. Comput. Sci. 56: 59-133 (1988)
- [c10]
- [c9]Hanne Riis Nielson, Flemming Nielson: Automatic Binding Time Analysis for a Typed Lambda-Calculus. POPL 1988: 98-106
- 1987
- [c8]
- 1986
- [c7]
- [c6]Hanne Riis Nielson, Flemming Nielson: Pragmatic Aspects of Two-Level Denotational Meta-Languages. ESOP 1986: 133-143
- [c5]Hanne Riis Nielson, Flemming Nielson: Semantics Directed Compiling for Functional Languages. LISP and Functional Programming 1986: 249-257
- [c4]
- 1985
- [j2]Flemming Nielson: Program Transformations in a Denotational Setting. ACM Trans. Program. Lang. Syst. 7(3): 359-379 (1985)
- [c3]
- [c2]Flemming Nielson, Hanne Riis Nielson: Code generation from two-level denotational meta-languages. Programs as Data Objects 1985: 192-205
- 1983
- [c1]Alan Mycroft, Flemming Nielson: Strong Abstract Interpretation Using Power Domains (Extended Abstract). ICALP 1983: 536-547
- 1982
- [j1]
Coauthor Index
[c102] [c101] [c100] [i10] [j49] [c99] [c98] [c97] [c96] [c95] [c94] [c92] [c91] [i9] [i8] [i7] [i6] [i5] [i4] [j47] [j45] [j44] [j43] [p2] [c90] [c89] [c88] [c87] [c85] [c84] [i2] [j42] [j41] [j40] [c81] [c80] [c79] [c78] [j39] [c76] [c75] [j38] [c74] [c73] [c72] [c71] [c69] [c68] [j37] [j36] [j35] [j34] [j33] [c67] [c66] [c64] [c62] [c61] [c59] [c58] [b4] [j32] [j30] [c55] [c54] [j29] [c53] [c52] [j28] [c51] [j27] [j26] [j25] [c50] [c49] [c48] [c47] [j24] [j23] [j22] [j21] [p1] [c45] [j20] [c44] [c43] [b3] [b2] [c42] [c41] [c40] [c39] [c38] [j19] [j18] [c37] [c36] [c35] [c34] [j17] [j16] [c33] [c32] [c31] [j12] [j11] [c30] [c28] [c27] [c26] [c24] [j10] [c23] [c22] [c21] [c20] [b1] [j9] [c19] [c18] [c17] [c16] [c15] [j8] [j7] [c14] [c13] [c12] [j4] [j3] [c10] [c9] [c6] [c5] [c2]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-02 21:55 CEST by the dblp team