Sciweavers

219 search results - page 36 / 44
» Formal Verification of the Ricart-Agrawala Algorithm
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
13 years 7 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
SAC
2006
ACM
13 years 7 months ago
Transformation of B specifications into UML class diagrams and state machines
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
Houda Fekih, Leila Jemni Ben Ayed, Stephan Merz
JUCS
2007
88views more  JUCS 2007»
13 years 7 months ago
Internet Payment System: A New Payment System for Internet Transactions
: Payment systems need to address a number of security issues in order to be an effective and secure means of transferring payments across the Internet. To be accessible to a wider...
Zoran Djuric, Ognjen Maric, Dragan Gasevic
SIGSOFT
2010
ACM
13 years 2 months ago
Path-based fault correlations
Although a number of automatic tools have been developed to detect faults, much of the diagnosis is still being done manually. To help with the diagnostic tasks, we formally intro...
Wei Le, Mary Lou Soffa
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard