Checking geometric programs or verification of geometric structures

被引：25

作者：

Mehlhorn, K

Näher, S

Seel, M ^{[1
]}

Seidel, R

Schilz, T

Schirra, S

Uhrig, C

机构：

[1] Max Planck Inst Comp Sci, Saarbrucken, Germany

[2] Univ Halle Wittenberg, Fachbereich Math & Informatik, Halle, Germany

[3] Univ Saarland, Fachbereich Informat, D-66040 Saarbrucken, Germany

[4] Algorithm Solut GmbH, Saarbrucken, Germany

来源：

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1999年 / 12卷 / 1-2期

关键词：

D O I：

10.1016/S0925-7721(98)00036-4

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A program checker verifies that a particular program execution is correct. We give simple and efficient program checkers for some basic geometric tasks. We report about our experiences with program checking in the context of the LEDA system. We discuss program checking for data structures that have to rely on user-provided functions. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：85 / 103

页数：19

共 19 条

[1] ARAGON CR, 1989, P 30 ANN IEEE S FDN, P540
[2] BLUM M, 1990, PROCEEDINGS OF THE TWENTY SECOND ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, P73, DOI 10.1145/100216.100225
[3] BLUM M, 1989, P 21 ANN ACM S THEOR
[4] BURNIKEL C, 1994, PROCEEDINGS OF THE FIFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P16
[5] 4 RESULTS ON RANDOMIZED INCREMENTAL CONSTRUCTIONS
CLARKSON, KL
MEHLHORN, K
SEIDEL, R
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1993, 3 (04): : 185 - 212
[6] APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY .2.
CLARKSON, KL
SHOR, PW
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) : 387 - 421
[7] Delaunay B., 1934, Bull. Acad. Sci. USSR. Cl. Sci. Math, V7, P1
[8] LEDA - A PLATFORM FOR COMBINATORIAL AND GEOMETRIC COMPUTING
MEHLHORN, K
NAHER, S
[J]. COMMUNICATIONS OF THE ACM, 1995, 38 (01) : 96 - 102
[9] MEHLHORN K, CHECKING GEOMETRIC S
[10] MEHLHORN K, 1907, IMPLEMENTATION CONVE

← 1 2 →