HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs

doi 10.15760/etd.113
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Portland State University Library

Related search

A System for Incrementally Designing and Verifying Programs, Volume 1

1978English

Verifying Networked Programs Using a Model Checker Extension

2009English

Verifying Message-Passing Programs With Dependent Behavioural Types

2019English

Verifying a Compiler for Java Threads

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

The Ζ-Semantics: A Comprehensive Semantics for Functional Programs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1997English

On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Relational Cost Analysis for Functional-Imperative Programs

Proceedings of the ACM on Programming Languages
2019English

Verifying Functional Properties of Smart Contracts Using Symbolic Model-Checking

Proceedings of the Institute for System Programming of the RAS
2018English

Decomposition Principle for Linear Fractional Functional Programs

Revue française d'informatique et de recherche opérationnelle
1968English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy