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

program transformations for information personalization

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2010年第3期36卷 223-249页

作者： Perugini, Saverio Ramakrishnan, Naren Univ Dayton Dept Comp Sci Dayton OH 45469 USA Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA

Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end-user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens, and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical hypermedia, and providing supplemental interactions for improving the personalized experience. The primary form of personalization discussed is out-of-turn interaction a technique which empowers a user navigating a hierarchical website to postpone clicking on any of the hyperlinks presented on the current page and, instead, communicate the label of a hyperlink nested deeper in the hierarchy. When the user supplies out-of-turn input we personalize the hierarchy to reflect the user's informational need. While viewing a website as a program and site transformation as program transformation is non-traditional, it offers a new way of thinking about personalized interaction, especially with hierarchical hypermedia. Our use of program transformations casts personalization in a formal setting and provides a systematic and implementation-neutral approach to designing systems. Moreover, this approach helped connect our work to human-computer dialog management and, in particular, mixed-initiative interaction. Putting personalized web interaction on a fundamentally different landscape gave birth to this new line of research. Relating concepts in the web domain (e.g., sites, interactions) to notions in the pr

关键词： Hierarchical hypermedia Information personalization Navigation Out-of-turn interaction program transformations Partial evaluation program slicing Web interaction Web mining Website transformation

来源：评论

学校读者我要写书评

暂无评论

program transformations in the POLCA Project 19

Program Transformations in the POLCA Project

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Kuper, Jan Schubert, Lutz Kempf, Kilian Glass, Colin Bonilla, Daniel Rubio Carro, Manuel Univ Twente Enschede Netherlands Univ Ulm Ulm Germany Ctr High Performance Comp Stuttgart Germany Imdea Software Inst Madrid Spain

ISBN: (纸本)9783981537079

The POLCA project develops annotations on fragments of imperative code to guide program transformations for better utilization of resources. These annotations express the computational essence of the code fragments without referring to memory usage or execution time. That makes the annotations mathematical in nature such that provably correct transformations can be applied to them and the corresponding code fragment can be transformed accordingly for more optimal resource usage, for example on a multi-core platform or on an FPGA.

关键词： program transformations code partitioning formal methods optimization

来源：评论

学校读者我要写书评

暂无评论

program transformations for Asynchronous Query Submission

Program Transformations for Asynchronous Query Submission

引用

IEEE 27th International Conference on Data Engineering (ICDE 2011)

作者： Chavan, Mahendra Guravannavar, Ravindra Ramachandra, Karthik Sudarshan, S. Indian Inst Technol Bombay 400076 Maharashtra India Indian Inst Technol Madras Tamil Nadu India

ISBN: (纸本)9781424489589

Synchronous execution of queries or Web service requests forces the calling application to block until the query/request is satisfied. The performance of applications can be significantly improved by asynchronous submission of queries, which allows the application to perform other processing instead of blocking while the query is executed, and to concurrently issue multiple queries. Concurrent submission of multiple queries can allow the query execution engine to better utilize multiple processors and disks, and to reorder disk IO requests to minimize seeks. Concurrent submission also reduces the impact of network round-trip latency and delays at the database, when processing multiple queries. However, manually writing applications to exploit asynchronous query submission is tedious. In this paper we address the issue of automatically transforming a program written assuming synchronous query submission, to one that exploits asynchronous query submission. Our program transformation method is based on dataflow analysis and is framed as a set of transformation rules. Our rules can handle query executions within loops, unlike some of the earlier work in this area. We have built a tool that implements our transformation techniques on Java code that uses JDBC calls;our tool can be extended to handle Web service calls. We have carried out a detailed experimental study on several real-life applications rewritten using our transformation techniques. The experimental study shows the effectiveness of the proposed rewrite techniques, both in terms of their applicability and performance gains achieved.

关键词： Computational modeling Databases Engines JDBC calls Java Java code Observers Prefetching Servers Web service calls Web service requests Web services asynchronous query submission data flow analysis dataflow analysis multiple processors network delays network round-trip latency program compilers program transformations query execution engine query processing rewrite techniques rewriting systems

来源：评论

学校读者我要写书评

暂无评论

Applying Visible Strong Equivalence in Answer-Set program transformations

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2020年第4期21卷 1–41页

作者： Bomanson, Jori Janhunen, Tomi Niemela, Ilkka Aalto Univ Comp Sci Sch Sci POB 15400 FI-00076 Aalto Finland Tampere Univ Informat Technol & Commun Sci Kanslerinrinne 1 Tampere 33100 Finland

Strong equivalence is one of the basic notions of equivalence that have been proposed for logic programs subject to the answer-set semantics. In this article, we propose a new generalization of strong equivalence (SE) that takes the visibility of atoms into account and we characterize it in terms of appropriately revised SE-models. Our design resembles (relativized) strong equivalence but is substantially different due to adopting a strict one-to-one correspondence of models from the notion of visible equivalence. We additionally tailor the characterization for more convenient use with positive programs and provide formal tools to exploit the tailored version also in the case of some programs that use negation. We illustrate the use of visible strong equivalence and the characterizations in showing the correctness of program transformations that make use of atom visibility. Moreover, we present a translation that enables us to automate the task of verifying visible strong equivalence for particular fragments of answer-set programs. We experimentally study the efficiency of verification when the goal is to check whether an extended rule is visibly strongly equivalent to its normalization, i.e., a subprogram expressing the original rule in terms of normal rules only. In the process, we verify the outputs of several real implementations of normalization schemes on a considerable number of input rules.

关键词： Stable models strong equivalence hidden atoms auxiliary atoms program transformations normalization

来源：评论

学校读者我要写书评

暂无评论

Computing in unpredictable environments: semantics, reduction strategies, and program transformations

引用

THEORETICAL COMPUTER SCIENCE 1998年第1期190卷 61-85页

作者： Lisper, B Royal Inst Technol Dept Teleinformat S-16440 Kista Sweden Swedish Inst Comp Sci Kista Sweden

We study systems where deterministic computations take place in environments which may behave nondeterministically. We give a simple formalization by unions of abstract reduction systems, on which various semantics can be based in a straightforward manner. We then prove that under a simple condition on the reduction systems, the following holds: reduction strategies which are cofinal for the deterministic reduction system will implement the semantics for the combined system, provided the environment behaves in a "fair" manner, and certain program transformations, such as folding and unfolding with respect to deterministic rules, will preserve the semantics. An application is evaluation strategies and program transformations for concurrent languages.

关键词： formal semantics program transformations nondeterminism reduction systems recursive program schemes

来源：评论

学校读者我要写书评

暂无评论

The impact of seq on free theorems-based program transformations

引用

FUNDAMENTA INFORMATICAE 2006年第1-2期69卷 63-102页

作者： Johann, P Voigtländer, J Rutgers State Univ Dept Comp Sci Camden NJ 08102 USA Tech Univ Dresden Dept Comp Sci D-01062 Dresden Germany

Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. Unfortunately, standard parametricity results - including so-called free theorems - fail for nonstrict languages supporting a polymorphic strict evaluation primitive such as Haskell's seq. A folk theorem maintains that such results hold for a subset of Haskell corresponding to a Girard-Reynolds calculus with fixpoints and algebraic datatypes even when seq is present provided the relations which appear in their derivations are required to be bottom-reflecting and admissible. In this paper we show that this folklore is incorrect, but that parametricity results can be recovered in the presence of seq by restricting attention to left-closed, total, and admissible relations instead. The key novelty of our approach is the asymmetry introduced by left-closedness, which leads to "inequational" versions of standard parametricity results together with preconditions guaranteeing their validity even when seq is present. We use these results to derive criteria ensuring that both equational and inequational versions of short cut fusion and related program transformations based on free theorems hold in the presence of seq.

关键词： Haskell control primitives correctness proofs denotational semantics functional programming languages logical relations mixing strict and nonstrict evaluation parametricity polymorphism program transformations rank-2 types short cut fusion theorems for free

来源：评论

学校读者我要写书评

暂无评论

ProbeGuard: Mitigating Probing Attacks Through Reactive program transformations 19

ProbeGuard: Mitigating Probing Attacks Through Reactive Prog...

引用

24th International Conference on Architectural Support for programming Languages and Operating Systems (ASPLOS)

作者： Bhat, Koustubha van der Kouwe, Erik Bos, Herbert Giuffrida, Cristiano Vrije Univ Amsterdam Amsterdam Netherlands Leiden Univ Leiden Netherlands

ISBN: (纸本)9781450362405

Many modern defenses against code reuse rely on hiding sensitive data such as shadow stacks in a huge memory address space. While much more efficient than traditional integrity-based defenses, these solutions are vulnerable to probing attacks which quickly locate the hidden data and compromise security. This has led researchers to question the value of information hiding in real-world software security. Instead, we argue that such a limitation is not fundamental and that information hiding and integrity-based defenses are two extremes of a continuous spectrum of solutions. We propose a solution, ProbeGuard, that automatically balances performance and security by deploying an existing information hiding based baseline defense and then incrementally moving to more powerful integrity-based defenses by hotpatching when probing attacks occur. ProbeGuard is efficient, provides strong security, and gracefully trades off performance upon encountering more probing primitives.

关键词： reactive defenses program transformations hot-patching processor trace security hardening performance-security tradeoff graceful performance degradation information hiding code reuse software bugs

来源：评论

学校读者我要写书评

暂无评论

Memory Consistency Models for program transformations: An Intellectual Abstract 2023

Memory Consistency Models for Program Transformations: An In...

引用

ACM SIGPLAN International Symposium on Memory Management (ISMM)

作者： Gopalakrishnan, Akshay Verbrugge, Clark Batty, Mark McGill Univ Montreal PQ Canada Univ Kent Canterbury Kent England

ISBN: (纸本)9798400701795

Memory consistency models traditionally specify the behavior of shared memory concurrent hardware. Hardware behavior drifts away from traditional sequential reasoning, thus exhibiting behaviors that are termed as 'weak'. Weaker consistency models allow for more concurrent behaviors, thus justifying hardware optimizations such as read/write buffers. In parallel, weaker memory models for software allow more compiler optimizations (transformations). However, this 'more' may not be strict: certain safe optimizations in stronger models are rendered unsafe in ones weaker than them. We identify properties that must hold among a pair of weak and strong memory models to guarantee this. We propose a framework using which we could build such models, showcasing our results in allowing Read-Read reordering over Sequential Consistency (SC). We also show how to partially retain our desired property for a pair of models, placing constraints on the set of transformations or equivalently, on program structure. Lastly, we discuss the potential advantage of designing models satisfying such properties.

关键词： concurrency shared memory memory consistency semantics program transformations correctness

来源：评论

学校读者我要写书评

暂无评论

Computing in unpredictable environments: semantics, reduction strategies, and program transformations 21st

引用

21st Colloquium on Trees in Algebra and programming (CAAP 96)

作者： Lisper, B Royal Inst Technol Dept Teleinformat S-16440 Kista Sweden Swedish Inst Comp Sci Kista Sweden

ISBN: (纸本)3540610642

关键词： formal semantics program transformations nondeterminism reduction systems recursive program schemes

来源：评论

学校读者我要写书评

暂无评论

Elastic program transformations: Automatically Optimizing the Reliability/Performance Trade-off in Systems Software

Elastic Program Transformations: Automatically Optimizing th...

引用

作者： Jonas Benedict WAGNER ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE

学位级别：博士

Performance and reliability are important yet conflicting properties of systems software. Software today often crashes, has security vul- nerabilities and data loss, while many techniques that could address such issues remain unused due to performance concerns. This thesis presents elastic program transformations, a set of tech- niques to manage the trade-off between reliability and performance in an optimal way given the software's use case. Our work is based on the following insights: • program transformations can be used to tailor many software properties: they can make software easier to verify, safer against security attacks, and faster to test. Developers can write soft- ware once and use transformations to subsequently specialize it for different use cases and environments. • Many classes of transformations are elastic: they can be applied selectively to parts of the software, and both their cost and effect scale accordingly. • The trade-off is governed by the Pareto Principle: the right choice of program transformations yields 80% of the benefit for 20% of the cost. This thesis makes four contributions that use these insights: 1. We developed -Overify, a strategy and technique for choos- ing compiler optimizations to make programs easier to verify, rather than faster to run. -Overify demonstrates that program transformations have the power to reduce verification time by up to 95×. 2. We show that known program transformations to detect mem- ory errors and undefined behavior can be elastic. We developed ASAP, a technique and tool to apply these transformations se- lectively to make a program as secure as possible, while staying within a maximum overhead budget specified by the developer. For a maximum overhead of 5%, ASAP can protect 87% of the critical locations in CPU-intensive programs. 3. We improve the performance of fuzz testing tools that rely on program transformations to observe the software under test. We present FUSS, a technique and tool for focus

关键词： systems software program transformations elasticity compilers instrumentation profiling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：