Travelled to:1 × Cyprus
1 × Finland
1 × Hungary
1 × Switzerland
1 × United Kingdom
2 × Belgium
2 × Denmark
2 × Portugal
4 × Spain
4 × The Netherlands
5 × France
5 × Germany
6 × Italy
7 × USA
Collaborated with:H.R.Nielson ∅ H.Seidl Y.Zhang H.Pilegaard T.Amtoft A.Mycroft C.Bodei P.Degano R.R.Hansen R.Vigo F.Zhang C.D.P.K.Ramli P.Filipiuk L.Song B.F.Nielsen C.R.Nielsen S.Nanz S.Sagiv K.L.S.Gasser K.L.Solberg J.Midtgaard M.Buchholtz A.Bruni M.Sojka L.Zhang D.N.Jansen H.Hermanns J.Bauer J.G.Jensen M.Curti C.Priami H.Sun
Talks about:analysi (23) flow (5) abstract (4) languag (4) control (4) ambient (4) static (4) point (4) level (4) iter (4)
Person: Flemming Nielson
DBLP: Nielson:Flemming
Contributed to:
201420132012
2012
2012
2011
2011
2010
2008
2008
2008200720052004
20042002200220012000
2000199919991999
1998
1998
1997
1997199719961994199319921994
19921992199219901990
1989198819881987198619861983
19952016Wrote 49 papers:
- IFM-2014-BruniSNN #analysis #protocol #security
- Formal Security Analysis of the MaCAN Protocol (AB, MS, FN, HRN), pp. 241–255.
- IFM-2013-VigoNN #communication
- Broadcast, Denial-of-Service, and Secure Communication (RV, FN, HRN), pp. 412–427.
- IFM-2012-ZhangNN #model checking #revisited #static analysis
- Model Checking as Static Analysis: Revisited (FZ, FN, HRN), pp. 99–112.
- LOPSTR-2012-RamliNN #programming #set
- XACML 3.0 in Answer Set Programming (CDPKR, HRN, FN), pp. 89–105.
- PPDP-2012-FilipiukNN #fixpoint #logic
- Layered fixed point logic (PF, FN, HRN), pp. 45–54.
- ICALP-v2-2011-ZhangJNH #model checking
- Automata-Based CSL Model Checking (LZ, DNJ, FN, HH), pp. 271–282.
- QAPL-2011-SongNN #probability #π-calculus
- A Stochastic Broadcast π-Calculus (LS, FN, BFN), pp. 74–88.
- FoSSaCS-2010-NielsonN #logic #model checking #static analysis
- Model Checking Is Static Analysis of Modal Logic (FN, HRN), pp. 191–205.
- ESOP-2008-NielsenNN #horn clause
- Iterative Specialisation of Horn Clauses (CRN, FN, HRN), pp. 131–145.
- GPCE-2008-ZhangAN #constraints #optimisation #theorem proving
- From generic to specific: off-line optimization for a general constraint solver (YZ, TA, FN), pp. 45–54.
- SAS-2008-BauerNNP #analysis #correlation #relational
- Relational Analysis of Correlation (JB, FN, HRN, HP), pp. 32–46.
- SAS-2008-NanzNN #abstraction #behaviour #concurrent
- Modal Abstractions of Concurrent Behaviour (SN, FN, HRN), pp. 159–173.
- LOPSTR-2007-ZhangN #constraints #scalability #theorem proving #unification #using
- A Scalable Inclusion Constraint Solver Using Unification (YZ, FN), pp. 121–137.
- QAPL-2004-BodeiCDBNNP05 #evaluation #performance #protocol #security
- Performance Evaluation of Security Protocols Specified in LySa (CB, MC, PD, MB, FN, HRN, CP), pp. 167–189.
- SAS-2004-NielsonNP #analysis
- Spatial Analysis of BioAmbients (HRN, FN, HP), pp. 69–83.
- TACAS-2004-NielsonNSBHPS
- The Succinct Solver Suite (FN, HRN, HS, MB, RRH, HP, HS), pp. 251–265.
- ESOP-2002-NielsonNS #analysis #automation #complexity
- Automatic Complexity Analysis (FN, HRN, HS), pp. 243–261.
- SAS-2002-NielsonNS #horn clause #normalisation
- Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi (FN, HRN, HS), pp. 20–35.
- ESOP-2001-NielsonS #analysis #control flow #polynomial
- Control-Flow Analysis in Cubic Time (FN, HS), pp. 252–268.
- ESOP-2000-NielsonNS #analysis #mobile
- A Kleene Analysis of Mobile Ambients (FN, HRN, SS), pp. 305–319.
- POPL-2000-NielsonN #analysis #mobile
- Shape Analysis for Mobile Ambients (HRN, FN), pp. 142–154.
- ESOP-1999-NielsonN #analysis #control flow #interprocedural
- Interprocedural Control Flow Analysis (FN, HRN), pp. 20–39.
- FoSSaCS-1999-BodeiDNN #process #static analysis
- Static Analysis of Processes for No and Read-Up and No Write-Down (CB, PD, FN, HRN), pp. 120–134.
- SAS-1999-HansenJNN #abstract interpretation #mobile
- Abstract Interpretation of Mobile Ambients (RRH, JGJ, FN, HRN), pp. 134–148.
- CC-1998-NielsonN #analysis #constraints #logic
- Flow Logics for Constraint Based Analysis (HRN, FN), pp. 109–127.
- FASE-1998-NielsonAN #analysis #behaviour #case study #safety
- Behaviour Analysis and Safety Conditions: A Case Study in CML (HRN, TA, FN), pp. 255–269.
- ICFP-1997-GasserNN #analysis #control flow
- Systematic Realisation of Control Flow Analyses for CML (KLSG, FN, HRN), pp. 38–51.
- PEPM-1997-NielsonN #framework #multi #λ-calculus
- Prescriptive Frameworks for Multi-Level λ-Calculi (FN, HRN), pp. 193–202.
- POPL-1997-NielsonN #analysis #control flow #semantics
- Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis (HRN, FN), pp. 332–345.
- SAS-1996-Nielson #perspective #program analysis #semantics
- Semantics-Directed Program Analysis: A Tool-Maker’s Perspective (FN), pp. 2–21.
- POPL-1994-NielsonN #communication #concurrent #finite #higher-order #source code
- Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
- WSA-1993-NielsonN #analysis #strict
- Finiteness Conditions for Strictness Analysis (FN, HRN), pp. 194–205.
- ESOP-1992-NielsonN #analysis
- The Tensor Product in Wadler’s Analysis of Lists (FN, HRN), pp. 351–370.
- ESOP-J-1992-NielsonN94 #analysis
- The Tensor Product in Wadler’s Analysis of Lists (FN, HRN), pp. 327–354.
- LFP-1992-NielsonN #fixpoint
- Finiteness Conditions for Fixed Point Iteration (FN, HRN), pp. 96–108.
- POPL-1992-NielsonN #bound #fixpoint
- Bounded Fixed Point Iteration (HRN, FN), pp. 71–82.
- WSA-1992-SolbergNN #analysis
- Inference Systems for Binding Time Analysis (KLS, HRN, FN), pp. 247–254.
- ESOP-1990-NielsonN #exclamation #for free
- Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations (HRN, FN), pp. 291–305.
- LFP-1990-NielsonN #code generation #information management #lazy evaluation
- Context Information for Lazy Code Generation (HRN, FN), pp. 251–263.
- FPCA-1989-NielsonN #higher-order
- Transformations on Higher-Order Functions (HRN, FN), pp. 129–143.
- ESOP-1988-NielsonN #λ-calculus
- 2-level λ-lifting (FN, HRN), pp. 328–343.
- POPL-1988-NielsonN #analysis #automation #λ-calculus
- Automatic Binding Time Analysis for a Typed λ-Calculus (HRN, FN), pp. 98–106.
- POPL-1987-Nielson #abstract interpretation #analysis #strict
- Strictness Analysis and Denotational Abstract Interpretation (FN), pp. 120–131.
- ESOP-1986-Nielson #code generation #correctness #metalanguage
- Correctness of Code Generation from a Two-Level Meta-Language (FN), pp. 30–40.
- ESOP-1986-NielsonN #aspect-oriented #metalanguage
- Pragmatic Aspects of Two-Level Denotational Meta-Languages (HRN, FN), pp. 133–143.
- LFP-1986-NielsonN #compilation #functional #semantics
- Semantics Directed Compiling for Functional Languages (HRN, FN), pp. 249–257.
- ICALP-1983-MycroftN #abstract interpretation #using
- Strong Abstract Interpretation Using Power Domains (AM, FN), pp. 536–547.
- TAPSOFT-1995-NielsonN #concurrent #higher-order
- Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages (HRN, FN), pp. 590–604.
- PPDP-2016-MidtgaardNN #analysis #process #regular expression
- Iterated process analysis over lattice-valued regular expressions (JM, FN, HRN), pp. 132–145.