<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Algebra / Formal methods / Logic in computer science / Computability theory / Models of computation / Lambda calculus / Satisfiability modulo theories / -ring / De Bruijn index
Date: 2017-09-19 19:50:55
Theoretical computer science
Mathematics
Algebra
Formal methods
Logic in computer science
Computability theory
Models of computation
Lambda calculus
Satisfiability modulo theories
-ring
De Bruijn index

Language and Proofs for Higher-Order SMT (Work in Progress)∗ Haniel Barbosa Jasmin Christian Blanchette

Add to Reading List

Source URL: pxtp.github.io

Download Document from Source Website

File Size: 193,08 KB

Share Document on Facebook

Similar Documents

Alloy as an Introduction to Formal Methods

Alloy as an Introduction to Formal Methods

DocID: 1xVY1 - View Document

Integrated Formal Methods

Integrated Formal Methods

DocID: 1xVBb - View Document

Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University

Trust in Formal Methods Toolchains Arie Gurfinkel Software Engineering Institute Carnegie Mellon University

DocID: 1xUHE - View Document

Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister

Formal Methods in System Design manuscript No. (will be inserted by the editor) Inferring Event Stream Abstractions Sean Kauffman · Klaus Havelund · Rajeev Joshi · Sebastian Fischmeister

DocID: 1xUCm - View Document

Formal Methods in System Design manuscript No.  (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ

Formal Methods in System Design manuscript No. (will be inserted by the editor) Automatic Verification of Competitive Stochastic Systems Taolue Chen · Vojtˇ

DocID: 1xUrV - View Document