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

Osmotic management of distributed complex systems: A declarative decentralised approach

JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS 2022年第10期34卷

作者： Forti, Stefano Lera, Isaac Guerrero, Carlos Brogi, Antonio Univ Pisa Dept Comp Sci Pisa Italy Univ Balearic Isl Dept Comp Sci Palma De Mallorca Spain

Osmotic computing encompasses emerging Cloud-Internet of Things (IoT) computing paradigms, by featuring the possibility for application services to adapt into different functionally equivalent flavours, depending on the contextually available resources and on specific requirements of running applications. This article proposes a fully decentralised declarative framework that enables both application and infrastructure operators to declare management policies for the service instances and the nodes they manage, respectively. Policies are composed of a simple and well-defined set of management operations, declared in Prolog, which trigger based on locally available contextual information on application requests and infrastructure resources. A prototype implementation of the framework is showcased and assessed via simulation over a lifelike Smart Campus use case with multiple applications, at increasing infrastructure sizes and number of mobile users. Experimental results show that the proposed management framework scales to large infrastructure sizes and suits the needs of multiflavoured Osmotic applications in dynamic deployment conditions, by improving the trade-off between their response times and suitable service usage.

关键词： decentralised management declarative programming fog computing osmotic computing

来源：评论

学校读者我要写书评

暂无评论

JTL - the Java tools language

引用

ACM SIGPLAN NOTICES 2006年第10期41卷 89-108页

作者： Cohen, Tal Gil, Joseph Maman, Itay Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

We present an overview of JTL (the Java Tools Language, pronounced "Gee-tel"), a novel language for querying JAVA [ 8] programs. JTL was designed to serve the development of source code software tools for JAVA, and as a small language to aid programming language extensions to JAVA. Applications include definition of pointcuts for aspect-oriented programming, fixing type constraints for generic programming, specification of encapsulation policies, definition of micro-patterns, etc. We argue that the JTL expression of each of these is systematic, concise, intuitive and general. JTL relies on a simply-typed relational database for program representation, rather than an abstract syntax tree. The underlying semantics of the language is restricted to queries formulated in First Order Predicate Logic augmented with transitive closure (FOPL*). Special effort was taken to ensure terse, yet readable expression of logical conditions. The JTL pattern public abstract class, for example, matches all abstract classes which are publicly accessible, while class {public clone();} matches all classes in which method clone is public. To this end, JTL relies on a DATALOG-like syntax and semantics, enriched with quantifiers and pattern matching which all but entirely eliminate the need for recursive calls. JTL's query analyzer gives special attention to the fragility of the "closed world assumption" in examining JAVA software, and determines whether a query relies on such an assumption. The performance of the JTL interpreter is comparable to that of JQuery after it generated its database cache, and at least an order of magnitude faster when the cache has to be rebuilt.

关键词： design languages declarative programming reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Correct and Complete (Positive) Strategy Annotations for OBJ

引用

Electronic Notes in Theoretical Computer Science 2004年 71卷 70-89页

作者： María Alpuente Santiago Escobar Salvador Lucas DSIC Universidad Politécnica de Valencia Spain

Strategy annotations are used in several rewriting-based programming languages to introduce replacement restrictions aimed at improving efficiency and/or reducing the risk of nontermination. Unfortunately, rewriting restrictions can have a negative impact on the ability to compute normal forms. In this paper, we first ascertain/clarify the conditions ensuring correctness and completeness (regarding normalization) of computing with strategy annotations. Then, we define a program transformation methodology for (correct and) complete evaluations which applies to OBJ-like languages.

关键词： declarative programming OBJ strategy annotations

来源：评论

学校读者我要写书评

暂无评论

Correctness and Completeness of Logic Programs

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2016年第3期17卷 18-18页

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci Ul Jana Kazimierza 5 PL-01248 Warsaw Poland Linkoping Univ S-58183 Linkoping Sweden

We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method that should be well known but is often neglected. Also, we show how to prove completeness and correctness in the presence of SLD-tree pruning, and point out that approximate specifications simplify specifications and proofs. We compare the proof methods to declarative diagnosis (algorithmic debugging), showing that approximate specifications eliminate a major drawback of the latter. We argue that our proof methods reflect natural declarative thinking about programs, and that they can be used, formally or informally, in everyday programming.

关键词： Logic programming declarative programming program completeness program correctness specifications declarative diagnosis/algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

Demandness in Rewriting and Narrowing

引用

Electronic Notes in Theoretical Computer Science 2002年 76卷 42-51页

作者： Sergio Antoy Salvador Lucas Computer Science Department Portland State University Portland OR 97207 U.S.A Universidad Politécnica de Valencia Spain

The traditional investigation of rewriting and narrowing strategies aims at establishing fundamental properties, such as soundness, completeness and/or optimality, of a strategy. In this work, we analyze and compare rewriting and narrowing strategies from the point of view of the information taken into account by a strategy to compute a step. The notion of demandness provides a suitable framework for presenting and comparing well-known strategies. We find the existence of an almost linear sequence of strategies that take into account more and more information. We show on examples that, as we progress on this sequence, a strategy becomes more focused and avoids some useless steps computed by strategies preceding it in this sequence. Our work, which is still in progress, clarifies the behavior of similar or related strategies and it promises to simplify the transfer of some results from one strategy to another. It also suggest that the notion of demandness is both atomic and fundamental to the study of strategies.

关键词： declarative programming narrowing rewriting strategies

来源：评论

学校读者我要写书评

暂无评论

Telemach*: A Functional Approach to Face Problem Solving in Knowledge- Based Signal Processing Systems

引用

IFAC Proceedings Volumes 1991年第3期24卷 995-1000页

作者： A. Edelmayer A. Soumelidis Systems and Controls Laboratory Computer and Automation Institute Hungarian Academy of Sciences H-1111 Budapest XI Kende u. 13-17 Hungary

This paper presents TELEMACH, a problem solving system which provides syntactically uniform access to heterogeneously implemented knowledge bases. The system is aimed to use in autonomous signal pocessing ap plications such as e.g. , in the fields of knowledge-based system identification and fault detection. The applied knowledge representation scheme is functional in the sense that elemantary knowledge base constituents of the system are specified by their behaviour without any reference to how they are to be implemented. A functional interface is applied to the knowledge base which implements operations on the representation. On the platform of a procedural semantics we introduce the notion of the problem solving supervisor which, - in contrast with the conventional approaches, - exerts control of the reasoning process in a more flexible manner. As to the methodology, our recent approach formalizes the autonomous signal processing system as a discrete event dynamical phenomenon. In this theoretical framework a special action ontology, especially oriented to the signal processing domain, is presented which is based on temporal relations and the concurrent program viewpoint. Daedalus, the integrated graphical knowledge base editor of TELEMACH makes the development of complex signal processing strategies possible. An object oriented design philosophy is used to realize the idea.

关键词： Blackboard systems Discrete event systems declarative programming Functional knowledge representation Knowledge-based systems Signal-symbol processing

来源：评论

学校读者我要写书评

暂无评论

On-demand Evaluation for Maude

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2005年第1期124卷 25-39页

作者： Duran, Francisco Escobar, Santiago Lucas, Salvador Univ Malaga LCC Campus Teatinos Malaga Spain Univ Politecn Valencia DSIC Valencia 46022 Spain

Strategy annotations provide a simple mechanism for introducing some laziness in the evaluation of expressions. As an eager programming language, Maude can take advantage of them and, in fact, they are part of the language. Maude strategy annotations are lists of non-negative integers associated to function symbols which specify the ordering in which the arguments are (eventually) evaluated in function calls. A positive index enables the evaluation of an argument whereas 'zero' means that the function call has to be attempted. The use of negative indices has been proposed to express evaluation on-demand, where the demand is an attempt to match an argument term with the left-hand side of a rewrite rule. In this paper we show how to furnish Maude with the ability of dealing with on-demand strategy annotations.

关键词： declarative programming Maude reflection demandedness on-demand strategy annotations

来源：评论

学校读者我要写书评

暂无评论

Pulverization in Cyber-Physical Systems: Engineering the Self-Organizing Logic Separated from Deployment

引用

FUTURE INTERNET 2020年第11期12卷 203页

作者： Casadei, Roberto Pianini, Danilo Placuzzi, Andrea Viroli, Mirko Weyns, Danny Univ Bologna Alma Mater Studiorum Dept Comp Sci & Engn DIS I-47521 Cesena Fc Italy Katholieke Univ Leuven Dept Comp Sci B-3000 Leuven Belgium Linnaeus Univ Dept Comp Sci S-35195 Vaxjo Sweden

Emerging cyber-physical systems, such as robot swarms, crowds of augmented people, and smart cities, require well-crafted self-organizing behavior to properly deal with dynamic environments and pervasive disturbances. However, the infrastructures providing networking and computing services to support these systems are becoming increasingly complex, layered and heterogeneous-consider the case of the edge-fog-cloud interplay. This typically hinders the application of self-organizing mechanisms and patterns, which are often designed to work on flat networks. To promote reuse of behavior and flexibility in infrastructure exploitation, we argue that self-organizing logic should be largely independent of the specific application deployment. We show that this separation of concerns can be achieved through a proposed "pulverization approach": the global system behavior of application services gets broken into smaller computational pieces that are continuously executed across the available hosts. This model can then be instantiated in the aggregate computing framework, whereby self-organizing behavior is specified compositionally. We showcase how the proposed approach enables expressing the application logic of a self-organizing cyber-physical system in a deployment-independent fashion, and simulate its deployment on multiple heterogeneous infrastructures that include cloud, edge, and LoRaWAN network elements.

关键词： self-organization decentralized control deployment independence declarative programming aggregate computing

来源：评论

学校读者我要写书评

暂无评论

Secure Partitioning of Cloud Applications, with Cost Look-Ahead

引用

FUTURE INTERNET 2023年第7期15卷 224-224页

作者： Bocci, Alessandro Forti, Stefano Guanciale, Roberto Ferrari, Gian-Luigi Brogi, Antonio Univ Pisa Dept Comp Sci I-56127 Pisa Italy KTH Royal Inst Technol Div Theoret Comp Sci S-11428 Stockholm Sweden

The security of Cloud applications is a major concern for application developers and operators. Protecting users' data confidentiality requires methods to avoid leakage from vulnerable software and unreliable Cloud providers. Recently, trusted execution environments (TEEs) emerged in Cloud settings to isolate applications from the privileged access of Cloud providers. Such hardware-based technologies exploit separation kernels, which aim at safely isolating the software components of applications. In this article, we propose a methodology to determine safe partitionings of Cloud applications to be deployed on TEEs. Through a probabilistic cost model, we enable application operators to select the best trade-off partitioning in terms of future re-partitioning costs and the number of domains. To the best of our knowledge, no previous proposal exists addressing such a problem. We exploit information-flow security techniques to protect the data confidentiality of applications by relying on declarative methods to model applications and their data flow. The proposed solution is assessed by executing a proof-of-concept implementation that shows the relationship among the future partitioning costs, number of domains and execution times.

关键词： data confidentiality trusted execution environments separation kernels information-flow security deployment costs declarative programming

来源：评论

学校读者我要写书评

暂无评论

A domain-specific language for structure manipulation in constraint system-based GUIs

引用

JOURNAL OF COMPUTER LANGUAGES 2023年 74卷

作者： Stokke, Knut Anders Barash, Mikhail Jarvi, Jaakko Univ Bergen Bergen Norway Univ Turku Turku Finland

A common frustration with programming Graphical User Interfaces (GUIs) is that features for manipulating structures, such as lists and trees, are limited, inconsistent, buggy, or even missing. Implementing complete and convenient sets of operations for inserting, removing, and reordering elements in such structures can be tedious and difficult: a structure that appears as one collection to the user can be implemented as several different data structures and a web of dependencies between them. Structural modifications require changes both to the GUI's model and view, and possibly extraneous bookkeeping operations, such as adding and removing event *** paper introduces a DSL that helps programmers to implement a complete set of operations to structures displayed in GUIs. The programmer specifies structures and relations between elements in the structure. Concretely, the latter are definitions of methods for establishing and unestablishing relations. Operations that manipulate structures are specified as rules that control which relations should hold before and after a rule is applied. From these specifications, our tools generate an easy-to-use API for structure manipulation. We target constraint system-based Web GUIs: the DSL generates JavaScript and relies on dataflow constraint systems for expressing dependencies between elements in GUI structures. Our DSL gives tangible representations with well-defined operations for ad-hoc and incidental GUI structures.

关键词： GUI programming Separation of concerns Rule based systems declarative programming Dataflow constraint systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：