Sciweavers

15792 search results - page 99 / 3159
» Computational Abstraction Steps
Sort
View
ECOOPW
1999
Springer
14 years 1 months ago
Security Properties of Typed Applets
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
Xavier Leroy, François Rouaix
ECOOPW
1997
Springer
14 years 1 months ago
Reuse Contracts as Component Interface Descriptions
Abstract. Current interface descriptions are poor in describing components, because they only provide an external view on a component and they do not lay down how components intera...
Koen De Hondt, Carine Lucas, Patrick Steyaert
GD
1994
Springer
14 years 1 months ago
A Geometrical Heuristic for Drawing Concept Lattices
Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should re ect th...
Gerd Stumme, Rudolf Wille
EUROPAR
2007
Springer
14 years 1 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel
CADE
1998
Springer
14 years 25 days ago
Rank/Activity: A Canonical Form for Binary Resolution
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
Joseph Douglas Horton, Bruce Spencer