logo

Principles and Methods to Verify OCaml Programs

Sector: Government • Location: Portugal

Source: EU Funding & Tenders Portal

Project
Ended

Deductive software verification, a subject within the broader field of formal methods, proposes a very ambitious path: to turn the correctness of a computer program into a mathematical statement, and then prove it. This project aims to develop a deductive verification framework, with a clear focus on proof automation, that directly tackles the verification of OCaml-written programs. OCaml seems to

Project Information FAQ

Project Information

4 Q
The project “Principles and Methods to Verify OCaml Programs” is an infrastructure initiative in the Government sector, located in Portugal. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Want to explore the full details? View the full report

Participants

Sponsoring Agency

Obfuscated Data

Company

Obfuscated Data

Status

Original status

ended

Taiyo status

Obfuscated Data

Taiyo last update

00-00-0000

Available timestamps

00-00-0000

Available timestamp type

Obfuscated Data

Contact

Contact name

Obfuscated Data

Phone

0000000000

Email

ObfuscatedData@email.com

Address

Obfuscated Data, Obfuscated data, obfuscated data, Obfuscated data

Description

Description

Deductive software verification, a subject within the broader field of formal methods, proposes a very ambitious path: to turn the correctness of a computer program into a mathematical statement, and then prove it. This project aims to develop a deductive verification framework, with a clear focus on proof automation, that directly tackles the verification of OCaml-written programs. OCaml seems to be particularly good target for verification. On one hand, it is the language of choice for the implementation of sensible software such as proof assistants, automated solvers, and compilers. On the other hand, OCaml is a multi-paradigm language, supporting both the functional and imperative paradigm, one can write clean, concise, type-safe, and efficient code. Yet, a verification tool that can handle hand-written code and is mostly automated does not currently exist. OCaml programmers must chose between proof automation, with the price of learning and programming in a verification-aware language, and then perform code extraction, or tools that require manual proof assistance. The Cameleer project aims to remedy this situation by providing the tools and principles for the verification of OCaml programs. The main outcome of this project is a powerful, usable, and mostly automated verification framework for the OCaml-written code. This will be a major step towards making verification more accessible to OCaml programmers, even in case they are not verification experts. The Cameleer framework will feature a translation of OCaml programs annotated with specifications written in GOSPEL, a recently proposed specification language, to different intermediate verification languages, namely WhyML, Viper, and Coq. This coexistence of multiple intermediate verification infrastructures allows the devised framework to target the verification of a large subset of OCaml programs, while combining the strengths of each individual intermediate language to obtain better verification results.

Original sub-sector

Obfuscated

Original Currency

USD

Original budget

000000000000000

Procurement method

Obfuscated Data

Budget

000000000000000

Location

Region

Obfuscated

Country

Obfuscated

State

Obfuscated Data

County

Obfuscated

Location

Obfuscated Data, Obfuscated data, obfuscated data, Obfuscated data

Source

Source reliability

High

Data quality score

100%

Source

Obfuscated Data

URL

obfuscated_data,obfuscateddata.com

More Details

Project Type

Obfuscated Data

Article Published Date

Obfuscated Data