<--- Back to Details
First PageDocument Content
Frama-C / Coq / ESC/Java / Theorem prover / SPARK / OCaml / Mathematical proof / Software / Computing / Functional languages
Date: 2015-02-05 02:16:49
Frama-C
Coq
ESC/Java
Theorem prover
SPARK
OCaml
Mathematical proof
Software
Computing
Functional languages

LogoUniversite_ParisSud_P

Add to Reading List

Source URL: www.spark-2014.org

Download Document from Source Website

File Size: 1,07 MB

Share Document on Facebook

Similar Documents

Proof assistants / Theoretical computer science / Logic in computer science / Mathematical logic / Isabelle / Logic for Computable Functions / Mathematics / Resolution / Constructible universe / Theorem prover / LCF / Formal methods

Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

DocID: 1xVu1 - View Document

Mathematics / Order theory / Algebra / Abstract algebra / Lattice theory / Mathematical logic / Algebraic structures / Predicate logic / Distributive lattice / Complete Heyting algebra / Mereology / Partially ordered set

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

DocID: 1xV3j - View Document

Logic / Mathematical logic / Mathematics / Model theory / Semantics / Predicate logic / Formal languages / Boolean satisfiability problem / Tautology / Well-formed formula / Conjunctive normal form / Interpretation

An Explicating Theorem Prover for Quantified Formulas

DocID: 1xUv4 - View Document

Theoretical computer science / Formal methods / Mathematical logic / School of Computer Science /  University of Manchester / Mathematics / Logic in computer science / Automated theorem proving / Formal verification / SPASS / Andrei Voronkov / Vampire / First-order logic

Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK

DocID: 1xUhM - View Document

Theoretical computer science / Formal methods / Mathematics / Logic in computer science / Mathematical logic / Automated theorem proving / School of Computer Science /  University of Manchester / Automated reasoning / Formal verification / E theorem prover / IP / Satisfiability modulo theories

Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

DocID: 1xU88 - View Document