93 search results - page 3 / 19 » Making numerical program analysis fast |
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
MOC
2011
13 years 7 days ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
VEE
2012
ACM
12 years 25 days ago
2012
ACM
Dynamic data flow tracking (DFT) deals with tagging and tracking data of interest as they propagate during program execution. DFT has been repeatedly implemented by a variety of ...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
EOR
2011
13 years 8 days ago
2011
: We analyse a single echelon single item inventory system where the demand and the lead time are stochastic. Demand is modelled as a compound Poisson process and the stock is cont...