Sciweavers

5255 search results - page 319 / 1051
» Formal Methods for Privacy
Sort
View
FM
2001
Springer
138views Formal Methods» more  FM 2001»
15 years 9 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 9 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í...
FM
1999
Springer
88views Formal Methods» more  FM 1999»
15 years 9 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
TYPES
1993
Springer
15 years 8 months ago
Proof-Checking a Data Link Protocol
Abstract. A data link protocol developed and used by Philips Electronics is modeled and veri ed using I/O automata theory. Correctness is computer-checked with the Coq proof develo...
Leen Helmink, M. P. A. Sellink, Frits W. Vaandrage...
171
Voted
FMCO
2007
Springer
196views Formal Methods» more  FMCO 2007»
15 years 8 months ago
Coordinating Object Oriented Components Using Data-Flow Networks
We propose a framework for component-based modeling of distributed systems. It provides separation of concerns between computation (in object oriented components), coordination (vi...
Mohammad Mahdi Jaghoori