The SCEAS System
Navigation Menu

Conferences in DBLP

Asian Symposium on Programming Languages and Systems (aplas)
2009 (conf/aplas/2009)


  1. The Twilight Zone: From Testing to Formal Specifications and Back Again. [Citation Graph (, )][DBLP]


  2. Types and Recursion Schemes for Higher-Order Program Verification. [Citation Graph (, )][DBLP]


  3. The Sketching Approach to Program Synthesis. [Citation Graph (, )][DBLP]


  4. Large Spurious Cycle in Global Static Analyses and Its Algorithmic Mitigation. [Citation Graph (, )][DBLP]


  5. Abstract Transformers for Thread Correlation Analysis. [Citation Graph (, )][DBLP]


  6. Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters. [Citation Graph (, )][DBLP]


  7. A Short Cut to Optimal Sequences. [Citation Graph (, )][DBLP]


  8. A Skeletal Parallel Framework with Fusion Optimizer for GPGPU Programming. [Citation Graph (, )][DBLP]


  9. Witnessing Purity, Constancy and Mutability. [Citation Graph (, )][DBLP]


  10. On the Decidability of Subtyping with Bounded Existential Types. [Citation Graph (, )][DBLP]


  11. Fractional Ownerships for Safe Memory Deallocation. [Citation Graph (, )][DBLP]


  12. Ownership Downgrading for Ownership Types. [Citation Graph (, )][DBLP]


  13. A Fresh Look at Separation Algebras and Share Accounting. [Citation Graph (, )][DBLP]


  14. Weak updates and separation logic. [Citation Graph (, )][DBLP]


  15. Proving Copyless Message Passing. [Citation Graph (, )][DBLP]


  16. On Stratified Regions. [Citation Graph (, )][DBLP]


  17. Parallel Reduction in Resource Lambda-Calculus. [Citation Graph (, )][DBLP]


  18. Classical Natural Deduction for S4 Modal Logic. [Citation Graph (, )][DBLP]


  19. Bi-abductive Resource Invariant Synthesis. [Citation Graph (, )][DBLP]


  20. Certify Once, Trust Anywhere: Modular Certification of Bytecode Programs for Certified Virtual Machine. [Citation Graph (, )][DBLP]


  21. Asymptotic Resource Usage Bounds. [Citation Graph (, )][DBLP]


  22. The Higher-Order, Call-by-Value Applied Pi-Calculus. [Citation Graph (, )][DBLP]


  23. Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable. [Citation Graph (, )][DBLP]


  24. Refining Abstract Interpretation-Based Static Analyses with Hints. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002