3047 search results - page 30 / 610 » On the Meaning of Logical Completeness |
CSFW
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
ICFP
2007
ACM
14 years 8 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
IGPL
2008
13 years 8 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
TECS
2010
13 years 6 months ago
2010
ENTCS
2008
13 years 8 months ago
2008
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...