检索结果-内蒙古大学图书馆

Detecting Redundant CSS Rules in HTML5 applications: A Tree Rewriting Approach

ACM SIGPLAN NOTICES 2015年第10期50卷 1-19页

作者： Hague, Matthew Lin, Anthony W. Ong, C. -H. Luke Univ London London WC1E 7HU England Yale NUS Coll Singapore Singapore Univ Oxford Oxford OX1 2JD England

HTML5 applications normally have a large set of CSS (Cascading Style Sheets) rules for data display. Each CSS rule consists of a node selector and a declaration block (which assigns values to selected nodes' display attributes). As web applications evolve, maintaining CSS files can easily become problematic. Some CSS rules will be replaced by new ones, but these obsolete (hence redundant) CSS rules often remain in the applications. Not only does this "bloat" the applications increasing the bandwidth requirement but it also significantly increases web browsers' processing time. Most works on detecting redundant CSS rules in HTML5 applications do not consider the dynamic behaviors of HTML5 (specified in Java Script);in fact, the only proposed method that takes these into account is dynamic analysis, which cannot soundly prove redundancy of CSS rules. In this paper, we introduce an abstraction of HTML5 applications based on monotonic tree rewriting and study its "redundancy problem". We establish the precise complexity of the problem and various subproblems of practical importance (ranging from P to EXP). In particular, our algorithm relies on an efficient reduction to an analysis of symbolic pushdown systems (for which highly optimised solvers are available), which yields a fast method for checking redundancy in practice. We implemented our algorithm and demonstrated its efficacy in detecting redundant CSS rules in HTML5 applications.

关键词： HTML5 jQuery CSS redundancy analysis static analysis tree rewriting symbolic pushdown systems

来源：评论

学校读者我要写书评

暂无评论

Stream my models: Reactive peer-to-peer distributed models@***

Stream my models: Reactive peer-to-peer distributed models@*...

引用

ACM/IEEE International conference on Model Driven Engineering languages and systems (MODELS)

作者： Thomas Hartmann Assaad Moawad Francois Fouquet Gregory Nain Jacques Klein Yves Le Traon Universite du Luxembourg Luxembourg LU

The models@*** paradigm promotes the use of models during the execution of cyber-physical systems to represent their context and to reason about their runtime behaviour. However, current modeling techniques do not allow to cope at the same time with the large-scale, distributed, and constantly changing nature of these systems. In this paper, we introduce a distributed models@*** approach, combining ideas from reactive programming, peer-to-peer distribution, and large-scale models@***. We define distributed models as observable streams of chunks that are exchanged between nodes in a peer-to-peer manner. A lazy loading strategy allows to transparently access the complete virtual model from every node, although chunks are actually distributed across nodes. Observers and automatic reloading of chunks enable a reactive programming style. We integrated our approach into the Kevoree Modeling Framework and demonstrate that it enables frequently changing, reactive distributed models that can scale to millions of elements and several thousand nodes.

关键词： object oriented modeling Peer-to-peer computing Runtime Load modeling programming Biological system modeling Data models

来源：评论

学校读者我要写书评

暂无评论

Versatile yet Lightweight Record-and-Replay for Android

引用

ACM SIGPLAN NOTICES 2015年第10期50卷 349-366页

作者： Hu, Yongjian Azim, Tanzirul Neamtiu, Iulian Univ Calif Riverside Riverside CA 92521 USA

Recording and replaying the execution of smartphone apps is useful in a variety of contexts, from reproducing bugs to profiling and testing. Achieving effective record-and-replay is a balancing act between accuracy and overhead. On smartphones, the act is particularly complicated, because smartphone apps receive a high-bandwidth stream of input (e.g., network, GPS, camera, microphone, touch-screen) and concurrency events, but the stream has to be recorded and replayed with minimal overhead, to avoid interfering with app execution. Prior record-and-replay approaches have focused on replaying machine instructions or system calls, which is not a good fit on smartphones. We propose a novel, stream-oriented record-and-replay approach which achieves high-accuracy and low-overhead by aiming at a sweet spot: recording and replaying sensor and network input, event schedules, and inter-app communication via intents. To demonstrate the versatility of our approach, we have constructed a tool named VALERA that supports record-and-replay on the Android platform. VALERA works with apps running directly on the phone, and does not require access to the app source code. Through an evaluation on 50 popular Android apps, we show that: VALERA's replay fidelity far exceeds current record-and-replay approaches for Android;VALERA's precise timing control and low overhead (about 1% for either record or replay) allows it to replay high-throughput, timing-sensitive apps such as video/audio capture and recognition;and VALERA's support for event schedule replay enables the construction of useful analyses, such as reproducing event-driven race bugs.

关键词： Reliability Verification Mobile applications Record-and-replay Google Android App testing Event-based races

来源：评论

学校读者我要写书评

暂无评论

Multilingual source code analysis: State of the art and challenges

Multilingual source code analysis: State of the art and chal...

引用

International conference on Open Source systems and Technologies (ICOSST)

作者： Zaigham Mushtaq Ghulam Rasool Department of Computer Science COMSATS Institute of Information Technology Lahore Pakistan

Source code analysis and manipulation for multilingual types of software applications is an important research topic and its importance is continuously increasing. As utilization of multilingual source code applications is increasing, the demand of multilingual source code analysis is escalating. We discuss the widespread applications of multiple technologies and languages used for development of software systems and difficulties for analyzing the source code of these applications in this paper. We highlight the key challenges and open research problems in the field of multilingual software applications that require the attention of research community.

关键词： Analytical models object oriented modeling Java Reverse engineering Grammar Software systems

来源：评论

学校读者我要写书评

暂无评论

Common cause failures in discrete dynamic models: Theory and applications in the Figaro modelling language 25th

Common cause failures in discrete dynamic models: Theory and...

引用

25th European Safety and Reliability conference, ESREL 2015

作者： Donat, Roland Bouissou, Marc Edge Mind S.A.S. Paris France EDF R&D Clamart France

ISBN: (纸本)9781138028791

This paper addresses the integration of Common Cause Failures (CCFs or CCF events) in Probabilistic Risk Assessment (PRA) for dynamic finite-state systems. CCF events are simultaneous failures of multiple identical components due to a common cause. While CCF modelling in static PRA relies mainly on fault tree analysis that has been extensively studied since the 80’s, no common methodology has arisen to address CCFs in dynamic PRA. The challenge is that many modeling techniques can be applied in dynamic PRA: Markov chains, Petri nets, BDMP (Boolean logic Driven Markov Processes), other specific "smart component" approaches etc. and currently no generic CCF support is available for such a variety of techniques. The first contribution of this paper concerns the extension of the CCF Basic Parametric Model (BPM) to the case of dynamic systems. The main interest of this extension is that BPM parameters estimates for static analyses can be directly used in dynamic analyses. This point is particularly important from an operational point of view because the feedback data analysis campaigns needed to estimate the reliability parameters of a real complex system are costly. The second contribution of this work is the demonstration of this CCF modeling approach with an implementation in the Figaro modelling language that was developed at EDF R&D in the 90’s. Figaro is a general object oriented modelling language designed to engineer knowledge bases for static and dynamic PRA. The paper describes a procedure (that can be automated) able to augment any Figaro library in order to represent the CCF events in a dynamic context. Thanks to this procedure, both the computational and combinatorial aspects of CCF modelling remain transparent to the analyst. Finally, this methodology is applied to the popular BDMP formalism, and its benefits are exemplified by the comparison of a BDMP including CCF added manually and via the method described in the paper. © 2015 Taylor & Francis Group, Lon

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Beyond discrete modeling: A continuous and efficient model for IoT 15

Beyond discrete modeling: A continuous and efficient model f...

引用

ACM/IEEE International conference on Model Driven Engineering languages and systems (MODELS)

作者： Assaad Moawad Thomas Hartmann Francois Fouquet Gregory Nain Jacques Klein Yves Le Traon Universite du Luxembourg Luxembourg LU

ISBN: (纸本)9781467369084

Internet of Things applications analyze our past habits through sensor measures to anticipate future trends. To yield accurate predictions, intelligent systems not only rely on single numerical values, but also on structured models aggregated from different sensors. Computation theory, based on the discretization of observable data into timed events, can easily lead to millions of values. Time series and similar database structures can efficiently index the mere data, but quickly reach computation and storage limits when it comes to structuring and processing IoT data. We propose a concept of continuous models that can handle high-volatile IoT data by defining a new type of meta attribute, which represents the continuous nature of IoT data. On top of traditional discrete object-oriented modeling APIs, we enable models to represent very large sequences of sensor values by using mathematical polynomials. We show on various IoT datasets that this significantly improves storage and reasoning efficiency.

关键词： object oriented modeling Mathematical model Data models Time series analysis Computational modeling Polynomials Context

来源：评论

学校读者我要写书评

暂无评论

Semi-automatic Generation of an object-oriented API Framework over Semantic Repositories

Semi-automatic Generation of an Object-Oriented API Framewor...

引用

International conference on Intelligent Networking and Collaborative systems (INCOS)

作者： Daniele Toti Marco Rinelli Department of Computer and Electrical Engineering and Applied Mathematics University of Salerno Fisciano(SA) Italy RAN Innovation S.r.l. Rome Italy

This paper presents a system able to generate an abstraction framework over a RDF-based, semantic triplestore, offering object-oriented Application programming Interfaces to be made available for external applications. The system only requires a well-defined RDF schema and a minimal supervision by the user, and is able to produce all of the components of the API framework at their different layers, ranging from data source classes up to higher-level modules in terms of web service interfaces, in order to provide CRUD operations over the underlying semantic data. The system is sufficiently generic to accept any RDF repository with its schema as input, and can be easily configured to fine-tune the automatic generation of the API components to suit the needs of specific applications. The system has been deployed and tested on top of a large semantic repository featuring a schema where multiple real-world conceptualizations are defined, including one representing a learning model specifically designed for advanced e-learning management platforms.

关键词： Resource description framework Semantics object oriented modeling Triples (Data structure) Business Web services

来源：评论

学校读者我要写书评

暂无评论

Postdraduate development: An intriguing journey from a graduate to the IT professional

Postdraduate development: An intriguing journey from a gradu...

引用

International conference on Emerging eLearning Technologies and applications (ICETA)

作者： G. Juhás R. Kiselicová Ľ Molnár Interes. Institute Bratislava Slovakia Slovak University of Technology Bratislava Slovakia

On one hand, the universities typically offer the graduate programmes and degrees in computer science, computer engineering and information technology, on the other hand, IT companies look for IT professionals in dozens of different positions, such as programmers/ developers, analysts, consultants, administrators, database specialists, testers etc. For many positions, a degree in computer science or related discipline is just a necessary, but far not sufficient condition, deep knowledge in specific areas and technologies as well as several years of experience after graduation are required. At the same time, a lot of discussions about neccessity of cooperation between academia and praxis has been done. Observing that the university study is a quite structuted process and the requirements for particular positions are (more or less) clearely formulated with the attempt to standardize them, the process in between - here called postgraduate development - is fairly unstructured, ad hoc and individual from case to case. One of the possible answers from academia in several countries, such as Australia, Great Britain, USA and Netherland is so called professional doctorate as an alterantive to the PhD degree, to close the gap between the requirements of IT job market and the graduation at the university. We discuss the issue of postgraduate development of IT professionals with the aim to answer in a structured way not only what should be the skills for particular positions, but also how they can be gained.

关键词： object oriented modeling Java Europe programming profession object oriented programming C++ languages

来源：评论

学校读者我要写书评

暂无评论

Late Data Layout: Unifying Data Representation Transformations 14

Late Data Layout: Unifying Data Representation Transformatio...

引用

2014 ACM International conference on object-oriented-programming-systems-languages-and-applications (OOPSLA 14)

作者： Ureche, Vlad Burmako, Eugene Odersky, Martin Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450325851

Values need to be represented differently when interacting with certain language features. For example, an integer has to take an object-based representation when interacting with erased generics, although, for performance reasons, the stack-based value representation is better. To abstract over these implementation details, some programming languages choose to expose a unified high-level concept (the integer) and let the compiler choose its exact representation and insert coercions where necessary. This pattern appears in multiple language features such as value classes, specialization and multi-stage programming: they all expose a unified concept which they later refine into multiple representations. Yet, the underlying compiler implementations typically entangle the core mechanism with assumptions about the alternative representations and their interaction with other language features. In this paper we present the Late Data Layout mechanism, a simple but versatile type-driven generalization that subsumes and improves the state-of-the-art representation transformations. In doing so, we make two key observations: (1) annotated types conveniently capture the semantics of using multiple representations and (2) local type inference can be used to consistently and optimally introduce coercions. We validated our approach by implementing three language features as Scala compiler extensions: value classes, specialization (using the miniboxing representation) and a simplified multi-stage programming mechanism.

关键词： Data Representation object-oriented Annotated Types Type systems Local Type Inference

来源：评论

学校读者我要写书评

暂无评论

From object Algebras to Attribute Grammars 14

From Object Algebras to Attribute Grammars

引用

2014 ACM International conference on object-oriented-programming-systems-languages-and-applications (OOPSLA 14)

作者： Rendel, Tillmann Brachthaeuser, Jonathan Immanuel Ostermann, Klaus Univ Marburg D-35032 Marburg Germany

ISBN: (纸本)9781450325851

Oliveira and Cook (2012) and Oliveira et al. (2013) have recently introduced object algebras as a program structuring technique to improve the modularity and extensibility of programs. We analyze the relationship between object algebras and attribute grammars (AGs), a formalism to augment context-free grammars with attributes. We present an extension of the object algebra technique with which the full class of L-attributed grammars - an important class of AGs that corresponds to one-pass compilers - can be encoded in Scala. The encoding is modular (attributes can be defined and type-checked separately), scalable (the size of the encoding is linear in the size of the AG specification) and compositional (each AG artifact is represented as a semantic object of the host language). To evaluate these claims, we have formalized the encoding and re-implemented a one-pass compiler for a subset of C with our technique. We also discuss how advanced features of modern AG systems, such as higher-order and parameterized attributes, reference attributes, and forwarding can be supported.

关键词： object Algebras Visitor Pattern Attribute Grammars Church-encoding Embedded Domain-Specific languages Modularity One-Pass Compilers Scala

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：