Sciweavers

2702 search results - page 323 / 541
» Practically Applicable Formal Methods
Sort
View
FM
2005
Springer
114views Formal Methods» more  FM 2005»
15 years 8 months ago
Systematic Implementation of Real-Time Models
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
Martin De Wulf, Laurent Doyen, Jean-Françoi...
121
Voted
FORMATS
2005
Springer
15 years 8 months ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini
DAGM
2004
Springer
15 years 8 months ago
Learning with Distance Substitution Kernels
Abstract. During recent years much effort has been spent in incorporating problem specific a-priori knowledge into kernel methods for machine learning. A common example is a-prior...
Bernard Haasdonk, Claus Bahlmann
123
Voted
FMCO
2004
Springer
112views Formal Methods» more  FMCO 2004»
15 years 8 months ago
Probabilistic Linda-Based Coordination Languages
Abstract. Coordination languages are intended to simplify the development of complex software systems by separating the coordination aspects of an application from its computation ...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
131
Voted
APSEC
2003
IEEE
15 years 8 months ago
Selecting Components: a Process for Context-Driven Evaluation
This paper describes a process for selecting and evaluating candidates for component based software engineering. The process is aimed at developers sourcing components from third ...
Valerie Maxville, Chiou Peng Lam, Jocelyn Armarego