82 search results - page 3 / 17 » Predicate abstraction and CEGAR for higher-order model check... |
POPL
1990
ACM
13 years 9 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
ESOP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...