Sciweavers

1532 search results - page 194 / 307
» An Algebraic Process Calculus
Sort
View
JSW
2007
119views more  JSW 2007»
15 years 4 months ago
Formalizing Mobility in Service Oriented Computing
— The usual scenario of service oriented systems is characterized by several services offering the same functionalities, by new services that are continuosly deployed and by othe...
Claudio Guidi, Roberto Lucchi
RP
2010
Springer
146views Control Systems» more  RP 2010»
15 years 3 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo
168
Voted
PPSC
1989
15 years 6 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra
138
Voted
IFIP
2004
Springer
15 years 10 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
AMAST
2008
Springer
15 years 7 months ago
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
A simple type confusion attack occurs in a security protocol, when a principal interprets data of one type as data of another. These attacks can be successfully prevented by \taggi...
Han Gao, Chiara Bodei, Pierpaolo Degano