default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th POPL 2000: Boston, Massachusetts, USA
- Mark N. Wegman, Thomas W. Reps:
POPL 2000, Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, January 19-21, 2000. ACM 2000, ISBN 1-58113-125-9 - Javier Esparza
, Andreas Podelski:
Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. 1-11 - Patrick Cousot, Radhia Cousot:
Temporal Abstract Interpretation. 12-25 - Nevin Heintze, Joxan Jaffar, Razvan Voicu:
A Framework for Combining Analysis and Verification. 26-39 - Johan Agat:
Transforming Out Timing Leaks. 40-53 - Thomas Colcombet, Pascal Fradet:
Enforcing Trace Properties by Program Transformation. 54-66 - Robert Muth, Saumya K. Debray:
On the Complexity of Flow-Sensitive Dataflow Analyses. 67-80 - Zhendong Su, Manuel Fähndrich, Alexander Aiken:
Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs. 81-95 - Andrea Asperti, Paolo Coppola, Simone Martini:
(Optimal) Duplication is not Elementary Recursive. 96-107 - Jeffrey R. Lewis, John Launchbury, Erik Meijer, Mark Shields:
Implicit Parameters: Dynamic Scoping with Static Types. 108-118 - Ralf Hinze:
A New Approach to Generic Functional Programming. 119-132 - Alan Bawden:
First-Class Macros have Types. 133-141 - Hanne Riis Nielson, Flemming Nielson:
Shape Analysis for Mobile Ambients. 142-154 - Raghavan Komondoor, Susan Horwitz:
Semantics-Preserving Procedure Extraction. 155-169 - Oliver Rüthing, Jens Knoop, Bernhard Steffen:
Sparse Code Motion. 170-183 - Karl Crary, Stephanie Weirich:
Resource Bound Certification. 184-198 - Ben Liblit, Alexander Aiken:
Type Systems for Distributed Data Structures. 199-213 - Christopher A. Stone, Robert Harper:
Deciding Type Equivalence with Singleton Kinds. 214-227 - Todd B. Knoblock, Jakob Rehof:
Type Elaboration and Subtype Completion for Java Bytecode. 228-242 - Andrew W. Appel, Amy P. Felty:
A Semantic Model of Types and Machine Instructions for Proof-Carrying Code. 243-253 - David Walker:
A Type System for Expressive Security Policies. 254-267 - Dennis M. Volpano, Geoffrey Smith:
Verifying Secrets and Relative Secrecy. 268-276 - Craig Chambers, Bill Harrison, John M. Vlissides:
A Debate on Language and Tool Support for Design Patterns. 277-289 - Anders Sandholm, Michael I. Schwartzbach:
A Type System for Dynamic Web Documents. 290-301 - Martín Abadi, Cédric Fournet, Georges Gonthier:
Authentication Primitives and Their Compilation. 302-315 - Carl A. Gunter, Trevor Jim:
Generalized Certificate Revocation. 316-329 - Witold Charatonik, Andreas Podelski, Jean-Marc Talbot:
Paths vs. Trees in Set-Based Program Analysis. 330-337 - Timothy J. Hickey:
Analytic Constraint Solving and Interval Arithmetic. 338-351 - Francesca Levi, Davide Sangiorgi:
Controlling Interference in Ambients. 352-364 - Luca Cardelli, Andrew D. Gordon:
Anytime, Anywhere: Modal Logics for Mobile Ambients. 365-377 - Yoo C. Chung, Soo-Mook Moon, Kemal Ebcioglu, Dan Sahlin:
Reducing Sweep Time for a Nearly Empty Heap. 378-389 - Rajeev Alur, Radu Grosu:
Modular Refinement of Hierarchic Reactive Machines. 390-402
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-22 01:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
