Conference Proceeding

Semantics of a Sequential Language for Exact Real-Number Computation.

Birmingham Univ., England, UK;
Proceedings - Symposium on Logic in Computer Science 01/2004; DOI:10.1109/LICS.2004.1319637 In proceeding of: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings
Source: DBLP

ABSTRACT We study a programming language with a built-in ground type for real numbers. In order for the language to be sufficiently expressive but still sequential, we consider a construction proposed by Boehm and Cartwright. The non-deterministic nature of the construction suggests the use of powerdomains in order to obtain a denotational semantics for the language. We show that the construction cannot be modelled by the Plotkin or Smyth powerdomains, but that the Hoare powerdomain gives a computationally adequate semantics. As is well known, Hoare semantics can be used in order to establish partial correctness only. Since computations on the reals are infinite, one cannot decompose total correctness into the conjunction of partial correctness and termination as it is traditionally done. We instead introduce a suitable operational notion of strong convergence and show that total correctness can be proved by establishing partial correctness (using denotational methods) and strong convergence (using operational methods). We illustrate the technique with a representative example.

0 0
1 Bookmark
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. We discuss several examples including the extraction of programs for polynomials up to degree two and the definite integral of continuous maps.
    Computing Research Repository - CORR. 01/2011;
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: We develop and study the concept of dataflow process networks as used for example by Kahn to suit exact computation over data types related to real numbers, such as continuous functions and geometrical solids. Furthermore, we consider communicating these exact objects among processes using protocols of a query-answer nature as introduced in our earlier work. This enables processes to provide valid approximations with certain accuracy and focusing on certain locality as demanded by the receiving processes through queries. We define domain-theoretical denotational semantics of our networks in two ways: (1) directly, i.e. by viewing the whole network as a composite process and applying the process semantics introduced in our earlier work; and (2) compositionally, i.e. by a fixed-point construction similar to that used by Kahn from the denotational semantics of individual processes in the network. The direct semantics closely corresponds to the operational semantics of the network (i.e. it is correct) but very difficult to study for concrete networks. The compositional semantics enables compositional analysis of concrete networks, assuming it is correct. We prove that the compositional semantics is a safe approximation of the direct semantics. We also provide a method that can be used in many cases to establish that the two semantics fully coincide, i.e. safety is not achieved through inactivity or meaningless answers. The results are extended to cover recursively-defined infinite networks as well as nested finite networks. A robust prototype implementation of our model is available.
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE 01/2010; 16(18):2629-2656. · 0.76 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Minlog is an interactive system which implements proof-theoretic methods and applies them to verification and program extraction. We give an overview of Minlog and demonstrate how it can be used to exploit the computational content in (co)algebraic proofs and to develop correct and efficient programs. We illustrate this by means of two examples: one about parsing, the other about exact real numbers in signed digit representation.
    Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings; 01/2011

Full-text (2 Sources)

Available from
Dec 16, 2013