J. Gregory Morrisett, Simon L. Peyton Jones
Proceedings of the 33rd Symposium on Principles of Programming Languages
POPL, 2006.
@proceedings{POPL-2006, acmid = "1111037", address = "Charleston, South Carolina, USA", editor = "J. Gregory Morrisett and Simon L. Peyton Jones", isbn = "1-59593-027-2", publisher = "{ACM}", title = "{Proceedings of the 33rd Symposium on Principles of Programming Languages}", year = 2006, }
Contents (36 items)
- POPL-2006-McKinna #dependent type #matter #why
- Why dependent types matter (JM), p. 1.
- POPL-2006-FisherMW
- The next 700 data description languages (KF, YM, DW), pp. 2–15.
- POPL-2006-ZhangDOZW #locality
- A hierarchical model of data locality (CZ, CD, MO, YZ, YW), pp. 16–29.
- POPL-2006-GuptaR #reduction
- Simplifying reductions (GG, SVR), pp. 30–41.
- POPL-2006-Leroy #certification #compilation #programming #proving
- Formal certification of a compiler back-end or: programming a compiler with a proof assistant (XL), pp. 42–54.
- POPL-2006-BishopFNSSW #implementation #logic #specification #testing
- Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations (SB, MF, MN, PS, MS, KW), pp. 55–66.
- POPL-2006-Dam #decidability #proving
- Decidability and proof systems for language-based noninterference relations (MD), pp. 67–78.
- POPL-2006-HuntS #on the #security
- On flow-sensitive security types (SH, DS), pp. 79–90.
- POPL-2006-AmtoftBB #data flow #logic #object-oriented #source code
- A logic for information flow in object-oriented programs (TA, SB, AB), pp. 91–102.
- POPL-2006-Vouillon #polymorphism
- Polymorphic regular tree types and patterns (JV), pp. 103–114.
- POPL-2006-LahiriQ #verification
- Verifying properties of well-founded linked lists (SKL, SQ), pp. 115–126.
- POPL-2006-MightS #analysis
- Environment analysis via Delta CFA (MM, OS), pp. 127–140.
- POPL-2006-KoutavasW #bisimulation #higher-order #imperative #reasoning #source code
- Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
- POPL-2006-AlurCM #calculus #fixpoint
- A fixpoint calculus for local and global program flows (RA, SC, PM), pp. 153–165.
- POPL-2006-Odersky #component #empirical #question #scala
- The Scala experiment: can we provide better language support for component systems? (MO), pp. 166–167.
- POPL-2006-DannerR
- Adventures in time and space (ND, JSR), pp. 168–179.
- POPL-2006-CohenDEPPP #network #realtime
- N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems (AC, MD, CE, CP, FP, MP), pp. 180–193.
- POPL-2006-ChenLK #network
- Compiler-directed channel allocation for saving power in on-chip networks (GC, FL, MTK), pp. 194–205.
- POPL-2006-DanielssonHJG #performance #reasoning
- Fast and loose reasoning is morally correct (NAD, JH, PJ, JG), pp. 206–217.
- POPL-2006-MeunierFF #analysis #composition #contract
- Modular set-based analysis from contracts (PM, RBF, MF), pp. 218–231.
- POPL-2006-PottierR #algebra #data type #type inference
- Stratified type inference for generalized algebraic data types (FP, YRG), pp. 232–244.
- POPL-2006-Flanagan #hybrid #type checking
- Hybrid type checking (CF), pp. 245–256.
- POPL-2006-KimYC #multi #polymorphism #type system
- A polymorphic modal type system for lisp-like multi-staged languages (ISK, KY, CC), pp. 257–268.
- POPL-2006-Sweeney #developer #game studies #perspective #programming language
- The next mainstream programming language: a game developer’s perspective (TS), p. 269.
- POPL-2006-ErnstOC #calculus
- A virtual class calculus (EE, KO, WRC), pp. 270–282.
- POPL-2006-LiuKM
- Interruptible iterators (JL, AK, ACM), pp. 283–294.
- POPL-2006-ReisS #c++ #concept #specification
- Specifying C++ concepts (GDR, BS), pp. 295–308.
- POPL-2006-Thielecke #pointer
- Frame rules from answer types for code pointers (HT), pp. 309–319.
- POPL-2006-NiS #assembly #embedded #pointer #programming
- Certified assembly programming with embedded code pointers (ZN, ZS), pp. 320–333.
- POPL-2006-VaziriTD #constraints #object-oriented
- Associating synchronization constraints with data in an object-oriented language (MV, FT, JD), pp. 334–345.
- POPL-2006-McCloskeyZGB #named
- Autolocker: synchronization inference for atomic sections (BM, FZ, DG, EAB), pp. 346–358.
- POPL-2006-LuP #encapsulation #representation
- Protecting representation with effect encapsulation (YL, JP), pp. 359–371.
- POPL-2006-SuW #injection #web
- The essence of command injection attacks in web applications (ZS, GW), pp. 372–382.
- POPL-2006-Dantas
- Harmless advice (DSD, DW), pp. 383–396.
- POPL-2006-MenonGMMSAP #compilation #optimisation #representation
- A verifiable SSA program representation for aggressive compiler optimization (VM, NG, BRM, AM, TS, ARAT, LP), pp. 397–408.
- POPL-2006-OlinskyLR #composition #implementation #specification #staged
- Staged allocation: a compositional technique for specifying and implementing procedure calling conventions (RO, CL, NR), pp. 409–421.
3 ×#specification
2 ×#analysis
2 ×#calculus
2 ×#compilation
2 ×#composition
2 ×#implementation
2 ×#logic
2 ×#network
2 ×#object-oriented
2 ×#pointer
2 ×#analysis
2 ×#calculus
2 ×#compilation
2 ×#composition
2 ×#implementation
2 ×#logic
2 ×#network
2 ×#object-oriented
2 ×#pointer