Sciweavers

923 search results - page 65 / 185
» Proving the value of formal methods
Sort
View
FM
2006
Springer
148views Formal Methods» more  FM 2006»
15 years 9 months ago
Automatic Translation from Circus to Java
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...
Angela Freitas, Ana Cavalcanti
FORMATS
2006
Springer
15 years 9 months ago
A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
Abstract. Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through labels and stochasticity through exponential...
Nicolás Wolovick, Sven Johr
IFM
2000
Springer
15 years 9 months ago
Structural Refinement in Object-Z/CSP
State-based refinement relations have been developed for use on the Object-Z components in an integrated Object-Z / CSP specification. However this refinement methodology does not ...
John Derrick, Graeme Smith
TYPES
2000
Springer
15 years 9 months ago
Constructive Reals in Coq: Axioms and Categoricity
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
Herman Geuvers, Milad Niqui
FMCAD
2008
Springer
15 years 7 months ago
Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow
Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling o...
Pieter H. Hartel, Theo C. Ruys, Marc C. W. Geilen