Martin Hofmann, Matthias Felleisen
Proceedings of the 34th Symposium on Principles of Programming Languages
POPL, 2007.
@proceedings{POPL-2007, acmid = "1190216", address = "Nice, France", editor = "Martin Hofmann and Matthias Felleisen", isbn = "1-59593-575-4", publisher = "{ACM}", title = "{Proceedings of the 34th Symposium on Principles of Programming Languages}", year = 2007, }
Contents (39 items)
- POPL-2007-Tang #perl
- Perl 6: reconciling the irreconcilable (AT), p. 1.
- POPL-2007-MatthewsF #multi #semantics #source code
- Operational semantics for multi-language programs (JM, RBF), pp. 3–10.
- POPL-2007-AvgustinovHOMSTV #aspectj #semantics
- Semantics of static pointcuts in aspectJ (PA, EH, NO, OdM, DS, JT, MV), pp. 11–23.
- POPL-2007-Chen #compilation #inheritance #multi
- A typed intermediate language for compiling multiple inheritance (JC), pp. 25–30.
- POPL-2007-JumpM #detection #garbage collection #memory management #named
- Cork: dynamic memory leak detection for garbage-collected languages (MJ, KSM), pp. 31–38.
- POPL-2007-PolishchukLS #comprehension #debugging #type inference
- Dynamic heap type inference for program understanding and debugging (MP, BL, CWS), pp. 39–46.
- POPL-2007-Godefroid #composition #generative #testing
- Compositional dynamic test generation (PG), pp. 47–54.
- POPL-2007-ShenSMD #approximate #locality #using
- Locality approximation using time (XS, JS, BM, CD), pp. 55–61.
- POPL-2007-DreyerHCK #composition
- Modular type classes (DD, RH, MMTC, GK), pp. 63–70.
- POPL-2007-SiskindP #standard
- First-class nonstandard interpretations by opening closures (JMS, BAP), pp. 71–76.
- POPL-2007-MandelbaumFWFG #functional #ml #named
- PADS/ML: a functional data description language (YM, KF, DW, MFF, AG), pp. 77–83.
- POPL-2007-PittsS #generative
- Generative unbinding of names (AMP, MRS), pp. 85–95.
- POPL-2007-TuchKN #logic
- Types, bytes, and separation logic (HT, GK, MN), pp. 97–108.
- POPL-2007-AppelMRV #type system
- A very modal model of a modern, major, general type system (AWA, PAM, CDR, JV), pp. 109–122.
- POPL-2007-CalcagnoGZ #logic #parametricity
- Context logic as modal logic: completeness and parametric inexpressivity (CC, PG, UZ), pp. 123–134.
- POPL-2007-Batory #implementation #synthesis
- From implementation to theory in product synthesis (DSB), pp. 135–136.
- POPL-2007-Lammel #combinator #scrap your boilerplate
- Scrap your boilerplate with XPath-like combinators (RL), pp. 137–142.
- POPL-2007-OhoriS #fixpoint #lightweight
- Lightweight fusion by fixed point promotion (AO, IS), pp. 143–154.
- POPL-2007-PearlmutterS #higher-order #lazy evaluation #multi
- Lazy multivariate higher-order forward-mode AD (BAP, JMS), pp. 155–160.
- POPL-2007-StovringL #induction
- A complete, co-inductive syntactic theory of sequential control and state (KS, SBL), pp. 161–172.
- POPL-2007-LeeCH #ml #standard #towards
- Towards a mechanized metatheory of standard ML (DKL, KC, RH), pp. 173–184.
- POPL-2007-Might #analysis #higher-order #source code
- Logic-flow analysis of higher-order programs (MM), pp. 185–198.
- POPL-2007-WiedermannC #persistent #query #static analysis
- Extracting queries by static analysis of transparent persistence (BW, WRC), pp. 199–210.
- POPL-2007-BerdineCCDO #analysis
- Variance analyses from invariance analyses (JB, AC, BC, DD, PWO), pp. 211–224.
- POPL-2007-Malacaria #security
- Assessing security threats of looping constructs (PM), pp. 225–235.
- POPL-2007-YuCIS #javascript #security
- JavaScript instrumentation for browser security (DY, AC, NI, IS), pp. 237–249.
- POPL-2007-BugliesiG #abstraction #implementation
- Secure implementations of typed channel abstractions (MB, MG), pp. 251–262.
- POPL-2007-Murthy #design #enterprise #programming language #λ-calculus
- Advanced programming language design in enterprise software: a λ-calculus theorist wanders into a datacenter (CM), pp. 263–264.
- POPL-2007-CookGPRV #proving #source code
- Proving that programs eventually do something good (BC, AG, AP, AR, MYV), pp. 265–276.
- POPL-2007-GulwaniJ #probability #verification
- Program verification as probabilistic inference (SG, NJ), pp. 277–289.
- POPL-2007-EmmiFJM
- Lock allocation (ME, JSF, RJ, RM), pp. 291–296.
- POPL-2007-ParkinsonBO #composition #stack #verification
- Modular verification of a non-blocking stack (MJP, RB, PWO), pp. 297–302.
- POPL-2007-KahlonG #analysis #automaton #on the
- On the analysis of interacting pushdown systems (VK, AG), pp. 303–314.
- POPL-2007-ReppyX #message passing
- Specialization of CML message-passing primitives (JHR, YX), pp. 315–326.
- POPL-2007-NaikA #alias #concurrent #detection
- Conditional must not aliasing for static race detection (MN, AA), pp. 327–338.
- POPL-2007-JhalaM #analysis #interprocedural #source code
- Interprocedural analysis of asynchronous programs (RJ, RM), pp. 339–350.
- POPL-2007-VaswaniNC #profiling
- Preferential path profiling: compactly numbering interesting paths (KV, AVN, TMC), pp. 351–362.
- POPL-2007-Ghica #approach #design #geometry #synthesis
- Geometry of synthesis: a structured approach to VLSI design (DRG), pp. 363–375.
- POPL-2007-PredaCJD #approach #detection #semantics
- A semantics-based approach to malware detection (MDP, MC, SJ, SKD), pp. 377–388.
4 ×#analysis
4 ×#source code
3 ×#composition
3 ×#detection
3 ×#multi
3 ×#semantics
2 ×#approach
2 ×#design
2 ×#generative
2 ×#higher-order
4 ×#source code
3 ×#composition
3 ×#detection
3 ×#multi
3 ×#semantics
2 ×#approach
2 ×#design
2 ×#generative
2 ×#higher-order