International Workshop on Automated Specification and Verification of Web Sites最新文献

{"title":"Analyzing Consistency of Behavioral REST Web Service Interfaces","authors":"I. Rauf, A. Khan, Ivan Porres","doi":"10.4204/EPTCS.98.8","DOIUrl":"https://doi.org/10.4204/EPTCS.98.8","url":null,"abstract":"REST web services can offer complex operations that do more than just simply creating, retrieving, updating and deleting information from a database. We have proposed an approach to design the interfaces of behavioral REST web services by defining a resource and a behavioral model using UML. In this paper we discuss the consistency between the resource and behavioral models that represent service states using state invariants. The state invariants are defined as predicates over resources and describe what are the valid state configurations of a behavioral model. If a state invariant is unsatisfiable then there is no valid state configuration containing the state and there is no service that can implement the service interface. We also show how we can use reasoning tools to determine the consistency between these design models.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129543866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Model Validation in Ontology Based Transformations","authors":"J. Almendros-Jiménez, L. Iribarne","doi":"10.4204/EPTCS.98.4","DOIUrl":"https://doi.org/10.4204/EPTCS.98.4","url":null,"abstract":"Model Driven Engineering (MDE) is an emerging approach of software engineering. MDE emphasizes the construction of models from which the implementation should be derived by applying model transformations. The Ontology Definition Meta-model (ODM) has been proposed as a profile for UML models of the Web Ontology Language (OWL). In this context, transformations of UML models can be mapped into ODM/OWL transformations. On the other hand, model validation is a crucial task in model transformation. Meta-modeling permits to give a syntactic structure to source and target models. However, semantic requirements have to be imposed on source and target models. A given transformation will be sound when source and target models fulfill the syntactic and semantic requirements. In this paper, we present an approach for model validation in ODM based transformations. Adopting a logic programming based transformational approach we will show how it is possible to transform and validate models. Properties to be validated range from structural and semantic requirements of models (pre and post conditions) to properties of the transformation (invariants). The approach has been applied to a well-known example of model transformation: the Entity-Relationship (ER) to Relational Model (RM) transformation.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133904648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adding Sessions to BPEL","authors":"Jonathan Michaux, E. Najm, A. Fantechi","doi":"10.4204/EPTCS.98.7","DOIUrl":"https://doi.org/10.4204/EPTCS.98.7","url":null,"abstract":"By considering an essential subset of the BPEL orchestration language, we define SeB, a session based style of this subset. We discuss the formal semantics of SeB and we present its main properties. We use a new approach to address the formal semantics, based on a translation into so-called control graphs. Our semantics handles control links and addresses the static semantics that prescribes the valid usage of variables. We also provide the semantics of collections of networked services. \u0000Relying on these semantics, we define precisely what is meant by interaction safety, paving the way to the formal analysis of safe interactions between BPEL services.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116788356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Debugging of Web Applications with Web-TLR","authors":"M. Alpuente, D. Ballis, J. Espert, F. Frechina, D. Romero","doi":"10.4204/EPTCS.61.5","DOIUrl":"https://doi.org/10.4204/EPTCS.61.5","url":null,"abstract":"Web-TLR is a Web verification engine that is based on the well-established Rewriting Logic--Maude/LTLR tandem for Web system specification and model-checking. In Web-TLR, Web applications are expressed as rewrite theories that can be formally verified by using the Maude built-in LTLR model-checker. Whenever a property is refuted, a counterexample trace is delivered that reveals an undesired, erroneous navigation sequence. Unfortunately, the analysis (or even the simple inspection) of such counterexamples may be unfeasible because of the size and complexity of the traces under examination. In this paper, we endow Web-TLR with a new Web debugging facility that supports the efficient manipulation of counterexample traces. This facility is based on a backward trace-slicing technique for rewriting logic theories that allows the pieces of information that we are interested to be traced back through inverse rewrite sequences. The slicing process drastically simplifies the computation trace by dropping useless data that do not influence the final result. By using this facility, the Web engineer can focus on the relevant fragments of the failing application, which greatly reduces the manual debugging effort and also decreases the number of iterative verifications.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124972662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Specification and Verification of Context-dependent Services","authors":"N. Ibrahim, V. Alagar, Mubarak Mohammad","doi":"10.4204/EPTCS.61.2","DOIUrl":"https://doi.org/10.4204/EPTCS.61.2","url":null,"abstract":"Current approaches for the discovery, specification, and provision of services ignore the relationship between the service contract and the conditions in which the service can guarantee its contract. Moreover, they do not use formal methods for specifying services, contracts, and compositions. Without a formal basis it is not possible to justify through formal verification the correctness conditions for service compositions and the satisfaction of contractual obligations in service provisions. We remedy this situation in this paper. We present a formal definition of services with context-dependent contracts. We define a composition theory of services with context-dependent contracts taking into consideration functional, nonfunctional, legal and contextual information. Finally, we present a formal verification approach that transforms the formal specification of service composition into extended timed automata that can be verified using the model checking tool UPPAAL. In [12] and [11], we introduced a formal framework, called FrSeC, that supports the specification, publication, discovery, selection, composition and verification of services with context-dependent contracts. The work reported in this paper is founded on this framework. We provide a formal specification of services with context-dependent contracts and their compositions. The composition theory of services takes into consideration the functional, nonfunctional, legal, and contextual aspects of services. We also present a formal verification approach that transforms the formal specification of service composition into UPPAAL [2] timed automata in order to verify service properties using model checking. Service-oriented Architecture (SOA) is an emerging view of the future of distributed computing and enterprise application development [4]. However, current approaches for the specification, publication, discovery, selection, and provision of services fall short in important respects. First, the relationship between the service contract and the conditions in which the service can guarantee its contract has been ignored, however these are necessary in order to associate the context of the service provider and the context of the service requester. Second, contextual information [3] is not well represented and not rigorously applied in service discovery and service provision. Third, current composition approaches compose only service functionality and ignore nonfunctional requirements. Thus, service contracts, and context information that are part of services are left out of the composition, and verification. Fourth and the last, the published approaches do not use formal methods for the specification of services, contracts, contextual representation and application, and service composition. Without a formal basis it is not possible to justify through formal verification the correctness conditions for service compositions and the satisfaction of contractual obligations in service provisions.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115194493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Product Lines for Service Oriented Applications - PL for SOA","authors":"M. T. Beek, S. Gnesi, Mercy N. Njima","doi":"10.4204/EPTCS.61.3","DOIUrl":"https://doi.org/10.4204/EPTCS.61.3","url":null,"abstract":"PL for SOA proposes, formally, a software engineering methodology, development techniques and support tools for the provision of service product lines. We propose rigorous modeling techniques for the specification and verification of formal notations and languages for service computing with inclinations of variability. Through these cutting-edge technologies, increased levels of flexibility and adaptivity can be achieved. This will involve developing semantics of variability over behavioural models of services. Such tools will assist organizations to plan, optimize and control the quality of software service provision, both at design and at run time by making it possible to develop flexible and cost-e ective software systems that support high levels of reuse. We tackle this challenge from two levels. We use feature modeling from product line engineering and, from a services point of view, the orchestration language Orc. We introduce the Smart Grid as the service product line to apply the techniques to.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126245444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A type checking algorithm for qualified session types","authors":"M. Giunti","doi":"10.4204/EPTCS.61.7","DOIUrl":"https://doi.org/10.4204/EPTCS.61.7","url":null,"abstract":"We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session protocols are described by a type constructor that denotes the two ends of one and the same communication channel. We ensure the soundness of the algorithm by showing that processes consuming all linear resources are accepted by a typing system preserving typings during the computation and that type checking is consistent with respect to structural congruence.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130229064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A theorem proving framework for the formal verification of Web Services Composition","authors":"P. Papapanagiotou, Jacques D. Fleuriot","doi":"10.4204/EPTCS.61.1","DOIUrl":"https://doi.org/10.4204/EPTCS.61.1","url":null,"abstract":"We present a rigorous framework for the composition of Web Services within a higher order logic theorem prover. Our approach is based on the proofs-as-processes paradigm that enables inference rules of Classical Linear Logic (CLL) to be translated into pi-calculus processes. In this setting, composition is achieved by representing available web services as CLL sentences, proving the requested composite service as a conjecture, and then extracting the constructed pi-calculus term from the proof. Our framework, implemented in HOL Light, not only uses an expressive logic that allows us to incorporate multiple Web Services properties in the composition process, but also provides guarantees of soundness and correctness for the composition.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131570952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Abstract Semantics for Inference of Types and Effects in a Multi-Tier Web Language","authors":"Letterio Galletta, G. Levi","doi":"10.4204/EPTCS.61.6","DOIUrl":"https://doi.org/10.4204/EPTCS.61.6","url":null,"abstract":"fgalletta,levigdi.unipi.it Types-and-effects are type systems, which allow one to express general semantic properties and to statically reason about program’s execution. They have been widely exploited to specify static analyses, for example to track computational side effects, exceptions and communications in concurrent programs. In this paper we adopt abstract interpretation techniques to reconstruct (following the Cousot’s methodology) a types-and-effects system developed to handle security problems of a multitier web language. Our reconstruction allows us to show that this types-and-effects system is not sound with respect to the semantics of the language. In addition, we correct the soundness issues in the analysis and systematically construct a correct analyser.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134609134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Automated Functional Testing based on the Navigation of Web Applications","authors":"Boni García, Juan C. Dueñas","doi":"10.4204/EPTCS.61.4","DOIUrl":"https://doi.org/10.4204/EPTCS.61.4","url":null,"abstract":"Web applications are becoming more and more complex. Testing such applications is an intricate hard and time-consuming activity. Therefore, testing is often poorly performed or skipped by practitioners. Test automation can help to avoid this situation. Hence, this paper presents a novel approach to perform automated software testing for web applications based on its navigation. On the one hand, web navigation is the process of traversing a web application using a browser. On the other hand, functional requirements are actions that an application must do. Therefore, the evaluation of the correct navigation of web applications results in the assessment of the specified functional requirements. The proposed method to perform the automation is done in four levels: test case generation, test data derivation, test case execution, and test case reporting. This method is driven by three kinds of inputs: i) UML models; ii) Selenium scripts; iii) XML files. We have implemented our approach in an open-source testing framework named Automatic Testing Platform. The validation of this work has been carried out by means of a case study, in which the target is a real invoice management system developed using a model-driven approach.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122001234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}