Modelling methods for web application verification and testing: state of the art
MH Alalfi, JR Cordy, TR Dean - Software Testing, Verification …, 2009 - Wiley Online Library
Abstract Models are considered an essential step in capturing different system behaviours
and simplifying the analysis required to check or improve the quality of software. Verification …
and simplifying the analysis required to check or improve the quality of software. Verification …
Comparison of particle swarm optimization and genetic algorithm for HMM training
F Yang, C Zhang, T Sun - 2008 19th International Conference …, 2008 - ieeexplore.ieee.org
Hidden Markov model (HMM) is the dominant technology in speech recognition. The
problem of optimizing model parameters is of great interest to the researchers in this area …
problem of optimizing model parameters is of great interest to the researchers in this area …
Matching with regular constraints
We describe a sound, terminating, and complete matching algorithm for terms built over
flexible arity function symbols and context, function, sequence, and individual variables …
flexible arity function symbols and context, function, sequence, and individual variables …
Rule-based verification of web sites
In this paper, we develop a framework for the automated verification of Web sites, which can
be used to specify integrity conditions for a given Web site, and then automatically check …
be used to specify integrity conditions for a given Web site, and then automatically check …
A survey of analysis models and methods in website verification and testing
MH Alalfi, JR Cordy, TR Dean - … Conference, ICWE 2007 Como, Italy, July …, 2007 - Springer
Abstract Models are considered an essential step in capturing system behavior and
simplifying the analysis required to check or improve the quality of software. Verification and …
simplifying the analysis required to check or improve the quality of software. Verification and …
[PDF][PDF] Can context sequence matching be used for XML querying?
We describe a matching algorithm for terms built over flexible arity function symbols and
context, function, sequence, and individual variables. The algorithm is called a context …
context, function, sequence, and individual variables. The algorithm is called a context …
Context sequence matching for XML
T Kutsia - Electronic Notes in Theoretical Computer Science, 2006 - Elsevier
Context and sequence variables allow matching to explore term-trees both in depth and in
breadth. It makes context sequence matching a suitable computational mechanism for a rule …
breadth. It makes context sequence matching a suitable computational mechanism for a rule …
A semi-automatic methodology for repairing faultyweb sites
The development and maintenance of Web sites are difficult tasks. To maintain the
consistency of ever-larger, complex Web sites, Web administrators need effective …
consistency of ever-larger, complex Web sites, Web administrators need effective …
Type-based static and dynamic website verification
Maintaining large Web sites and verifying their semantic content is a difficult task. In this
paper we propose a framework for syntactic validation, semantic verification and automatic …
paper we propose a framework for syntactic validation, semantic verification and automatic …
VeriFLog: A constraint logic programming approach to verification of website content
Web site semantic content verification can be a tedious and error prone task. In this paper
we propose a framework for syntactic validation and semantic verification based on the logic …
we propose a framework for syntactic validation and semantic verification based on the logic …