Sciweavers

3228 search results - page 363 / 646
» Computationally Sound Proofs
Sort
View
AISC
1994
Springer
15 years 8 months ago
Using Commutativity Properties for Controlling Coercions
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...
Stephan A. Missura, Andreas Weber
LILOG
1989
15 years 8 months ago
Order Sorted Predicate Logic
We propose a theory for reasoning about actions based on order-sorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection ...
Arnold Oberschelp
APLAS
2007
ACM
15 years 8 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
15 years 7 months ago
Generic Entity Resolution with Data Confidences
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...
VISUALIZATION
2000
IEEE
15 years 7 months ago
Simplification of Tetrahedral meshes with accurate error evaluation
The techniques for reducing the size of a volume dataset by preserving both the geometrical/topological shape and the information encoded in an attached scalar field are attractin...
Paolo Cignoni, D. Constanza, Claudio Montani, Clau...