Travelled to:1 × China
1 × Cyprus
1 × Czech Republic
1 × Finland
1 × Japan
1 × Poland
1 × Spain
1 × Sweden
1 × Switzerland
1 × The Netherlands
2 × Canada
2 × Germany
2 × India
23 × USA
3 × Denmark
4 × Austria
4 × France
4 × United Kingdom
Collaborated with:F.M.Q.Pereira ∅ M.I.Schwartzbach M.Brown T.Zhao M.Eslamimehr M.Lesani J.K.Lee M.Naik C.G.Kalhauge C.Grothoff J.Bender V.K.Nandivada N.Glew D.Brylow B.Titzer J.Vitek K.J.Lieberherr T.D.Millstein R.Haque C.B.Jay S.Guo S.Kou F.Tip C.Pavlopoulou P.O'Keefe P.Ørbæk A.Bondorf W.R.Cook Zeina Migeed R.Majumdar S.Jha N.Damgaard B.Patt-Shamir L.M.Seiter O.Danvy K.Malmkjær O.Agesen D.Kozen N.Oxhøj Oren Freiberg H.Hong N.Nystrom V.A.Saraswat J.S.Auerbach D.F.Bacon B.Chin S.Markstrum K.Chatterjee D.Ma T.A.Henzinger
Talks about:type (23) object (8) alloc (8) program (7) regist (7) infer (7) effici (6) analysi (5) compil (5) evalu (5)
♂ Person: Jens Palsberg
DBLP: Palsberg:Jens
Facilitated 9 volumes:
SciCo
Ed
EdSciCo
EdSciCoEd
EdEdContributed to:
2015
20152015
2014
2014
20142012
201120112011
20102010201020092008
2008
2008
2007200720072006
2006
20062005
20052005
200320032003200220022002
2002
20012001200120002000199819961996199519951994
19941993
199319931992199219911991199019892019
1995
2016201820192016201720182020Wrote 63 papers:
- ECOOP-2015-HaqueP #type inference
- Type Inference for Place-Oblivious Objects (RH, JP), pp. 371–395.
- OOPSLA-2015-BenderLP #declarative
- Declarative fence insertion (JB, ML, JP), pp. 367–385.
- POPL-2015-BrownP #self
- Self-Representation in Girard’s System U (MB, JP), pp. 471–484.
- CAV-2014-LesaniMP #automation #concurrent #data type #verification
- Automatic Atomicity Verification for Clients of Concurrent Data Structures (ML, TDM, JP), pp. 550–567.
- FSE-2014-EslamimehrP #concurrent #detection #named #scalability #source code
- Sherlock: scalable deadlock detection for concurrent programs (ME, JP), pp. 353–365.
- PPoPP-2014-EslamimehrP #concurrent #scheduling #source code
- Race directed scheduling of concurrent programs (ME, JP), pp. 301–314.
- SAS-2012-LeePMH #analysis #parallel #performance
- Efficient May Happen in Parallel Analysis for Async-Finish Parallelism (JKL, JP, RM, HH), pp. 5–23.
- ICFP-2011-JayP #pattern matching #self
- Typed self-interpretation by pattern matching (CBJ, JP), pp. 247–258.
- POPL-2011-GuoP #compilation
- The essence of compiling with traces (SyG, JP), pp. 563–574.
- PPoPP-2011-LesaniP #communication #memory management #transaction
- Communicating memory transactions (ML, JP), pp. 157–168.
- CC-2010-PereiraP
- Punctual Coalescing (FMQP, JP), pp. 165–184.
- OOPSLA-2010-KouP #hardware #object-oriented #question
- From OO to FPGA: fitting round objects into square hardware? (SK, JP), pp. 109–124.
- PPoPP-2010-LeeP #calculus #parallel
- Featherweight X10: a core calculus for async-finish parallelism (JKL, JP), pp. 25–36.
- CC-2009-PereiraP
- SSA Elimination after Register Allocation (FMQP, JP), pp. 158–173.
- OOPSLA-2008-NystromSPG #object-oriented
- Constrained types for object-oriented languages (NN, VAS, JP, CG), pp. 457–474.
- PLDI-2008-PereiraP
- Register allocation by puzzle solving (FMQP, JP), pp. 216–226.
- VMCAI-2008-Palsberg #verification
- Verification of Register Allocators (JP), p. 6.
- ICALP-2007-LeePP #alias #source code
- Aliased Register Allocation for Straight-Line Programs Is NP-Complete (JKL, JP, FMQP), pp. 680–691.
- PLDI-2007-TitzerABP #automation #reduction #virtual machine
- The ExoVM system for automatic VM and application reduction (BT, JSA, DFB, JP), pp. 352–362.
- SAS-2007-NandivadaPP #evaluation #framework #verification
- A Framework for End-to-End Verification and Evaluation of Register Allocators (VKN, FMQP, JP), pp. 153–169.
- CC-2006-NandivadaP #named #stack
- SARA: Combining Stack Allocation and Register Allocation (VKN, JP), pp. 232–246.
- ESOP-2006-ChinMMP
- Inference of User-Defined Type Qualifiers and Qualifier Rules (BC, SM, TDM, JP), pp. 264–278.
- FoSSaCS-2006-PereiraP
- Register Allocation After Classical SSA Elimination is NP-Complete (FMQP, JP), pp. 79–93.
- ESOP-2005-NaikP #model checking #type system
- A Type System Equivalent to a Model Checker (MN, JP), pp. 374–388.
- LCTES-2005-TitzerP #precise
- Nonintrusive precision instrumentation of microcontroller software (BT, JP), pp. 59–68.
- SAS-2005-GlewPG #architecture #optimisation #plugin #type safety
- Type-Safe Optimisation of Plugin Architectures (NG, JP, CG), pp. 135–154.
- ESEC-FSE-2003-BrylowP #analysis
- Deadline analysis of interrupt-driven software (DB, JP), pp. 198–207.
- OOPSLA-2003-ZhaoPV #java #lightweight
- Lightweight confinement for featherweight Java (TZ, JP, JV), pp. 135–148.
- SAS-2003-ChatterjeeMMZHP #analysis #source code #stack
- Stack Size Analysis for Interrupt-Driven Programs (KC, DM, RM, TZ, TAH, JP), pp. 109–126.
- ECOOP-2002-GlewP #type safety
- Type-Safe Method Inlining (NG, JP), pp. 525–544.
- FoSSaCS-2002-JhaPZ #performance
- Efficient Type Matching (SJ, JP, TZ), pp. 187–204.
- LCTES-SCOPES-2002-NaikP #compilation #constraints
- Compiling with code-size constraints (MN, JP), pp. 120–129.
- LICS-2002-PalsbergZ #performance #type inference #type system
- Efficient Type Inference for Record Concatenation and Subtyping (JP, TZ), pp. 125–136.
- ICSE-2001-BrylowDP #static analysis
- Static Checking of Interrupt-Driven Software (DB, ND, JP), pp. 47–56.
- OOPSLA-2001-GrothoffPV #encapsulation
- Encapsulating Objects with Confined Types (CG, JP, JV), pp. 241–253.
- PASTE-2001-Palsberg #analysis #type system
- Type-based analysis and applications (JP), pp. 20–27.
- LICS-2000-PalsbergZ #flexibility #performance #recursion
- Efficient and Flexible Matching of Recursive Types (JP, TZ), pp. 388–398.
- OOPSLA-2000-TipP #algorithm #graph #scalability
- Scalable propagation-based call graph construction algorithms (FT, JP), pp. 281–293.
- POPL-1998-PalsbergP
- From Polyvariant Flow Information to Intersection and Union Types (JP, CP), pp. 197–208.
- ESOP-1996-PalsbergPL #adaptation #approach #compilation #source code
- A New Approach to Compiling Adaptive Programs (JP, BPS, KJL), pp. 280–295.
- FSE-1996-SeiterPL #behaviour #evolution #using
- Evolution of Object Behavior Using Context Relations (LMS, JP, KJL), pp. 46–57.
- POPL-1995-PalsbergO #analysis #type system
- A Type System Equivalent to Flow Analysis (JP, PO), pp. 367–378.
- SAS-1995-PalsbergO #trust #λ-calculus
- Trust in the λ-Calculus (JP, PØ), pp. 314–329.
- LICS-1994-Palsberg #performance
- Efficient Inference of Object Types (JP), pp. 186–195.
- PEPM-1994-DanvyMP #partial evaluation
- The Essence of Eta-Expansion in Partial Evaluation (OD, KM, JP), pp. 11–20.
- ECOOP-1993-AgesenPS #type inference
- Type Inference of SELF (OA, JP, MIS), pp. 247–267.
- FPCA-1993-BondorfP #compilation #partial evaluation
- Compiling Actions by Partial Evaluation (AB, JP), pp. 308–320.
- POPL-1993-KozenPS #performance #recursion #type system
- Efficient Recursive Subtyping (DK, JP, MIS), pp. 419–428.
- ECOOP-1992-OxhojPS #type inference
- Making Type Inference Practical (NO, JP, MIS), pp. 329–349.
- ESOP-1992-Palsberg #compilation #generative
- A Provably Correct Compiler Generator (JP), pp. 418–434.
- ECOOP-1991-PalsbergS #question #reuse #type safety #what
- What is Type-Safe Code Reuse? (JP, MIS), pp. 325–341.
- OOPSLA-1991-PalsbergS #object-oriented #type inference
- Object-Oriented Type Inference (JP, MIS), pp. 146–161.
- OOPSLA-ECOOP-1990-PalsbergS #object-oriented #programming
- Type Substitution for Object-Oriented Programming (JP, MIS), pp. 151–160.
- OOPSLA-1989-CookP #correctness #inheritance #semantics
- A Denotational Semantics of Inheritance and its Correctness (WRC, JP), pp. 433–443.
- ESEC-FSE-2019-KalhaugeP #dependence #graph #reduction
- Binary reduction of dependency graphs (CGK, JP), pp. 556–566.
- TAPSOFT-1995-Palsberg #analysis
- Comparing Flow-Based Binding-Time Analyses (JP), pp. 561–574.
- QoSA-2016-FreibergPE #communication #distributed #source code
- Retargetable Communication for Distributed Programs (OF, JP, ME), pp. 21–30.
- OOPSLA-2018-KalhaugeP #concurrent #predict
- Sound deadlock prediction (CGK, JP), p. 29.
- OOPSLA-2019-BenderP #concurrent #formal method #java
- A formalization of Java's concurrent access modes (JB, JP), p. 28.
- POPL-2016-BrownP #normalisation #self
- Breaking through the normalization barrier: a self-interpreter for f-omega (MB, JP), pp. 5–17.
- POPL-2017-BrownP #self
- Typed self-evaluation via intensional type functions (MB, JP), pp. 415–428.
- POPL-2018-BrownP #normalisation #partial evaluation
- Jones-optimal partial evaluation by specialization-safe normalization (MB, JP), p. 28.
- POPL-2020-MigeedP #decidability #question #what
- What is decidable about gradual types? (ZM, JP), p. 29.