811 search results - page 115 / 163 » Probabilistic Semantics and Program Analysis |
105
click to vote
ITA
2007
14 years 9 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
187
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
The high availability of video streams is making necessary mechanisms for indexing such contents in the Web world. In this paper we focus on news programs and we propose a mechani...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...