181 search results - page 20 / 37 » Programming Language Techniques for Cryptographic Proofs |
RTA
2007
Springer
15 years 3 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...
175
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
106
click to vote
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
104
click to vote
POPL
2011
ACM
14 years 14 days ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
ICFP
2000
ACM
15 years 2 months ago
2000
ACM
We show that a non-duplicating transformation into Continuation-Passing Style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for tradi...