All Projects → NICTA → Cogent

NICTA / Cogent

Licence: other
Cogent Project

Projects that are alternatives of or similar to Cogent

Perennial
Verifying concurrent crash-safe systems
Stars: ✭ 57 (-58.39%)
Mutual labels:  verification
Hacl Star
HACL*, a formally verified cryptographic library written in F*
Stars: ✭ 1,360 (+892.7%)
Mutual labels:  verification
React Native Code Verification
❤️ Simple UI for pincode verification
Stars: ✭ 109 (-20.44%)
Mutual labels:  verification
Ssri
Standard Subresource Integrity library for Node.js
Stars: ✭ 69 (-49.64%)
Mutual labels:  verification
Minasmsverification
短信验证:基于阿里云的 微信小程序 功能模块: 直接用 / mini-program + Node.js + Alibaba Cloud / Front & Back End
Stars: ✭ 94 (-31.39%)
Mutual labels:  verification
Awesome Open Hardware Verification
A List of Free and Open Source Hardware Verification Tools and Frameworks
Stars: ✭ 103 (-24.82%)
Mutual labels:  verification
Scrypt Interactive
[DEPRECATED] Truebit Verification for Scrypt
Stars: ✭ 47 (-65.69%)
Mutual labels:  verification
Siepic ebeam pdk
SiEPIC EBeam PDK & Library, for SiEPIC-Tools and KLayout
Stars: ✭ 121 (-11.68%)
Mutual labels:  verification
Jhverificationcodeview
验证码输入框,验证码,code view,iOS验证码输入
Stars: ✭ 96 (-29.93%)
Mutual labels:  verification
Tlaplus
TLC is an explicit state model checker for specifications written in TLA+. The TLA+Toolbox is an IDE for TLA+.
Stars: ✭ 1,618 (+1081.02%)
Mutual labels:  verification
Vonage Java Sdk
Vonage Server SDK for Java. API support for SMS, Voice, Text-to-Speech, Numbers, Verify (2FA) and more.
Stars: ✭ 75 (-45.26%)
Mutual labels:  verification
Sea Dsa
A new context, field, and array-sensitive heap analysis for LLVM bitcode based on DSA.
Stars: ✭ 90 (-34.31%)
Mutual labels:  verification
Verifyedittext
带下划线的验证码输入框
Stars: ✭ 103 (-24.82%)
Mutual labels:  verification
Reachabilityanalysis.jl
Methods to compute sets of states reachable by dynamical systems
Stars: ✭ 59 (-56.93%)
Mutual labels:  verification
Esverify
ECMAScript verification with SMT solvers
Stars: ✭ 109 (-20.44%)
Mutual labels:  verification
Smsretrieverapimaster
Automatic SMS Verification with the SMS Retriever API
Stars: ✭ 48 (-64.96%)
Mutual labels:  verification
Brightid
Reference mobile app for BrightID
Stars: ✭ 101 (-26.28%)
Mutual labels:  verification
Sbv
SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.
Stars: ✭ 125 (-8.76%)
Mutual labels:  verification
Gini
A fast SAT solver
Stars: ✭ 112 (-18.25%)
Mutual labels:  verification
Ergo
The Language for Smart Legal Contracts
Stars: ✭ 108 (-21.17%)
Mutual labels:  verification

Build Status Documentation Status

Cogent: Code and Proof Co-Generation

Project homepage

For general context of this project, motivation, an overview, and published papers, see our project homepage.

Online documentation

https://cogent.readthedocs.io

Installation

Instructions tested on Debian GNU/Linux 9.8 ("stretch") and Ubuntu 18.04 ("bionic"). Similar distributions may also work.

Install dependencies from the Debian repository.

sudo apt-get install git # git
sudo apt-get install python-lxml python-psutil python-pycparser # regression tester

To install the Cogent compiler, consult file cogent/README.md for details.

The Cogent framework depends on Isabelle-2019. If you already have them on your machine, you can use your local copy. Otherwise you can either obtain it from their website or from the isabelle submodule, via git submodule update --init --recursive -- isabelle.

Add isabelle/bin to your PATH: export PATH="$(pwd)/isabelle/bin:$PATH" If you have an existing Isabelle install, you may want to set ISABELLE_IDENTIFIER instead of PATH.

Initialise Isabelle and install components:

isabelle components -I
isabelle components -a

Consult Isabelle manual for more information.

For more customised settings to run proofs and regression tests, modify build-env.sh.

Note: also see Proofs and Regression tests below.

Compiler

See cogent/README.md for more information.

File systems

See impl/fs/ext2/README and impl/fs/bilby/README for more information on how to build the kernel modules.

Proofs

Firstly, download the AutoCorres release from http://ts.data61.csiro.au/projects/TS/autocorres/, move the extracted folder to this directory, and rename the folder to autocorres.

To build the proofs, it is recommended that your machine (or virtual machine) provides 32G of memory and 4–8 CPU threads.

# Build compilation correctness proof for ext2. (ETA: 120 CPU hours)
(cd impl/fs/ext2/cogent;
 make verification;
 export L4V_ARCH="ARM";
 isabelle build -d plat/verification -d ../../../../cogent/isa -d ../../../../autocorres -b Ext2_AllRefine)

# Build compilation correctness proof for BilbyFs. (ETA: 120 CPU hours)
(cd impl/fs/bilby/cogent;
 make verification;
 patch -d plat/verification < ../../../../BilbyFs_CorresProof.patch;
 export L4V_ARCH="ARM";
 isabelle build -d plat/verification -d ../../../../cogent/isa -d ../../../../autocorres -b -o process_output_limit=999 BilbyFs_AllRefine)

# View end-to-end theorems. Each theory has a "print_theorems" command for this.
# For ext2:
L4V_ARCH="ARM" isabelle jedit -d impl/ext2/cogent/plat/verification -d cogent/isa -d autocorres -l Ext2_CorresProof impl/fs/ext2/cogent/plat/verification/Ext2_AllRefine.thy
# For BilbyFs:
L4V_ARCH="ARM" isabelle jedit -d impl/fs/bilby/cogent/plat/verification -d cogent/isa -d autocorres -l BilbyFs_CorresProof impl/fs/bilby/cogent/plat/verification/BilbyFs_AllRefine.thy

The functional correctness proofs for BilbyFs's sync and iget operations are in impl/fs/bilby/proof/. They are built as part of the regression tests, and can be rebuilt with

regression/run_tests.py -x autocorres -x isabelle -v sync iget

Regression tests (for developers; ETA: 2–3 CPU hours)

For testing the compiler, refer to travis.yml for commands.

Run ./run_tests to test systems implementations and parts of their Isabelle proofs.

For C-refinement proofs, which are excluded from the regression tests because of their size, follow instructions in Proofs section.

Directory

  • cogent: Cogent compiler
  • c-refinement: Isabelle/HOL theories and proof procedures for Cogent-C refinement
    • tests: Cogent test programs for proof procedures
  • isa-parser: Haskell library for parsing and pretty-printing Isabelle/HOL
  • impl: Systems implemented in Cogent
    • fs: File systems
      • bilby: Bilby file system
        • cogent: Cogent code for BilbyFs
        • c: C implementation for BilbyFs
        • proof: Functional correctness specs and proofs for BilbyFs
      • ext2: ext2 file system
        • cogent: Cogent code for ext2
  • regression: Regression test script

The Gencot Tool

Gencot is a tool for translating C code to Cogent. It's developed by our collaborators. The repository is hosted on Github. See the README file and the documentation for more details.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].