research-article

Types and higher-order recursion schemes for verification of higher-order programs

Author:

Naoki KobayashiAuthors Info & Claims

POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 416 - 428

https://doi.org/10.1145/1480881.1480933

Published: 21 January 2009 Publication History

Abstract

We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the model-checking problem for higher-order 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 model-checked. Unlike most of the previous methods for verification of higher-order 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 higher-order programs. We also present a type-based verification algorithm for HORS's. The algorithm can deal with only a fragment of the properties expressed by modal mu-calculus, but the algorithm and its correctness proof are (arguably) much simpler than those of Ong's game-semantics-based algorithm. Moreover, while the HORS model checking problem is n-EXPTIME in general, our algorithm is linear in the size of HORS, under the assumption that the sizes of types and specification formulas are bounded by a constant.

References

[1]

K. Aehlig. A finite semantics of simply-typed lambda terms for infinite runs of automata. Logical Methods in Computer Science, 3(3), 2007.

[2]

K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. The monadic second order theory of trees given by arbitrary level--tworecursion schemes is decidable. In TLCA 2005, volume 3461 of LNCS, pages 39--54.Springer-Verlag, 2005.

Digital Library

[3]

T. Ball, R. Majumdar, T. D. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI 2001, pages 203--213, 2001.

Digital Library

[4]

T. Ball and S. K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, pages 1--3, 2002.

Digital Library

[5]

D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar. The software model checker blast. International Journal on Software Tools for Technology Transfer, 9(5-6):505--525, 2007.

Digital Library

[6]

S. Chaki, S. Rajamani, and J. Rehof. Types as models: Model checking message-passing programs. In Proc. of POPL, pages 45--57, 2002.

Digital Library

[7]

B. Cook, A. Gotsman, A. Podelski, A. Rybalchenko, and M. Y. Vardi. Proving that programs eventually do something good. In Proc. of POPL, pages 265--276, 2007.

Digital Library

[8]

R. DeLine and M. Fähndrich. Adoption and focus: Practical linear types for imperative programming. In Proc. of PLDI, 2002.

Digital Library

[9]

E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS 1991, pages 368--377, 1991.

Digital Library

[10]

J. Field, D. Goyal, G.a Ramalingam, and E. Yahav. Typestate verification: Abstraction techniques and complexity Sci. Comput. Program., 58(1-2):57--82, 2005.

Digital Library

[11]

S. J. Fink, E. Yahav, N. Dor, G. Ramalingam, and E. Geay. Effective typestate verification in the presence of aliasing. ACM Trans. Softw. Eng. Methodol., 17(2), 2008.

Digital Library

[12]

J. S. Foster, T. Terauchi, and A. Aiken. ACM Trans. Softw. Eng. Methodol., 17(2), 2008. In Proc. of PLDI, pages 1--12, 2002.

Digital Library

[13]

C. Haack and J. B. Wells. Type error slicing in implicitly typed higher-order languages. Science of Computer Programming, 50(1-3):189--224, 2004.

Digital Library

[14]

M. Hague and C.-H. L. Ong. Symbolic backwards-reachability analysis for higher-order pushdown In FoSSaCS 2007, volume 4423 of LNCS, pages 213--227. Springer-Verlag, 2007.

Digital Library

[15]

N. Heintze and D. A. McAllester. Linear-time subtransitive control flow analysis. In Proc. of PLDI, pages 261--272, 1997.

Digital Library

[16]

T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. of POPL, pages 58--70, 2002.

Digital Library

[17]

H. Hosoya, J. Vouillon, and B. C. Pierce. Regular expression types for xml. ACM Trans. Program. Lang. Syst., 27(1):46--90, 2005.

Digital Library

[18]

A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Theor. Comput. Sci., 311(1-3):121--163, 2004.

Digital Library

[19]

A. Igarashi and N. Kobayashi. Resource usage analysis. ACM Trans. Prog. Lang. Syst., 27(2):264--313, 2005. Preliminary summary appeared in Proceedings of POPL 2002.

Digital Library

[20]

F. Iwama, A. Igarashi, and N. Kobayashi. Resource usage analysis for a functional language with exceptions. In Proceedings of ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation (PEPM 2006), pages 38--47. ACM Press, 2006.

Digital Library

[21]

D. Kikuchi and N. Kobayashi. Type-based verification of correspondence assertions for communication protocols. In Proceedings of APLAS 2007, volume 4807 of LNCS, pages 191--205. Springer-Verlag, 2007.

Digital Library

[22]

T. Knapik, D. Niwinski, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. Deciding monadic theories of hyperalgebraic trees. Springer-Verlag, 2001.

[23]

T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS 2002, volume 2303 of LNCS, pages 205--222. Springer-Verlag, 2002.

Digital Library

[24]

T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. Unsafe grammars and panic automata. Springer-Verlag, 2005.

[25]

N. Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. An extended version, available from http://www.kb.ecei.tohoku.ac.jp/ koba/papers/hors.pdf, 2008.

[26]

P. Lam, V. Kuncak, and M. C. Rinard. Generalized typestate checking for data structure consistency. In VMCAI 2005, volume 3385 of LNCS, pages 430--447.Springer-Verlag, 2005.

Digital Library

[27]

M. Naik. A type system equivalent to a model checker. Master Thesis, Purdue University.

[28]

M. Naik and J. Palsberg. A type system equivalent to a model checker. In ESOP 2005, volume 3444 of LNCS, pages 374--388. Springer-Verlag, 2005.

Digital Library

[29]

C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS 2006, pages 81--90. IEEE Computer Society Press, 2006.

Digital Library

[30]

J. Rehof and T. Mogensen. Tractable constraints in finite semilattices. Science of Computer Programming, 35(2):191--221, 1999.

Digital Library

[31]

P. M. Rondon, M. Kawaguchi, and R. Jhala. Liquid types. In PLDI 2008, pages 159--169, 2008.

Digital Library

[32]

R. E. Strom and S. Yemini. Typestate: A programming language concept for enhancing software reliability. Transactions on Software Engineering, 12(1):157--171, 1986.

Digital Library

[33]

W. Thomas. Languages, automata, and logic. In Handbook of formal languages, vol. 3, pages 389--455, 1997.

[34]

H. Unno and N. Kobayashi. On-demand refinement of dependent types. In Proceedings of FLOPS 2008, volume 4989 of LNCS, pages 81--96. Springer-Verlag, 2008.

Digital Library

Cited By

Accattoli BLancelot AManzonetto GVanoni G(2025)Interaction EquivalenceProceedings of the ACM on Programming Languages10.1145/37048919:POPL(1627-1656)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704891
Kobayashi N(2025)On Decidable and Undecidable Extensions of Simply Typed Lambda CalculusProceedings of the ACM on Programming Languages10.1145/37048759:POPL(1136-1166)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704875
Sekiyama TUnno H(2024)Higher-Order Model Checking of Effect-Handling Programs with Answer-Type ModificationProceedings of the ACM on Programming Languages10.1145/36898058:OOPSLA2(2662-2691)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689805
Show More Cited By

Index Terms

Types and higher-order recursion schemes for verification of higher-order programs

Recommendations

Types and higher-order recursion schemes for verification of higher-order programs
POPL '09

We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the model-checking problem for higher-order recursion schemes (HORS's). A program is ...
Higher-order multi-parameter tree transducers and recursion schemes for program verification
POPL '10: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infinite) tree. We study the problem of checking whether the tree generated by ...
Higher-order multi-parameter tree transducers and recursion schemes for program verification
POPL '10

We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infinite) tree. We study the problem of checking whether the tree generated by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2009

464 pages

ISBN:9781605583792

DOI:10.1145/1480881

General Chair:
Zhong Shao
Yale University, USA
,
Program Chair:
Benjamin C. Pierce
University of Pennsylvania, USA

ACM SIGPLAN Notices Volume 44, Issue 1
POPL '09
January 2009
453 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1594834
Issue’s Table of Contents

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 January 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL09

Sponsor:

POPL09: The 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 21 - 23, 2009

GA, Savannah, USA

Acceptance Rates

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

162
Total Citations
View Citations
778
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Accattoli BLancelot AManzonetto GVanoni G(2025)Interaction EquivalenceProceedings of the ACM on Programming Languages10.1145/37048919:POPL(1627-1656)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704891
Kobayashi N(2025)On Decidable and Undecidable Extensions of Simply Typed Lambda CalculusProceedings of the ACM on Programming Languages10.1145/37048759:POPL(1136-1166)Online publication date: 9-Jan-2025
https://dl.acm.org/doi/10.1145/3704875
Sekiyama TUnno H(2024)Higher-Order Model Checking of Effect-Handling Programs with Answer-Type ModificationProceedings of the ACM on Programming Languages10.1145/36898058:OOPSLA2(2662-2691)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689805
Ciobanu LZetzsche GSobocinski PLago UEsparza J(2024)Slice closures of indexed languages and word equations with counting constraintsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662134(1-12)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662134
Gavazzo FTreglia RVanoni G(2024)Monadic Intersection Types, RelationallyProgramming Languages and Systems10.1007/978-3-031-57262-3_2(22-51)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57262-3_2
Sato R(2023)Refinement Types for Call-by-name ProgramsJournal of Information Processing10.2197/ipsjjip.31.70831(708-721)Online publication date: 2023
https://doi.org/10.2197/ipsjjip.31.708
Katsura HKobayashi NSato R(2023)Higher-Order Property-Directed ReachabilityProceedings of the ACM on Programming Languages10.1145/36078317:ICFP(48-77)Online publication date: 31-Aug-2023
https://dl.acm.org/doi/10.1145/3607831
Farzan ANicolet V(2023)Partial bounding for recursive function synthesisFormal Methods in System Design10.1007/s10703-023-00417-y63:1-3(172-205)Online publication date: 16-May-2023
https://doi.org/10.1007/s10703-023-00417-y
Cirstea HLermusiaux PMoreau P(2021)Static analysis of pattern-free propertiesProceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming10.1145/3479394.3479404(1-13)Online publication date: 6-Sep-2021
https://dl.acm.org/doi/10.1145/3479394.3479404
Birkedal LDinsdale-Young TGuéneau AJaber GSvendsen KTzevelekos N(2021)Theorems for free from separation logic specificationsProceedings of the ACM on Programming Languages10.1145/34735865:ICFP(1-29)Online publication date: 19-Aug-2021
https://dl.acm.org/doi/10.1145/3473586
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten