Sciweavers

1549 search results - page 249 / 310
» On the rules of intermediate logics
Sort
View
FTRTFT
1994
Springer
13 years 12 months ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...
Manfred Broy, Ketil Stølen
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
13 years 12 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
ALP
1990
Springer
13 years 11 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
ISCA
1990
IEEE
68views Hardware» more  ISCA 1990»
13 years 11 months ago
Maximizing Performance in a Striped Disk Array
Improvements in disk speeds have not kept up with improvements in processor and memory speeds. One way to correct the resulting speed mismatch is to stripe data across many disks. ...
Peter M. Chen, David A. Patterson
CSFW
2009
IEEE
13 years 11 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker