128 search results - page 16 / 26 » Verifying Process Algebra Proofs in Type Theory |
131
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
124
Voted
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
141
Voted
PLDI
2003
ACM
15 years 9 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...
240
Voted
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
133
Voted
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...