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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-44584-6_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Exploiting Reachability and Cardinality in Higher-Order Flow Analysis

Journal of Functional Programming
Software
2008English

On Global Model Checking Trees Generated by Higher-Order Recursion Schemes

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Model Checking Concurrent Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

The Essence of Higher-Order Concurrent Separation Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

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

ACM SIGPLAN Notices
Computer Science
2015English

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

ACM SIGPLAN Notices
Computer Science
2007English

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

2007English

Higher Education—Educating for Higher Order Skills

Creative Education
2013English

Higher-Order Containers

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy