Sciweavers

4917 search results - page 191 / 984
» Software Engineering is Not Computer Science
Sort
View
FSTTCS
2001
Springer
15 years 10 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
IUI
1999
ACM
15 years 10 months ago
Towards a General Computational Framework for Model-Based Interface Development Systems
Model-based interface development systems have not been able to progress beyond producing narrowly focused interface designs of restricted applicability. We identify a -abstractio...
Angel R. Puerta, Jacob Eisenstein
CODES
1998
IEEE
15 years 10 months ago
Combining multiple models of computation for scheduling and allocation
Many applications include a variety off unctions from different domains. Therefore, they are best modeled with a combination of different modeling languages. For a sound design pr...
Dirk Ziegenbein, Rolf Ernst, Kai Richter, Jür...
138
Voted
APL
1998
ACM
15 years 10 months ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky
144
Voted
WADT
1998
Springer
15 years 10 months ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...