Sciweavers

10055 search results - page 230 / 2011
» Structured programming using processes
Sort
View
TPHOL
2008
IEEE
15 years 6 months ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
96
Voted
VLDB
1998
ACM
153views Database» more  VLDB 1998»
15 years 4 months ago
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
Small Materialized Aggregates (SMAs for short) are considered a highly flexible and versatile alternative for materialized data cubes. The basic idea is to compute many aggregate ...
Guido Moerkotte
APLAS
2007
ACM
15 years 4 months ago
Timed, Distributed, Probabilistic, Typed Processes
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
Martin Berger, Nobuko Yoshida
AUTOMATICA
2005
112views more  AUTOMATICA 2005»
15 years 8 days ago
Optimal controller tuning for nonlinear processes
: This work proposes a systematic methodology for the optimal selection of controller parameters, in the sense of minimizing a performance index which is a quadratic function of th...
Nikolaos Kazantzis, Costas Kravaris, Costas Tseron...
93
Voted
TPDS
1998
124views more  TPDS 1998»
15 years 3 hour ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad