Results 1  10
of
40
Collapsible Pushdown Automata and Recursion Schemes
 23RD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
, 2008
"... Collapsible pushdown automata (CPDA) are a new kind of higherorder pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addition to the higherorder stack operations push i and pop i, CPDA have an important operation called collapse, whose effec ..."
Abstract

Cited by 33 (11 self)
 Add to MetaCart
Collapsible pushdown automata (CPDA) are a new kind of higherorder pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addition to the higherorder stack operations push i and pop i, CPDA have an important operation called collapse, whose effect is to “collapse ” a stack s to the prefix as indicated by the link from the topmost symbol of s. Our first result is that CPDA are equiexpressive with recursion schemes as generators of (possibly infinite) ranked trees. In one direction, we give a simple algorithm that transforms an ordern CPDA to an ordern recursion scheme that generates the same tree, uniformly for all n ≥ 0. In the other direction, using ideas from game semantics, we give an effective transformation of ordern recursion schemes (not assumed
Types and HigherOrder Recursion Schemes for Verification of HigherOrder Programs
, 2009
"... We propose a new verification method for temporal properties of higherorder functional programs, which takes advantage of Ong’s recent result on the decidability of the modelchecking problem for higherorder recursion schemes (HORS’s). A program is transformed to an HORS that generates a tree repr ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
We propose a new verification method for temporal properties of higherorder functional programs, which takes advantage of Ong’s recent result on the decidability of the modelchecking problem for higherorder recursion schemes (HORS’s). A program is transformed to an HORS that generates a tree representing all the possible event sequences of the program, and then the HORS is modelchecked. Unlike most of the previous methods for verification of higherorder programs, our verification method is sound and complete. Moreover, this new verification framework allows a smooth integration of abstract model checking techniques into verification of higherorder programs. We also present a typebased verification algorithm for HORS’s. The algorithm can deal with only a fragment of the properties expressed by modal μcalculus, but the algorithm and its correctness proof are (arguably) much simpler than those of Ong’s gamesemanticsbased algorithm. Moreover, while the HORS model checking problem is nEXPTIME in general, our algorithm is linear in the size of HORS, under the assumption that the sizes of types and specifications are bounded by a constant.
A type system equivalent to the modal mucalculus model checking of higherorder recursion schemes
 IN: PROCEEDINGS OF LICS
, 2009
"... The model checking of higherorder recursion schemes has important applications in the verification of higherorder programs. Ong has previously shown that the modal mucalculus model checking of trees generated by ordern recursion scheme is nEXPTIME complete, but his algorithm and its correctness ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
The model checking of higherorder recursion schemes has important applications in the verification of higherorder programs. Ong has previously shown that the modal mucalculus model checking of trees generated by ordern recursion scheme is nEXPTIME complete, but his algorithm and its correctness proof were rather complex. We give an alternative, typebased verification method: Given a modal mucalculus formula, we can construct a type system in which a recursion scheme is typable if, and only if, the (possibly infinite, ranked) tree generated by the scheme satisfies the formula. The model checking problem is thus reduced to a type checking problem. Our typebased approach yields a simple verification algorithm, and its correctness proof (constructed without recourse to game semantics) is comparatively easy to understand. Furthermore, the algorithm is polynomialtime in the size of the recursion scheme, assuming that the formula and the largest order and arity of nonterminals of the recursion scheme are fixed.
ModelChecking HigherOrder Functions
, 2009
"... We propose a novel typebased model checking algorithm for higherorder recursion schemes. As shown by Kobayashi, verification problems of higherorder functional programs can easily be translated into model checking problems of recursion schemes. Thus, the model checking algorithm serves as a basis ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
We propose a novel typebased model checking algorithm for higherorder recursion schemes. As shown by Kobayashi, verification problems of higherorder functional programs can easily be translated into model checking problems of recursion schemes. Thus, the model checking algorithm serves as a basis for verification of higherorder functional programs. To our knowledge, this is the first practical algorithm for model checking recursion schemes: all the previous algorithms always suffer from the nEXPTIME bottleneck, not only in the worst case, and there was no implementation of the algorithms. We have implemented a model checker for recursion schemes based on the proposed algorithm, and applied it to verification of functional programs, including reachability, flow analysis and resource usage verification problems. According to our experiments, the model checker is surprisingly fast: it could automatically verify a number of small but tricky higherorder functional programs in less than a second.
A finite semantics of simplytyped lambda terms for infinite runs of automata
 Procedings of the 20th international Workshop on Computer Science Logic (CSL ’06), volume 4207 of Lecture Notes in Computer Science
, 2006
"... Vol. 3 (3:1) 2007, pp. 1–23 ..."
Complexity of Model Checking Recursion Schemes for Fragments of the Modal MuCalculus
"... Abstract. Ong has shown that the modal mucalculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possiblyinfinite ranked trees generated by ordern recursion schemes is nEXPTIME complete. We consider two subclasses of APT and investigate t ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
Abstract. Ong has shown that the modal mucalculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possiblyinfinite ranked trees generated by ordern recursion schemes is nEXPTIME complete. We consider two subclasses of APT and investigate the complexity of the respective acceptance problems. The main results are that, for APT with a single priority, the problem is still nEXPTIME complete; whereas, for APT with a disjunctive transition function, the problem is (n − 1)EXPTIME complete. This study was motivated by Kobayashi’s recent work showing that the resource usage verification for functional programs can be reduced to the model checking of recursion schemes. As an application, we show that the resource usage verification problem is (n − 1)EXPTIME complete. 1
HigherOrder MultiParameter Tree Transducers . . .
, 2010
"... We introduce higherorder, multiparameter, tree transducers (HMTTs, for short), which are kinds of higherorder tree transducers that take input trees and output a (possibly infinite) tree. We study the problem of checking whether the tree generated by a given HMTT conforms to a given output specif ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We introduce higherorder, multiparameter, tree transducers (HMTTs, for short), which are kinds of higherorder tree transducers that take input trees and output a (possibly infinite) tree. We study the problem of checking whether the tree generated by a given HMTT conforms to a given output specification, provided that the input trees conform to input specifications (where both input/output specifications are regular tree languages). HMTTs subsume higherorder recursion schemes and ordinary tree transducers, so that their verification has a number of potential applications to verification of functional programs using recursive data structures, including resource usage verification, string analysis, and exact typechecking of XMLprocessing programs. We propose a sound but incomplete verification algorithm for the HMTT verification problem: the algorithm reduces the verification problem to a modelchecking problem for higherorder recursion schemes extended with finite data domains, and then uses (an extension of) Kobayashi’s algorithm for modelchecking recursion schemes. While the algorithm is incomplete (indeed, as we show in the paper, the verification problem is undecidable in general), it is sound and complete for a subclass of HMTTs called linear HMTTs. We have applied our HMTT verification algorithm to various program verification problems and obtained promising results.
Dependent Types from Counterexamples
, 2010
"... Motivated by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on programmers to supply the candidate (or the correct) types for the recursive functions and instead does counterexampl ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Motivated by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on programmers to supply the candidate (or the correct) types for the recursive functions and instead does counterexampleguided refinement to automatically generate the set of candidate dependent types. The main idea is to extend the classical fixedpoint type inference routine to return a counterexample if the program is found untypable with the current set of candidate types. Then, an interpolating theorem prover is used to validate the counterexample as a real type error or generate additional candidate dependent types to refute the spurious counterexample. The process is repeated until either a real type error is found or sufficient candidates are generated to prove the program typable. Our system makes nontrivial use of “linear” intersection types in the refinement phase. The paper presents the type inference system and reports on the experience with a prototype implementation that infers dependent types for a subset of the Ocaml language. The implementation infers dependent types containing predicates from the quantifierfree theory of linear arithmetic and equality with uninterpreted function symbols.
Symbolic backwardsreachability analysis for higherorder pushdown systems
 IN FOSSACS
, 2007
"... Higherorder pushdown systems (PDSs) generalise pushdown systems through the use of higherorder stacks; that is, a nested “stack of stacks ” structure. These systems may be used to model higherorder programs and are closely related to the Caucal hierarchy of infinite graphs and safe higherorder ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Higherorder pushdown systems (PDSs) generalise pushdown systems through the use of higherorder stacks; that is, a nested “stack of stacks ” structure. These systems may be used to model higherorder programs and are closely related to the Caucal hierarchy of infinite graphs and safe higherorder recursion schemes. We generalise higherorder PDSs to higherorder Alternating PDSs (APDSs) and consider the backwardsreachability problem over these systems. This builds on and extends previous work into pushdown systems and contextfree higherorder processes in a nontrivial manner. In particular, we show that the set of configurations from which a regular set of higherorder APDS configurations is reachable is regular and computable in nEXPTIME. In fact, the problem is nEXPTIMEcomplete. We show that this work has several applications in the verification of higherorder PDSs, such as lineartime modelchecking, alternationfree µcalculus modelchecking and the computation of winning regions of reachability games.
DECIDABILITY OF HIGHERORDER MATCHING
"... Abstract. We show that the higherorder matching problem is decidable using a gametheoretic argument. ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. We show that the higherorder matching problem is decidable using a gametheoretic argument.