User loginNavigation |
archivesType-sensitive control-flow analysisType-sensitive control-flow analysis, John Reppy, 2006 ML Workshop.
Near-Concrete Program InterpretationNear-Concrete Program Interpretation, By Paritosh Shroff, Scott F. Smith, Christian Skalka:
Very interesting paper that brings sophisticated higher order analysis to abstract interpretation. The paper proves the algorithm is exponential for certain types of programs, akin to ML type inference, and polynomial for first order programs. They have a working implementation in OCaml. "Practical" advantages of lazy evaluationHi all, regards |
Browse archivesActive forum topics |
Recent comments
16 weeks 1 day ago
16 weeks 1 day ago
16 weeks 1 day ago
38 weeks 3 days ago
42 weeks 5 days ago
44 weeks 2 days ago
44 weeks 2 days ago
47 weeks 3 hours ago
51 weeks 4 days ago
51 weeks 4 days ago