Sciweavers

177 search results - page 35 / 36
» Higher-Order Abstract Non-interference
Sort
View
LOPSTR
1997
Springer
15 years 3 months ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
TIME
1994
IEEE
15 years 3 months ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
TACS
1994
Springer
15 years 3 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi
ICFP
2007
ACM
15 years 3 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
83
Voted
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
15 years 1 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi