Sciweavers

10568 search results - page 640 / 2114
» Computer Intelligence and Formalization
Sort
View
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 8 months ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
SCM
2003
15 years 8 months ago
Merging Collection Data Structures in a Content Management System
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
Axel Wienberg
FMICS
2010
Springer
15 years 7 months ago
Range Analysis of Microcontroller Code Using Bit-Level Congruences
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...
Jörg Brauer, Andy King, Stefan Kowalewski
ECEASST
2008
87views more  ECEASST 2008»
15 years 7 months ago
The GP Programming System
Abstract: We describe the programming system for the graph-transformation lan, focusing on the implementation of its compiler and abstract machine. We also compare the system'...
Greg Manning, Detlef Plump
FUIN
2008
107views more  FUIN 2008»
15 years 7 months ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala