Sciweavers

4036 search results - page 183 / 808
» Formal Methods
Sort
View
ZUM
2005
Springer
134views Formal Methods» more  ZUM 2005»
15 years 12 months ago
Requirements as Conjectures: Intuitive DVD Menu Navigation
In this paper we use Z to capture the requirements for an ‘intuitive’ menu navigation system as a series of conjectures that should hold. We use those requirements to investiga...
Jemima Rossmorris, Susan Stepney
ZUM
2005
Springer
206views Formal Methods» more  ZUM 2005»
15 years 12 months ago
Component Reuse in B Using ACL2
Abstract. We present a new methodology that permits to reuse an existing hardware component that has not been developed within the B framework while maintaining a correct design ï¬...
Yann Zimmermann, Diana Toma
FM
2001
Springer
138views Formal Methods» more  FM 2001»
15 years 11 months ago
An Adequate Logic for Full LOTOS
We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition sys...
Muffy Calder, Savi Maharaj, Carron Shankland
AGTIVE
1999
Springer
15 years 10 months ago
An L-System-Based Plant Modeling Language
Cpfg is a program for simulating and visualizing plant development, based on the theory of L−systems. A special−purpose programming language, used to specify plant models, is ...
Przemyslaw Prusinkiewicz, Jim Hanan, Radomí...
139
Voted
FM
1999
Springer
88views Formal Methods» more  FM 1999»
15 years 10 months ago
Refinement Semantics and Loop Rules
Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for w h i l e-loops, for-loops, and loo...
Eric C. R. Hehner, Andrew M. Gravell