May Haydar

dblp:03/2965 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 5 first-authorComputer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Program verification · 77% Program analysis · 23%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification
model checking
0.112005
Properties and scopes in web model checking · ASE 2005
Program verification › temporal logic
temporal logic specification
0.112005
Properties and scopes in web model checking · ASE 2005
Program analysis › static analysis
web application analysis
0.012004
Formal Framework for Automated Analysis and Verification of Web-Based Applications · ASE 2004
Program verification
web application verification
0.012004
Formal Framework for Automated Analysis and Verification of Web-Based Applications · ASE 2004

Methods — techniques the papers use, named apart from their topics

spin model checker · 0.1LTL · 0.1
YearPublicationVenuePosition
2013 A formal approach for run-time verification of web applications using scope-extended LTL
May Haydar, Alexandre Petrenko, Sergiy Boroday, Houari Sahraoui
Inf. Softw. Technol.1
2008 Specification Patterns for Formal Web Verification
abstract
Quality assurance of Web applications is usually an informal process. Meanwhile, formal methods have been proven to be reliable means for the specification, verification, and testing of systems. However, the use of these methods requires learning their mathematical foundations, including temporal logics. Specifying properties using temporal logic is often complicated even to experts, while it is a daunting and error prone task for non-expert users. To assist web developers and testers in formally specifying web related properties, we elaborate a library of web specification patterns. The current version of the library of 119 functional and non-functional patterns is a result of scrutinizing various resources in the field of quality assurance of Web Applications, which characterize successful web application using a set of standardized attributes.
May Haydar, Houari Sahraoui, Alexandre Petrenko
ICWE1
2005 Properties and scopes in web model checking
abstract
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while others - only a proper subset of them. To be able to discriminate states of interest in the state space, we solve the problem of property specification in LTL over a subset of states of a system under test while ignoring the valuation of the properties in the rest of them. We introduce specialized operators that facilitate specifying properties over propositional scopes, where each scope constitutes a subset of states that satisfy a propositional logic formula. Using the proposed operators, the user can specify web properties more concisely and intuitively. We illustrate the proposed solution in specifying properties of web applications and discuss other potential applications.
May Haydar, Sergiy Boroday, Alexandre Petrenko, Houari Sahraoui
ASE1
2004 Formal Verification of Web Applications Modeled by Communicating Automata
May Haydar, Alexandre Petrenko, Houari Sahraoui
FORTE1
2004 Formal Framework for Automated Analysis and Verification of Web-Based Applications
May Haydar
ASE1