Sciweavers

8132 search results - page 378 / 1627
» Dependability, Abstraction, and Programming
Sort
View
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
15 years 11 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert
IWPC
1999
IEEE
15 years 11 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith
155
Voted
ECOOP
1998
Springer
15 years 11 months ago
Implementing Layered Designs with Mixin Layers
Mixin layers are a technique for implementing layered object-oriented (e.g., collaboration-based designs). Mixin layers are similar to abstract subclasses (mixin classes) but scale...
Yannis Smaragdakis, Don S. Batory
HYBRID
2007
Springer
15 years 10 months ago
A Hybrid Bellman Equation for Bimodal Systems
Abstract. In this paper we present a dynamic programming formulation of a hybrid optimal control problem for bimodal systems with regional dynamics. In particular, based on optimal...
Peter E. Caines, Magnus Egerstedt, Roland P. Malha...
198
Voted
CONCUR
2008
Springer
15 years 8 months ago
A Model of Dynamic Separation for Transactional Memory
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
Martín Abadi, Tim Harris, Katherine F. Moor...