Verified Textbook Algorithms: a Biased Survey
Verified Textbook Algorithms | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …
[图书][B] Handbook of geometric constraint systems principles
M Sitharam, AS John, J Sidman - 2018 - taylorfrancis.com
The Handbook of Geometric Constraint Systems Principles is an entry point to the currently
used principal mathematical and computational tools and techniques of the geometric …
used principal mathematical and computational tools and techniques of the geometric …
Automatic inspection system of surface defects on optical IR-CUT filter based on machine vision
Y Liu, F Yu - Optics and Lasers in Engineering, 2014 - Elsevier
The paper presents an automatic surface defects inspection system for optical Infrared Cut-
off (IR-CUT) filter, which is applied in all kinds of color cameras and video devices. The …
off (IR-CUT) filter, which is applied in all kinds of color cameras and video devices. The …
A verified ODE solver and the Lorenz attractor
F Immler - Journal of automated reasoning, 2018 - Springer
A rigorous numerical algorithm, formally verified with Isabelle/HOL, is used to certify the
computations that Tucker used to prove chaos for the Lorenz attractor. The verification is …
computations that Tucker used to prove chaos for the Lorenz attractor. The verification is …
From tarski to hilbert
In this paper, we report on the formal proof that Hilbert's axiom system can be derived from
Tarski's system. For this purpose we mechanized the proofs of the first twelve chapters of …
Tarski's system. For this purpose we mechanized the proofs of the first twelve chapters of …
Formal study of plane Delaunay triangulation
JF Dufourd, Y Bertot - International Conference on Interactive Theorem …, 2010 - Springer
This article presents the formal proof of correctness for a plane Delaunay triangulation
algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation …
algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation …
CGoGN: n-dimensional Meshes with Combinatorial Maps
Many data structures are available for the representation and manipulation of meshes. In the
context of algorithms that need to traverse local neighborhoods, topological structures are of …
context of algorithms that need to traverse local neighborhoods, topological structures are of …
A verified algorithm for geometric zonotope/hyperplane intersection
F Immler - Proceedings of the 2015 Conference on Certified …, 2015 - dl.acm.org
To perform rigorous numerical computations, one can use a generalization of interval
arithmetic, namely affine arithmetic (AA), which works with zonotopes instead of intervals …
arithmetic, namely affine arithmetic (AA), which works with zonotopes instead of intervals …
Tests and proofs for custom data generators
C Dubois, A Giorgetti - Formal Aspects of Computing, 2018 - Springer
We address automated testing and interactive proving of properties involving complex data
structures with constraints, like the ones studied in enumerative combinatorics, eg …
structures with constraints, like the ones studied in enumerative combinatorics, eg …
Tests and proofs for enumerative combinatorics
C Dubois, A Giorgetti, R Genestier - … Conference, TAP 2016, Held as Part …, 2016 - Springer
In this paper we show how the research domain of enumerative combinatorics can benefit
from testing and formal verification. We formalize in Coq the combinatorial structures of …
from testing and formal verification. We formalize in Coq the combinatorial structures of …