User loginNavigation |
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. By naasking at 2007-05-30 02:35 | LtU Forum | previous forum topic | next forum topic | other blogs | 10724 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 14 hours ago
6 weeks 18 hours ago
6 weeks 18 hours ago
28 weeks 1 day ago
32 weeks 3 days ago
34 weeks 1 day ago
34 weeks 1 day ago
36 weeks 5 days ago
41 weeks 3 days ago
41 weeks 3 days ago