Verification of Tree-Processing Programs via Higher-Order Model Checking

Unno, Hiroshi; Tabuchi, Naoshi; Kobayashi, Naoki

doi:10.1007/978-3-642-17164-2_22

Cited by 15 publications

(13 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method cannot handle regular properties (such as "a and b occur alternately") and numerical properties (such as "x + y ≤ z" where x, y, z are the length of lists). Unno et al [25] also proposed a verification method for higherorder tree processing functional programs, which is based on a verification method for higher-order multi-tree transducers [14]. Their method can verify regular properties of recursive data structures provided that certain invariant annotations are given.…”

Section: Verification Of Higher-order Programs With Recursive Data Stmentioning

confidence: 97%

“…There are several studies [5,10,11,21,[24][25][26][27][28] that aim to infer dependent types for higher-order programs with recursive data structures. Rondon et al's liquid type inference [11,21] is a semi-automated verification method that requires users to provide templates of predicates, called logical qualifiers.…”

Section: Verification Of Higher-order Programs With Recursive Data Stmentioning

confidence: 99%

See 1 more Smart Citation

Towards a scalable software model checker for higher-order programs

Satô

Unno

Kobayashi

2013

Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation

Self Cite

View full text Add to dashboard Cite

In our recent paper, we have shown how to construct a fullyautomated program verification tool (so called a "software model checker") for a tiny subset of functional language ML, by combining higher-order model checking, predicate abstraction, and CE-GAR. This can be viewed as a higher-order counterpart of previous software model checkers for imperative languages like BLAST and SLAM. The naïve application of the proposed approach, however, suffered from scalability problems, both in terms of efficiency and supported language features. To obtain more scalable software model checkers for full-scale functional languages, we propose a series of optimizations and extensions of the previous approach. Among others, we introduce (i) selective CPS transformation, (ii) selective predicate abstraction, and (iii) refined predicate discovery as optimization techniques; and propose (iv) functional encoding of recursive data structures and control operations to support a larger subset of ML. We have implemented the proposed methods, and obtained promising results.

show abstract

Section: Verification Of Higher-order Programs With Recursive Data Stmentioning

confidence: 97%

Section: Verification Of Higher-order Programs With Recursive Data Stmentioning

confidence: 99%

Towards a scalable software model checker for higher-order programs

Satô

Unno

Kobayashi

2013

Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Kobayashi et al [31] introduced a restricted class of higher-order treeprocessing programs called higher-order multi-parameter tree transducers, and proposed a method to verify that treeprocessing programs conform to input and output specifications. They [43] later extended the method to handle arbitrary tree-processing functional programs, by requiring user annotations on certain invariants. Ramsay and Ong [38] combined a conventional static analysis and higher-order model checking to deal with programs manipulating recursive data types.…”

Section: State Of the Artmentioning

confidence: 99%

“…For the efficiency, besides the improvement of higher-order model checkers as discussed above, abstraction techniques should also be improved. As fully automated verification of large programs is difficult, finding a good combination with user annotations [43] would also be important. As for the language features, techniques for supporting integers [30] and algebraic data structures [31,38] have been proposed, but they should be improved and integrated.…”

Section: B Practice 1) Better Higher-order Model Checkersmentioning

confidence: 99%

Higher-Order Model Checking: From Theory to Practice

Kobayashi¹

2011

2011 IEEE 26th Annual Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

The model checking of higher-order recursion schemes (higher-order model checking for short) has been actively studied in the last decade, and has seen significant progress in both theory and practice. From a practical perspective, higher-order model checking provides a foundation for software model checkers for functional programming languages such as ML and Haskell. This short article aims to provide an overview of the recent progress in higher-order model checking and discuss future directions.

show abstract

“…Unno et al [28] proposes a verification method for tree processing programs using higher-order macro tree transducers utilizing annotations. Since their method can be applied to infinite-trees, it can also handle bisimulation-generic graph transformations.…”

Section: Relaxing the Annotation Burdenmentioning

confidence: 99%

Graph-transformation verification using monadic second-order logic

Inaba

Hidaka

et al. 2011

Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming

View full text Add to dashboard Cite

This paper presents a new approach to solving the problem of verification of graph transformation, by proposing a new static verification algorithm for the Core UnCAL, the query algebra for graph-structured databases proposed by Bunemann et al. Given a graph transformation annotated with schema information, our algorithm statically verifies that any graph satisfying the input schema is converted by the transformation to a graph satisfying the output schema. We tackle the problem by first reformulating the semantics of UnCAL into monadic second-order logic (MSO). The logic-based foundation allows to express the schema satisfaction of transformations as the validity of MSO formulas over graph structures. Then by exploiting the two established properties of UnCAL called bisimulation-genericity and compactness, we reduce the problem to the validity of MSO over trees, which has a sound and complete decision procedure. The algorithm has been efficiently implemented; all the graph transformations in this paper and the system web page can be verified within several seconds.

show abstract

Verification of Tree-Processing Programs via Higher-Order Model Checking

Cited by 15 publications

References 12 publications

Towards a scalable software model checker for higher-order programs

Towards a scalable software model checker for higher-order programs

Higher-Order Model Checking: From Theory to Practice

Graph-transformation verification using monadic second-order logic

Contact Info

Product

Resources

About