756 search results - page 138 / 152 » Using Logic Programs to Reason about Infinite Sets |
PLPV
2010
ACM
14 years 5 months ago
2010
ACM
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
SIGADA
2004
Springer
14 years 1 months ago
2004
Springer
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....