2976 search results - page 495 / 596 » On the bounded integer programming |
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...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...
APLAS
2009
ACM
14 years 2 months ago
2009
ACM
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...