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 | 9878 reads
|
Browse archivesActive forum topics |
Recent comments
3 days 15 hours ago
1 week 6 days ago
2 weeks 6 days ago
3 weeks 1 day ago
3 weeks 1 day ago
3 weeks 2 days ago
4 weeks 6 days ago
4 weeks 6 days ago
5 weeks 14 hours ago
5 weeks 21 hours ago