2137 search results - page 258 / 428 » Proving Abstract Non-interference |
249
Voted
ICFP
2009
ACM
16 years 4 months ago
2009
ACM
rrent ML, synchronization abstractions can be defined and passed as values, much like functions in ML. This mechanism admits a powerful, modular style of concurrent programming, c...
238
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
129
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
133
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
172
click to vote
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...