Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("LERNER, Sorin")

Results 1 to 8 of 8

  • Page / 1
Export

Selection :

  • and

Taming Wildcards in Java's Type SystemTATE, Ross; LEUNG, Alan; LERNER, Sorin et al.ACM SIGPLAN notices. 2011, Vol 46, Num 6, pp 614-627, issn 1523-2867, 14 p.Conference Paper

Deep Typechecking and RefactoringTATLOCK, Zachary; TUCKER, Chris; SHUFFELTON, David et al.ACM SIGPLAN notices. 2008, Vol 43, Num 10, pp 37-51, issn 1523-2867, 15 p.Conference Paper

ESP: Path-sensitive program verification in polynomial timeDAS, Manuvir; LERNER, Sorin; SEIGLE, Mark et al.ACM SIGPLAN notices. 2002, Vol 37, Num 5, pp 57-68, issn 1523-2867Conference Paper

Generating Compiler Optimizations from ProofsTATE, Ross; STEPP, Michael; LERNER, Sorin et al.ACM SIGPLAN notices. 2010, Vol 45, Num 1, pp 389-402, issn 1523-2867, 14 p.Conference Paper

Proving Optimizations Correct using Parameterized Program EquivalenceKUNDU, Sudipta; TATLOCK, Zachary; LERNER, Sorin et al.ACM SIGPLAN notices. 2009, Vol 44, Num 6, pp 327-337, issn 1523-2867, 11 p.Conference Paper

Automatically proving the correctness of compiler optimizationsLERNER, Sorin; MILLSTEIN, Todd; CHAMBERS, Craig et al.ACM SIGPLAN notices. 2003, Vol 38, Num 5, pp 220-231, issn 1523-2867, 12 p.Conference Paper

Automated soundness proofs for dataflow analyses and transformations via local rulesLERNER, Sorin; MILLSTEIN, Todd; RICE, Erika et al.ACM SIGPLAN notices. 2005, Vol 40, Num 1, pp 364-377, issn 1523-2867, 14 p.Conference Paper

Speeding up dataflow analysis using flow-insensitive pointer analysisADAMS, Stephen; BALL, Thomas; DAS, Manuvir et al.Lecture notes in computer science. 2002, pp 230-246, issn 0302-9743, isbn 3-540-44235-9, 17 p.Conference Paper

  • Page / 1