<--- Back to Details
First PageDocument Content
Functional languages / Type theory / Automated theorem proving / Hybrid automaton / Numerical analysis / Proof assistant / Coq / Verification / OCaml / Model checking / Discretization
Date: 2009-04-02 18:22:28
Functional languages
Type theory
Automated theorem proving
Hybrid automaton
Numerical analysis
Proof assistant
Coq
Verification
OCaml
Model checking
Discretization

Verification of Hybrid Systems in Coq H. Geuvers, A. Koprowski, D. Synek, E. van der Weegen BRICKS AFM4 Advancing the Real use of Proof Assistants Foundations group, Intelligent Systems, ICIS Radboud University Nijmegen

Add to Reading List

Source URL: www.cs.ru.nl

Download Document from Source Website

File Size: 1,65 MB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 1vah4 - View Document

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

DocID: 1sXwT - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document