Conferences in DBLP

Symposium on Principles of Programming Languages (POPL) (popl)
2010 (conf/popl/2010)

1. 
   Reconfigurable asynchronous logic automata: (RALA). [Citation Graph (, )][DBLP]
   
   
2. 
   On the verification problem for weak memory models. [Citation Graph (, )][DBLP]
   
   
3. 
   Coarse-grained transactions. [Citation Graph (, )][DBLP]
   
   
4. 
   Sequential verification of serializability. [Citation Graph (, )][DBLP]
   
   
5. 
   Compositional may-must program analysis: unleashing the power of alternation. [Citation Graph (, )][DBLP]
   
   
6. 
   Continuity analysis of programs. [Citation Graph (, )][DBLP]
   
   
7. 
   Program analysis via satisfiability modulo path programs. [Citation Graph (, )][DBLP]
   
   
8. 
   A simple, verified validator for software pipelining. [Citation Graph (, )][DBLP]
   
   
9. 
   A verified compiler for an impure functional language. [Citation Graph (, )][DBLP]
   
   
10. 
    Verified just-in-time compiler on x86. [Citation Graph (, )][DBLP]
    
    
11. 
    Dependent types from counterexamples. [Citation Graph (, )][DBLP]
    
    
12. 
    Low-level liquid types. [Citation Graph (, )][DBLP]
    
    
13. 
    Type inference for datalog with complex type hierarchies. [Citation Graph (, )][DBLP]
    
    
14. 
    From Boolean to quantitative notions of correctness. [Citation Graph (, )][DBLP]
    
    
15. 
    Nominal system T. [Citation Graph (, )][DBLP]
    
    
16. 
    A theory of indirection via approximation. [Citation Graph (, )][DBLP]
    
    
17. 
    A relational modal logic for higher-order stateful ADTs. [Citation Graph (, )][DBLP]
    
    
18. 
    Decision procedures for algebraic data types with abstractions. [Citation Graph (, )][DBLP]
    
    
19. 
    Automatic numeric abstractions for heap-manipulating programs. [Citation Graph (, )][DBLP]
    
    
20. 
    Static determination of quantitative resource usage for higher-order programs. [Citation Graph (, )][DBLP]
    
    
21. 
    Toward a verified relational database management system. [Citation Graph (, )][DBLP]
    
    
22. 
    Counterexample-guided focus. [Citation Graph (, )][DBLP]
    
    
23. 
    Structuring the verification of heap-manipulating programs. [Citation Graph (, )][DBLP]
    
    
24. 
    Dependent types and program equivalence. [Citation Graph (, )][DBLP]
    
    
25. 
    Pure subtype systems. [Citation Graph (, )][DBLP]
    
    
26. 
    Modular session types for distributed object-oriented programming. [Citation Graph (, )][DBLP]
    
    
27. 
    From program verification to program synthesis. [Citation Graph (, )][DBLP]
    
    
28. 
    Abstraction-guided synthesis of synchronization. [Citation Graph (, )][DBLP]
    
    
29. 
    Programming with angelic nondeterminism. [Citation Graph (, )][DBLP]
    
    
30. 
    Contracts made manifest. [Citation Graph (, )][DBLP]
    
    
31. 
    Threesomes, with and without blame. [Citation Graph (, )][DBLP]
    
    
32. 
    Integrating typed and untyped code in a scripting language. [Citation Graph (, )][DBLP]
    
    
33. 
    Generating compiler optimizations from proofs. [Citation Graph (, )][DBLP]
    
    
34. 
    Automatically generating instruction selectors using declarative machine descriptions. [Citation Graph (, )][DBLP]
    
    
35. 
    Semantics and algorithms for data-dependent grammars. [Citation Graph (, )][DBLP]
    
    
36. 
    Paralocks: role-based information flow control and beyond. [Citation Graph (, )][DBLP]
    
    
37. 
    Modular verification of security protocol code by typing. [Citation Graph (, )][DBLP]
    
    
38. 
    Dynamically checking ownership policies in concurrent c/c++ programs. [Citation Graph (, )][DBLP]
    
    
39. 
    Nested interpolants. [Citation Graph (, )][DBLP]
    
    
40. 
    Monads in action. [Citation Graph (, )][DBLP]
    
    
41. 
    Higher-order multi-parameter tree transducers and recursion schemes for program verification. [Citation Graph (, )][DBLP]