Conferences in DBLP

SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (pldi)
2008 (conf/pldi/2008)

1. 
   Checking race freedom via linear programming. [Citation Graph (, )][DBLP]
   
   
2. 
   Race directed random testing of concurrent programs. [Citation Graph (, )][DBLP]
   
   
3. 
   Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance. [Citation Graph (, )][DBLP]
   
   
4. 
   A study of concurrent real-time garbage collectors. [Citation Graph (, )][DBLP]
   
   
5. 
   Conditional correlation analysis for safe region-based memory management. [Citation Graph (, )][DBLP]
   
   
6. 
   Automatic volume management for programmable microfluidics. [Citation Graph (, )][DBLP]
   
   
7. 
   Foundations of the C++ concurrency memory model. [Citation Graph (, )][DBLP]
   
   
8. 
   Expressive and safe static reflection with MorphJ. [Citation Graph (, )][DBLP]
   
   
9. 
   Iterative optimization in the polyhedral model: part ii, multidimensional time. [Citation Graph (, )][DBLP]
   
   
10. 
    A practical automatic polyhedral parallelizer and locality optimizer. [Citation Graph (, )][DBLP]
    
    
11. 
    Orchestrating the execution of stream programs on multicore platforms. [Citation Graph (, )][DBLP]
    
    
12. 
    Deriving linearizable fine-grained concurrent objects. [Citation Graph (, )][DBLP]
    
    
13. 
    Sketching concurrent data structures. [Citation Graph (, )][DBLP]
    
    
14. 
    SharC: checking data sharing strategies for multithreaded C. [Citation Graph (, )][DBLP]
    
    
15. 
    Liquid types. [Citation Graph (, )][DBLP]
    
    
16. 
    Certifying low-level programs with hardware interrupts and preemptive threads. [Citation Graph (, )][DBLP]
    
    
17. 
    Type-preserving compilation for large-scale optimizing object-oriented compilers. [Citation Graph (, )][DBLP]
    
    
18. 
    Quantitative information flow as network flow capacity. [Citation Graph (, )][DBLP]
    
    
19. 
    Grammar-based whitebox fuzzing. [Citation Graph (, )][DBLP]
    
    
20. 
    Register allocation by puzzle solving. [Citation Graph (, )][DBLP]
    
    
21. 
    Copy coalescing by graph recoloring. [Citation Graph (, )][DBLP]
    
    
22. 
    Efficient program execution indexing. [Citation Graph (, )][DBLP]
    
    
23. 
    Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis. [Citation Graph (, )][DBLP]
    
    
24. 
    Explaining failures of program analyses. [Citation Graph (, )][DBLP]
    
    
25. 
    Sound, complete and scalable path-sensitive analysis. [Citation Graph (, )][DBLP]
    
    
26. 
    Program analysis as constraint solving. [Citation Graph (, )][DBLP]
    
    
27. 
    Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs. [Citation Graph (, )][DBLP]
    
    
28. 
    Inferring locks for atomic sections. [Citation Graph (, )][DBLP]
    
    
29. 
    Dataflow analysis for concurrent programs using datarace detection. [Citation Graph (, )][DBLP]
    
    
30. 
    XMem: type-safe, transparent, shared memory for cross-runtime communication and coordination. [Citation Graph (, )][DBLP]
    
    
31. 
    Discovering properties about arrays in simple programs. [Citation Graph (, )][DBLP]
    
    
32. 
    Full functional verification of linked data structures. [Citation Graph (, )][DBLP]
    
    
33. 
    Fair stateless model checking. [Citation Graph (, )][DBLP]
    
    
34. 
    Model checking transactional memories. [Citation Graph (, )][DBLP]