2 Search Results for "von Gudenberg, Jürgen Wolff"

Document
DOI: 10.4230/DagSemProc.08021.14
Interval Arithmetic and Standardization

Authors: Jürgen Wolff von Gudenberg

Published in: Dagstuhl Seminar Proceedings, Volume 8021, Numerical Validation in Current Hardware Architectures (2008)

Abstract
Interval arithmetic is arithmetic for continuous sets. Floating-point intervals are intervals of real numbers with floating-point bounds. Operations for intervals can be efficiently implemented. There is an unanimous agreement, how to define the basic operations, if we exclude division by an interval containing zero. Hence, it should be standardized. For division by zero, two options are possible, the clean exception free interval arithmetic or the containment arithmetic. They can be standardized as options. Elementary functions for intervals can be defined. In some application areas loose evaluation of functions, i.e. evaluation over an interval which is not completely contained in the function domain, is recommended, In this case, however, a discontinuity flag has to be set to inform that Brouwer's fixed point theorem is no longer applicable in that case.
Cite as

Jürgen Wolff von Gudenberg. Interval Arithmetic and Standardization. In Numerical Validation in Current Hardware Architectures. Dagstuhl Seminar Proceedings, Volume 8021, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{wolffvongudenberg:DagSemProc.08021.14,
  author =	{Wolff von Gudenberg, J\"{u}rgen},
  title =	{{Interval Arithmetic and Standardization}},
  booktitle =	{Numerical Validation in Current Hardware Architectures},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8021},
  editor =	{Annie Cuyt and Walter Kr\"{a}mer and Wolfram Luther and Peter Markstein},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08021.14},
  URN =		{urn:nbn:de:0030-drops-14342},
  doi =		{10.4230/DagSemProc.08021.14},
  annote =	{Keywords: Intervals, containment sets, IEEE754r}
}
Document
DOI: 10.4230/DagSemProc.06301.11
Similarity in Programs

Authors: Andrew Walenstein, Mohammad El-Ramly, James R. Cordy, William S. Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, and Jürgen Wolff von Gudenberg

Published in: Dagstuhl Seminar Proceedings, Volume 6301, Duplication, Redundancy, and Similarity in Software (2007)

Abstract
An overview of the concept of program similarity is presented. It divides similarity into two types - syntactic and semantic - and provides a review of eight categories of methods that may be used to measure program similarity. A summary of some applications of these methods is included. The paper is intended to be a starting point for a more comprehensive analysis of the subject of similarity in programs, which is critical to understand if progress is to be made in fields such as clone detection.
Cite as

Andrew Walenstein, Mohammad El-Ramly, James R. Cordy, William S. Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, and Jürgen Wolff von Gudenberg. Similarity in Programs. In Duplication, Redundancy, and Similarity in Software. Dagstuhl Seminar Proceedings, Volume 6301, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{walenstein_et_al:DagSemProc.06301.11,
  author =	{Walenstein, Andrew and El-Ramly, Mohammad and Cordy, James R. and Evans, William S. and Mahdavi, Kiarash and Pizka, Markus and Ramalingam, Ganesan and von Gudenberg, J\"{u}rgen Wolff},
  title =	{{Similarity in Programs}},
  booktitle =	{Duplication, Redundancy, and Similarity in Software},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6301},
  editor =	{Rainer Koschke and Ettore Merlo and Andrew Walenstein},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06301.11},
  URN =		{urn:nbn:de:0030-drops-9681},
  doi =		{10.4230/DagSemProc.06301.11},
  annote =	{Keywords: Computer programs, similarity, code clone, software comparison, program metrics, Levenshtein distance, parameterized difference, feature space, shared}
}
  • Refine by Author
  • 1 Cordy, James R.
  • 1 El-Ramly, Mohammad
  • 1 Evans, William S.
  • 1 Mahdavi, Kiarash
  • 1 Pizka, Markus
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Computer programs
  • 1 IEEE754r
  • 1 Intervals
  • 1 Levenshtein distance
  • 1 code clone
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2007
  • 1 2008

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact