Results 1  10
of
885
A New VoronoiBased Surface Reconstruction Algorithm
, 2002
"... We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in R³. The algorithm is the first for this problem with provable guarantees. Given a “good sample” from a smooth surface, the output is guaranteed to be topologically correct and converg ..."
Abstract

Cited by 414 (9 self)
 Add to MetaCart
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in R³. The algorithm is the first for this problem with provable guarantees. Given a “good sample” from a smooth surface, the output is guaranteed to be topologically correct
Provably Correct Theories of Action
, 1991
"... We investigate logical formalization of the effects of actions in the situation calculus. We propose a formal criterion against which to evaluate theories of deterministic actions. We show how the criterion provides us a formal foundation upon which to tackle the frame problem, as well as its varian ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
We investigate logical formalization of the effects of actions in the situation calculus. We propose a formal criterion against which to evaluate theories of deterministic actions. We show how the criterion provides us a formal foundation upon which to tackle the frame problem, as well as its
A provable time and space efficient implementation of nesl
 In International Conference on Functional Programming
, 1996
"... In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed Jcalculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementa ..."
Abstract

Cited by 87 (10 self)
 Add to MetaCart
In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed Jcalculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable
The Polymorphic Picalculus: Theory and Implementation
, 1995
"... We investigate whether the πcalculus is able to serve as a good foundation for the design and implementation of a stronglytyped concurrent programming language. The first half of the dissertation examines whether the πcalculus supports a simple type system which is flexible enough to provide a su ..."
Abstract

Cited by 109 (0 self)
 Add to MetaCart
suitable foundation for the type system of a concurrent programming language. The second half of the dissertation considers how to implement the πcalculus efficiently, starting with an abstract machine for πcalculus and finally presenting a compilation of πcalculus to C. We start the dissertation
Provably Correct Hardware Compilation using Timing Diagrams
, 1997
"... In this article we present a framework within which hardware implementations are proven correct from specifications given in an OCCAMlike language called Handel by the use of a robust set of mathematical transformational laws. The semantical basis for Handel and its hardware implementations are ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this article we present a framework within which hardware implementations are proven correct from specifications given in an OCCAMlike language called Handel by the use of a robust set of mathematical transformational laws. The semantical basis for Handel and its hardware implementations
Towards a Provably Correct Hardware Implementation of Occam
, 1993
"... This paper shows how to compile a program written in a subset of occam into a normal form suitable for further processing into a netlist of components whichmay be loaded into a FieldProgrammable Gate Array (FPGA). A simple statemachine model is adopted for specifying the behaviour of a synch ..."
Abstract

Cited by 33 (16 self)
 Add to MetaCart
This paper shows how to compile a program written in a subset of occam into a normal form suitable for further processing into a netlist of components whichmay be loaded into a FieldProgrammable Gate Array (FPGA). A simple statemachine model is adopted for specifying the behaviour of a synchronous circuit where the observable includes the state of the control path and the data path of the circuit. We identify
A Provably Correct Compiler Generator
 IN PROC. ESOP’92, SPRINGERVERLAG (LNCS 582), PAGES 418–434
, 1992
"... We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated compilers emit absolute code for an abstract RISC machine language that currently is assembled into code for the SPARC and th ..."
Abstract

Cited by 28 (2 self)
 Add to MetaCart
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated compilers emit absolute code for an abstract RISC machine language that currently is assembled into code for the SPARC
A correct abstract machine for the stochastic picalculus
 In Bioconcur’04. ENTCS
, 2004
"... Abstract. This paper presents an abstract machine for a variant of the stochastic picalculus, in order to correctly model the stochastic simulation of biological processes. The abstract machine is proved sound and complete with respect to the calculus, and then used as the basis for implementing a ..."
Abstract

Cited by 92 (12 self)
 Add to MetaCart
Abstract. This paper presents an abstract machine for a variant of the stochastic picalculus, in order to correctly model the stochastic simulation of biological processes. The abstract machine is proved sound and complete with respect to the calculus, and then used as the basis for implementing a
HTN Planning for Web Service Composition Using SHOP2
, 2004
"... Automated composition of Web Services can be achieved by using AI planning techniques. Hierarchical Task Network (HTN) planning is especially wellsuited for this task. In this paper, we describe how HTN planning system SHOP2 can be used with OWLS Web Service descriptions. We provide a sound and co ..."
Abstract

Cited by 191 (3 self)
 Add to MetaCart
and complete algorithm to translate OWLS service descriptions to a SHOP2 domain. We prove the correctness of the algorithm by showing the correspondence to the situation calculus semantics of OWLS. We implemented a system that plans over sets of OWLS descriptions using SHOP2 and then executes the resulting
LambdaCalculus Schemata
, 1993
"... A lambdacalculus schema is an expression of the lambda calculus augmented by uninterpreted constant and operator symbols. It is an abstraction of programming languages such as LISP which permit functions to be passed to and returned from other functions. When given an interpretation for its constan ..."
Abstract

Cited by 106 (1 self)
 Add to MetaCart
of some sort of garbagecollected store) and the deletion strategy, modeled after the usual stack implementation of ALGOL 60, in which variable bindings are destroyed when control leaves the procedure (or block) in which they were created. Not all lambda abstractions evaluate correctly under the deletion
Results 1  10
of
885