82 search results - page 2 / 17 » Predicate abstraction and CEGAR for higher-order model check... |
102
click to vote
POPL
1997
ACM
15 years 3 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
93
Voted
APLAS
2010
ACM
14 years 12 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
CAV
2009
Springer
16 years 5 days ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
104
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...