Sciweavers

1454 search results - page 100 / 291
» Stateful traits and their formalization
Sort
View
ECOWS
2007
Springer
15 years 6 months ago
Composing Services with JOLIE
Service composition and service statefulness are key concepts in Web Service system programming. In this paper we present JOLIE, which is the full implementation of our formal cal...
Fabrizio Montesi, Claudio Guidi, Gianluigi Zavatta...
FORMATS
2007
Springer
15 years 6 months ago
Undecidability of Universality for Timed Automata with Minimal Resources
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
Sara Adams, Joël Ouaknine, James Worrell
132
Voted
CSFW
2005
IEEE
15 years 6 months ago
Game-Based Analysis of Denial-of-Service Prevention Protocols
Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed ...
Ajay Mahimkar, Vitaly Shmatikov
GC
2004
Springer
15 years 6 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
136
Voted
LICS
1998
IEEE
15 years 4 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka