Sciweavers

35 search results - page 6 / 7
» Object-Oriented Refinement and Proof using Behaviour Functio...
Sort
View
APAL
2008
104views more  APAL 2008»
13 years 7 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 1 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
CRV
2005
IEEE
198views Robotics» more  CRV 2005»
14 years 1 months ago
Analysis of Player Actions in Selected Hockey Game Situations
We present a proof of concept system to represent and reason about hockey play. The system takes as input player motion trajectory data tracked from game video and supported by kn...
Fahong Li, Robert J. Woodham
AUSAI
2006
Springer
13 years 11 months ago
Robust Character Recognition Using a Hierarchical Bayesian Network
There is increasing evidence to suggest that the neocortex of the mammalian brain does not consist of a collection of specialised and dedicated cortical architectures, but instead ...
John Thornton, Torbjorn Gustafsson, Michael Blumen...
ENTCS
2008
106views more  ENTCS 2008»
13 years 7 months ago
Modelling Adaptive Systems in ForSyDe
Emerging architectures such as partially reconfigurable FPGAs provide a huge potential for adaptivity in the area of embedded systems. Since many system functions are only execute...
Ingo Sander, Axel Jantsch