BIRTHDAY
2008
Springer
13 years 6 months ago
2008
Springer
e [43] is the first paper on final, observational semantics in abstract data types, and the main reference for one of the MoC contributed papers in this volume. It presented severa...
KORSO
1995
13 years 8 months ago
1995
in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S.Margherita, Italy, May/June 1994, Selected papers,...
ISLPED
1995
ACM
13 years 8 months ago
1995
ACM
In this paper we present a novel approach to model the search space for optimal set data types in network component realisations. The main objective is to arrive at power efficie...
APAQS
2001
IEEE
13 years 8 months ago
2001
IEEE
Data Types Tim Miller Paul Strooper May 2001 Phone: +61 7 3365 1003 Fax: +61 7 3365 1533 http://svrc.it.uq.edu.au
FLOPS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. The paper "Scrap your boilerplate" (SYB) introduces a combinator library for generic programming that offers generic traversals and queries. Classically, suppor...
FATES
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
COOPIS
2004
IEEE
13 years 8 months ago
2004
IEEE
Matching descriptions of user requirements against descriptions of service capabilities is crucial for the discovery of appropriate services for a given task. To improve the precis...
REX
1990
13 years 8 months ago
1990
Data Types William R. Cook Hewlett-Packard Laboratories 1501 Page Mill Road, Palo Alto, CA, 94303-0969, USA Abstract: This tutorial collects and elaborates arguments for distinguis...
VISUALIZATION
1992
IEEE
13 years 8 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
FSTTCS
1993
Springer
13 years 8 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...