Sciweavers

261 search results - page 37 / 53
» Formal Proof from UML Models
Sort
View
PLPV
2011
ACM
12 years 11 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
KBSE
2003
IEEE
14 years 1 months ago
Model-based Verification of Web Service Compositions
In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. This approach provides verification of properties created fr...
Howard Foster, Sebastián Uchitel, Jeff Mage...
TGC
2007
Springer
14 years 2 months ago
Elimination of Ghost Variables in Program Logics
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
Martin Hofmann, Mariela Pavlova
ASIACRYPT
2008
Springer
13 years 10 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
FOSSACS
2001
Springer
14 years 1 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin