NDLI: Temporal verification of higher-order functional programs

Content Provider	ACM Digital Library
Author	Kobayashi, Naoki Unno, Hiroshi Terauchi, Tachio Sato, Ryosuke Murase, Akihiro
Abstract	We present an automated approach to verifying arbitrary omega-regular properties of higher-order functional programs. Previous automated methods proposed for this class of programs could only handle safety properties or termination, and our approach is the first to be able to verify arbitrary omega-regular liveness properties. Our approach is automata-theoretic, and extends our recent work on binary-reachability-based approach to automated termination verification of higher-order functional programs to fair termination published in ESOP 2014. In that work, we have shown that checking disjunctive well-foundedness of (the transitive closure of) the ``calling relation'' is sound and complete for termination. The extension to fair termination is tricky, however, because the straightforward extension that checks disjunctive well-foundedness of the fair calling relation turns out to be unsound, as we shall show in the paper. Roughly, our solution is to check fairness on the transition relation instead of the calling relation, and propagate the information to determine when it is necessary and sufficient to check for disjunctive well-foundedness on the calling relation. We prove that our approach is sound and complete. We have implemented a prototype of our approach, and confirmed that it is able to automatically verify liveness properties of some non-trivial higher-order programs.
Starting Page	57
Ending Page	68
Page Count	12
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2914770.2837667
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	51
Issue Number	1
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Bi- nary reachability analysis Automata-theoretic verification Higher- order programs Cegar Temporal properties Automatic verification
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Temporal verification of higher-order functional programs

Automatically disproving fair termination of higher-order functional programs

Unboundedness and downward closures of higher-order pushdown automata

Automating relatively complete verification of higher-order functional programs

Verifying higher-order functional programs with pattern-matching algebraic data types

Automatic verification of pointer programs using monadic second-order logic

Predicate abstraction and CEGAR for higher-order model checking

Termination analysis and call graph construction for higher-order functional programs

Towards automatic debugging of programs

Temporal verification of higher-order functional programs

Similar Documents

Temporal verification of higher-order functional programs

Automatically disproving fair termination of higher-order functional programs

Unboundedness and downward closures of higher-order pushdown automata

Automating relatively complete verification of higher-order functional programs

Verifying higher-order functional programs with pattern-matching algebraic data types

Automatic verification of pointer programs using monadic second-order logic

Predicate abstraction and CEGAR for higher-order model checking

Termination analysis and call graph construction for higher-order functional programs

Towards automatic debugging of programs

Temporal verification of higher-order functional programs