D. Pichardie and Y. Bertot. Formalizing convex hull algorithms. In R. Boulton and P. Jackson, editors, Higher Order Logic Theorem Proving and its Applications (TPHOL), volume 2152 of LNCS, pages 346--361, Edinburgh, Scotland, UK, 2001. Springer. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Visualizing Geometrical Statements with GeoView - Bertot, Guilhot, Pottier (2003) (1 citation) Self-citation (Bertot) (Correct)
No context found.
D. Pichardie and Y. Bertot. Formalizing Convex Hulls Algorithms. In TPHOLs'01, pages 346--361. LNCS 2152, Springer Verlag, 2001.
Using Three-Valued Logic to Specify and Verify - Algorithms Of Computational (Correct)
No context found.
D. Pichardie and Y. Bertot. Formalizing convex hull algorithms. In R. Boulton and P. Jackson, editors, Higher Order Logic Theorem Proving and its Applications (TPHOL), volume 2152 of LNCS, pages 346--361, Edinburgh, Scotland, UK, 2001. Springer.
Dependable Polygon-Processing Algorithms for Safety-Critical .. - Brandt, Schneider (2005) (Correct)
No context found.
D. Pichardie and Y. Bertot. Formalizing convex hull algorithms. In R.J. Boulton and P.B. Jackson, editors, Higher Order Logic Theorem Proving and its Applications (TPHOL), volume 2152 of LNCS, pages 346--361, Edinburgh, Scotland, UK, 2001. Springer.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC