Sciweavers

262 search results - page 14 / 53
» Verifying Web Applications Using Bounded Model Checking
Sort
View
FORTE
2004
15 years 1 months ago
Formal Verification of Web Applications Modeled by Communicating Automata
In this paper, we present an approach for modeling an existing web application using communicating finite automata model based on the userdefined properties to be validated. We ela...
May Haydar, Alexandre Petrenko, Houari A. Sahraoui
TSE
2011
114views more  TSE 2011»
14 years 6 months ago
Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens
Abstract— The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also i...
Luciano Baresi, Carlo Ghezzi, Luca Mottola
ICFEM
2009
Springer
15 years 6 months ago
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...
Anil Madhavapeddy
SAFECOMP
2007
Springer
15 years 5 months ago
Modeling and Automatic Failure Analysis of Safety-Critical Systems Using Extended Safecharts
With the rapid progress in science and technology, we find ubiquitous use of safety-critical systems in avionics, consumer electronics, and medical instruments. In such systems, u...
Yean-Ru Chen, Pao-Ann Hsiung, Sao-Jie Chen
WOSP
2004
ACM
15 years 5 months ago
Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models
This paper describes how soft performance bounds can be expressed for software systems using stochastic probes over stochastic process algebra models. These stochastic probes are ...
Ashok Argent-Katwala, Jeremy T. Bradley, Nicholas ...