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

doi 10.1145/1297027.1297053
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

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

ACM SIGPLAN Notices
Computer Science
2007English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Proceedings of the ACM on Programming Languages
2018English

Modular Verification of Programs With Effects and Effect Handlers in Coq

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

A Practical Type Analysis for Verification of Modular Prolog Programs

2008English

Automated Techniques for Higher-Order Program Verification

Progress in Informatics
2013English

Compositional Verification of Reactive Systems Specified by Graph Transformation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

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

ACM SIGPLAN Notices
Computer Science
2015English

Modular Verification of Security Protocol Code by Typing

ACM SIGPLAN Notices
Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy