107 search results - page 10 / 22 » Specifying the Correctness of Binding-Time Analysis |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
LOPSTR
2001
Springer
13 years 11 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
FOAL
2009
ACM
13 years 11 months ago
2009
ACM
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
POPL
2012
ACM
12 years 2 months ago
2012
ACM
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...