Jens Palsberg, Martín Abadi
Proceedings of the 32nd Symposium on Principles of Programming Languages
POPL, 2005.
@proceedings{POPL-2005, acmid = "1040305", address = "Long Beach, California, USA", editor = "Jens Palsberg and Martín Abadi", isbn = "1-58113-830-X", publisher = "{ACM}", title = "{Proceedings of the 32nd Symposium on Principles of Programming Languages}", year = 2005, }
Contents (31 items)
- POPL-2005-ChakravartyKJM
- Associated types with class (MMTC, GK, SLPJ, SM), pp. 1–13.
- POPL-2005-CobbeF #revisited
- Environmental acquisition revisited (RC, MF), pp. 14–25.
- POPL-2005-AnconaDDZ #bytecode #compilation #composition #java #polymorphism
- Polymorphic bytecode: compositional compilation for Java-like languages (DA, FD, SD, EZ), pp. 26–37.
- POPL-2005-ChenT #object-oriented
- A simple typed intermediate language for object-oriented languages (JC, DT), pp. 38–49.
- POPL-2005-HosoyaFC #morphism #parametricity #polymorphism #xml
- Parametric polymorphism for XML (HH, AF, GC), pp. 50–62.
- POPL-2005-SumiiP #abstraction #bisimulation #recursion
- A bisimulation for type abstraction and recursion (ES, BCP), pp. 63–74.
- POPL-2005-Goguen #approach #similarity #type system
- A syntactic approach to eta equality in type theory (HG), pp. 75–84.
- POPL-2005-Ghica #game studies
- Slot games: a quantitative model of computation (DRG), pp. 85–97.
- POPL-2005-AlurCMN #interface #java #specification #synthesis
- Synthesis of interface specifications for Java classes (RA, PC, PM, WN), pp. 98–109.
- POPL-2005-FlanaganG #model checking #partial order #reduction
- Dynamic partial-order reduction for model checking software (CF, PG), pp. 110–121.
- POPL-2005-GrumbergLST #approximate #multi
- Proof-guided underapproximation-widening for multi-process systems (OG, FL, OS, MT), pp. 122–131.
- POPL-2005-PodelskiR #abstraction #termination
- Transition predicate abstraction and fair termination (AP, AR), pp. 132–144.
- POPL-2005-GayN #communication #process #quantum
- Communicating quantum processes (SJG, RN), pp. 145–157.
- POPL-2005-LiZ #policy
- Downgrading policies and relaxed noninterference (PL, SZ), pp. 158–170.
- POPL-2005-ParkPT #probability
- A probabilistic language based upon sampling functions (SP, FP, ST), pp. 171–182.
- POPL-2005-StoyleHBSN #predict
- Mutatis mutandis: safe and predictable dynamic software updating (GS, MWH, GMB, PS, IN), pp. 183–194.
- POPL-2005-FieldV #consistency #distributed #maintenance #named #programming
- Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments (JF, CAV), pp. 195–208.
- POPL-2005-BruniMM #composition
- Theoretical foundations for compensations in flow composition languages (RB, HCM, UM), pp. 209–220.
- POPL-2005-NeubauerT #multi #program transformation #source code
- From sequential programs to multi-tier applications by program transformation (MN, PT), pp. 221–232.
- POPL-2005-FosterGMPS #approach #combinator #problem #program transformation
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem (JNF, MBG, JTM, BCP, AS), pp. 233–246.
- POPL-2005-ParkinsonB #abstraction #logic
- Separation logic and abstraction (MJP, GMB), pp. 247–258.
- POPL-2005-BornatCOP #logic
- Permission accounting in separation logic (RB, CC, PWO, MJP), pp. 259–270.
- POPL-2005-CalcagnoGZ #logic
- Context logic and tree update (CC, PG, UZ), pp. 271–282.
- POPL-2005-BoylandR
- Connecting effects and uniqueness with adoption (JTB, WR), pp. 283–295.
- POPL-2005-RinetzkyBRSW #abstraction #semantics
- A semantics for procedure local heaps and its abstractions (NR, JB, TWR, SS, RW), pp. 296–309.
- POPL-2005-HackettR #analysis
- Region-based shape analysis with tracked locations (BH, RR), pp. 310–323.
- POPL-2005-GulwaniN #analysis #interprocedural #precise #random #using
- Precise interprocedural analysis using random interpretation (SG, GCN), pp. 324–337.
- POPL-2005-GopanRS #analysis #array #framework
- A framework for numeric analysis of array operations (DG, TWR, SS), pp. 338–350.
- POPL-2005-XieA #detection #fault #satisfiability #scalability #using
- Scalable error detection using boolean satisfiability (YX, AA), pp. 351–363.
- POPL-2005-LernerMRC #analysis #automation #data flow #proving
- Automated soundness proofs for dataflow analyses and transformations via local rules (SL, TDM, ER, CC), pp. 364–377.
- POPL-2005-MansonPA #java #memory management
- The Java memory model (JM, WP, SVA), pp. 378–391.
4 ×#abstraction
4 ×#analysis
3 ×#java
3 ×#logic
2 ×#approach
2 ×#composition
2 ×#multi
2 ×#polymorphism
2 ×#using
4 ×#analysis
3 ×#java
3 ×#logic
2 ×#approach
2 ×#composition
2 ×#multi
2 ×#polymorphism
2 ×#using