374 search results - page 26 / 75 » Modular Semantics and Logics of Classes |
233
click to vote
ESOP
2004
Springer
16 years 25 days ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
251
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new binary sequ...
219
click to vote
PLDI
2009
ACM
16 years 2 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
217
click to vote
FUIN
2008
15 years 7 months ago
2008
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
243
click to vote
ICFP
2005
ACM
16 years 7 months ago
2005
ACM
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...