182 search results - page 12 / 37 » A Theory of Strict P-completeness |
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
TPHOL
2002
IEEE
14 years 15 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization an...
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
CONCUR
2012
Springer
11 years 10 months ago
2012
Springer
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...