Relatively Complete Refinement Type System for Verification of Higher-Order Non-Deterministic Programs

Proceedings of the ACM on Programming Languages

doi 10.1145/3158100

Full Text

Abstract

Available in

Date

January 1, 2018

Authors

Tachio Terauchi

Publisher

Association for Computing Machinery (ACM)

Related search

Modular Verification of Higher-Order Methods With Mandatory Calls Specified by Model Programs

ACM SIGPLAN Notices

Computer Science

English

Automated Techniques for Higher-Order Program Verification

Progress in Informatics

English

Modular Verification of Higher-Order Methods With Mandatory Calls Specified by Model Programs

English

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking

Lecture Notes in Computer Science

Computer Science

Theoretical Computer Science

English

Strong Non-Interference and Type-Directed Higher-Order Masking

English

Towards Strong Higher-Order Automation for Fast Interactive Verification

English

A Practical Type Analysis for Verification of Modular Prolog Programs

English

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices

Computer Science

English

Higher-Order Unification Revisited: Complete Sets of Transformations

Journal of Symbolic Computation

Computational Mathematics

English