Sciweavers

6581 search results - page 480 / 1317
» Formalizing Design Patterns
Sort
View
ASM
2010
ASM
15 years 8 months ago
Applying the B Method for the Rigorous Development of Smart Card Applications
Abstract. Smart Card applications usually require reliability and security to avoid incorrect operation or access violation in transactions and corruption or undue access to stored...
Bruno Emerson Gurgel Gomes, David Déharbe, ...
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 7 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
DAM
2010
66views more  DAM 2010»
15 years 6 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
FUIN
2008
107views more  FUIN 2008»
15 years 6 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
ENTCS
2006
161views more  ENTCS 2006»
15 years 6 months ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...