Sciweavers

1916 search results - page 85 / 384
» Reasoning with class algebra
Sort
View
116
Voted
ICFEM
2010
Springer
14 years 10 months ago
Laws of Pattern Composition
Design patterns are rarely used on their own. They are almost always to be found composed with each other in real applications. So it is crucial that we can reason about their comp...
Hong Zhu, Ian Bayley
60
Voted
CSL
2007
Springer
15 years 6 months ago
Linear Realizability
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
Naohiko Hoshino
101
Voted
ARTS
1999
Springer
15 years 5 months ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston
115
Voted
ENTCS
2006
118views more  ENTCS 2006»
15 years 20 days ago
An Operational Domain-theoretic Treatment of Recursive Types
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
Weng Kin Ho
86
Voted
FLAIRS
2003
15 years 2 months ago
When Regions Start to Move
In this paper, we discuss a formalism for modeling regions that are exposed to movement or deformation. The basis of our formalism is the RCC theory, which uses topological relati...
Hans W. Guesgen