811 search results - page 82 / 163 » Probabilistic Semantics and Program Analysis |
247
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
142
Voted
RTA
2007
Springer
15 years 8 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
146
Voted
PEPM
1993
ACM
15 years 6 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
111
Voted
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
101
Voted
ICFP
2001
ACM
16 years 2 months ago
2001
ACM
It is possible to translate code written in Emacs Lisp or another Lisp dialect which uses dynamic scoping to a more modern programming language with lexical scoping while largely ...