95 search results - page 4 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
ASWEC
2010
IEEE
13 years 9 months ago
2010
IEEE
—Formal models are often used to verify systems and prove their correctness, and ensure that transformed models remain consistent to the original system. However, formal techniqu...
JFP
2006
13 years 8 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
JOC
2006
13 years 8 months ago
2006
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
ASIACRYPT
2009
Springer
14 years 6 days ago
2009
Springer
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...