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

筛选
英文 中文
Unlocking Blocked Communicating Processes 解锁阻塞的通信进程
Adrian Francalanza, M. Giunti, A. Ravara
{"title":"Unlocking Blocked Communicating Processes","authors":"Adrian Francalanza, M. Giunti, A. Ravara","doi":"10.4204/EPTCS.188.4","DOIUrl":"https://doi.org/10.4204/EPTCS.188.4","url":null,"abstract":"We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant ^a although it suffices to illustrate the main concepts, we also discuss how our work extends to other language extensions.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116906835","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}
引用次数: 1
On Properties of Policy-Based Specifications 论基于策略的规范的属性
Andrea Margheri, R. Pugliese, F. Tiezzi
{"title":"On Properties of Policy-Based Specifications","authors":"Andrea Margheri, R. Pugliese, F. Tiezzi","doi":"10.4204/EPTCS.188.5","DOIUrl":"https://doi.org/10.4204/EPTCS.188.5","url":null,"abstract":"The advent of large-scale, complex computing systems has dramatically increased the difficulties of securing accesses to systems' resources. To ensure confidentiality and integrity, the exploitation of access control mechanisms has thus become a crucial issue in the design of modern computing systems. Among the different access control approaches proposed in the last decades, the policy-based one permits to capture, by resorting to the concept of attribute, all systems' security-relevant information and to be, at the same time, sufficiently flexible and expressive to represent the other approaches. In this paper, we move a step further to understand the effectiveness of policy-based specifications by studying how they permit to enforce traditional security properties. To support system designers in developing and maintaining policy-based specifications, we formalise also some relevant properties regarding the structure of policies. By means of a case study from the banking domain, we present real instances of such properties and outline an approach towards their automatised verification.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133011351","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}
引用次数: 4
Semantics-based Automated Web Testing 基于语义的自动化Web测试
Hai-Feng Guo, Ouyang Qing, Harvey P. Siy
{"title":"Semantics-based Automated Web Testing","authors":"Hai-Feng Guo, Ouyang Qing, Harvey P. Siy","doi":"10.4204/EPTCS.188.7","DOIUrl":"https://doi.org/10.4204/EPTCS.188.7","url":null,"abstract":"We present TAO, a software testing tool performing automated test and oracle generation based on a semantic approach. TAO entangles grammar-based test generation with automated semantics evaluation using a denotational semantics framework. We show how TAO can be incorporated with the Selenium automation tool for automated web testing, and how TAO can be further extended to support automated delta debugging, where a failing web test script can be systematically reduced based on grammar-directed strategies. A real-life parking website is adopted throughout the paper to demonstrate the effectivity of our semantics-based web testing approach.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123129705","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}
引用次数: 1
Using a Machine Learning Approach to Implement and Evaluate Product Line Features 使用机器学习方法来实现和评估产品线特征
D. Bacciu, S. Gnesi, L. Semini
{"title":"Using a Machine Learning Approach to Implement and Evaluate Product Line Features","authors":"D. Bacciu, S. Gnesi, L. Semini","doi":"10.4204/EPTCS.188.8","DOIUrl":"https://doi.org/10.4204/EPTCS.188.8","url":null,"abstract":"Bike-sharing systems are a means of smart transportation in urban environments with the benefit of a positive impact on urban mobility. In this paper we are interested in studying and modeling the behavior of features that permit the end user to access, with her/his web browser, the status of the Bike-Sharing system. In particular, we address features able to make a prediction on the system state. We propose to use a machine learning approach to analyze usage patterns and learn computational models of such features from logs of system usage. \u0000On the one hand, machine learning methodologies provide a powerful and general means to implement a wide choice of predictive features. On the other hand, trained machine learning models are provided with a measure of predictive performance that can be used as a metric to assess the cost-performance trade-off of the feature. This provides a principled way to assess the runtime behavior of different components before putting them into operation.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130551438","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}
引用次数: 6
Domain-specific queries and Web search personalization: some investigations 特定领域查询和Web搜索个性化:一些调查
Van Tien Hoang, A. Spognardi, F. Tiezzi, M. Petrocchi, R. Nicola
{"title":"Domain-specific queries and Web search personalization: some investigations","authors":"Van Tien Hoang, A. Spognardi, F. Tiezzi, M. Petrocchi, R. Nicola","doi":"10.4204/EPTCS.188.6","DOIUrl":"https://doi.org/10.4204/EPTCS.188.6","url":null,"abstract":"Major search engines deploy personalized Web results to enhance users' experience, by showing them data supposed to be relevant to their interests. Even if this process may bring benefits to users while browsing, it also raises concerns on the selection of the search results. In particular, users may be unknowingly trapped by search engines in protective information bubbles, called \"filter bubbles\", which can have the undesired effect of separating users from information that does not fit their preferences. This paper moves from early results on quantification of personalization over Google search query results. Inspired by previous works, we have carried out some experiments consisting of search queries performed by a battery of Google accounts with differently prepared profiles. Matching query results, we quantify the level of personalization, according to topics of the queries and the profile of the accounts. This work reports initial results and it is a first step a for more extensive investigation to measure Web search personalization.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130974839","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}
引用次数: 6
A calculus of mobility and communication for ubiquitous computing 泛在计算的移动性和通信演算
Nosheen Gul
{"title":"A calculus of mobility and communication for ubiquitous computing","authors":"Nosheen Gul","doi":"10.4204/EPTCS.188.3","DOIUrl":"https://doi.org/10.4204/EPTCS.188.3","url":null,"abstract":"We propose a Calculus of Mobility and Communication (CMC) for the modelling of mobility, communication and context-awareness in the setting of ubiquitous computing. CMC is an ambient calculus with the in and out capabilities of Cardelli and Gordon's Mobile Ambients. The calculus has a new form of global communication similar to that in Milner's CCS. In CMC an ambient is tagged with a set of ports that agents executing inside the ambient are allowed to communicate on. It also has a new context-awareness feature that allows ambients to query their location. We present reduction semantics and labelled transition system semantics of CMC and prove that the semantics coincide. A new notion of behavioural equivalence is given by defining capability barbed bisimulation and congruence which is proved to coincide with barbed bisimulation congruence. The expressiveness of the calculus is illustrated by two case studies.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125861337","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}
引用次数: 1
Automatic Detection of Webpages that Share the Same Web Template 自动检测共享相同Web模板的网页
Julián Alarte, David Insa, Josep Silva, S. Tamarit
{"title":"Automatic Detection of Webpages that Share the Same Web Template","authors":"Julián Alarte, David Insa, Josep Silva, S. Tamarit","doi":"10.4204/EPTCS.163.2","DOIUrl":"https://doi.org/10.4204/EPTCS.163.2","url":null,"abstract":"This work has been partially supported by the Spanish Ministerio de Econom´ia y Competitividad (Secretar´ia de Estado de Investigacion, Desarrollo e Innovaci ´ on) ´ under grant TIN2013-44742-C4-1-R and by the Generalitat Valenciana under grant PROMETEO/2011/052. David Insa was partially supported by the Spanish Ministerio de Eduacion under FPU grant AP2010-4415. Salvador Tamarit was partially supported by research project POLCA, Programming Large Scale Heterogeneous Infrastructures (610686), funded by the European Union, STREP FP7.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"94 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115667486","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}
引用次数: 4
Static Enforcement of Role-Based Access Control 基于角色的访问控制的静态实施
Asad Ali, M. Fernández
{"title":"Static Enforcement of Role-Based Access Control","authors":"Asad Ali, M. Fernández","doi":"10.4204/EPTCS.163.4","DOIUrl":"https://doi.org/10.4204/EPTCS.163.4","url":null,"abstract":"We propose a new static approach to Role-Based Access Control (RBAC) policy enforcement. The static approach we advocate includes a new design methodology, for applications involving RBAC, which integrates the security requirements into the system's architecture. We apply this new approach to policies restricting calls to methods in Java applications. We present a language to express RBAC policies on calls to methods in Java, a set of design patterns which Java programs must adhere to for the policy to be enforced statically, and a description of the checks made by our static verifier for static enforcement.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125269840","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}
引用次数: 4
A Local Logic for Realizability in Web Service Choreographies Web服务编排中可实现性的本地逻辑
R. Ramanujam, S. Sheerazuddin
{"title":"A Local Logic for Realizability in Web Service Choreographies","authors":"R. Ramanujam, S. Sheerazuddin","doi":"10.4204/EPTCS.163.3","DOIUrl":"https://doi.org/10.4204/EPTCS.163.3","url":null,"abstract":"Web service choreographies specify conditions on observable interactions among the services. An important question in this regard is realizability: given a choreography C, does there exist a set of service implementations I that conform to C ? Further, if C is realizable, is there an algorithm to construct implementations in I ? We propose a local temporal logic in which choreographies can be specified, and for specifications in the logic, we solve the realizability problem by constructing service implementations (when they exist) as communicating automata. These are nondeterministic finite state automata with a coupling relation. We also report on an implementation of the realizability algorithm and discuss experimental results.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126190094","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}
引用次数: 1
Amending Choreographies 修改编排
Ivan Lanese, F. Montesi, G. Zavattaro
{"title":"Amending Choreographies","authors":"Ivan Lanese, F. Montesi, G. Zavattaro","doi":"10.4204/EPTCS.123.5","DOIUrl":"https://doi.org/10.4204/EPTCS.123.5","url":null,"abstract":"Choreographies are global descriptions of system behavior s, fr m which the local behavior of each endpoint entity can be obtained automatically through proj ection. To guarantee that its projection is correct, i.e. it has the same behaviors of the original chore ography, a choreography usually has to respect some coherency conditions. This restricts the set o f choreographies that can be projected. In this paper, we present a transformation for amending chor eographies that do not respect common syntactic conditions for projection correctness. Spec ifically, our transformation automatically reduces the amount of concurrency, and it infers and adds hid den communications that make the resulting choreography respect the desired conditions, wh ile preserving its behavior.","PeriodicalId":233765,"journal":{"name":"International Workshop on Automated Specification and Verification of Web Sites","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115194954","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}
引用次数: 40
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信