3342 search results - page 557 / 669 » Automating Abstract Interpretation |
CADE
2006
Springer
14 years 10 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
CADE
2005
Springer
14 years 10 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
Abstract. Physical database design tools rely on a DBA-provided workload to pick an "optimal" set of indexes and materialized views. Such an approach fails to capture sce...