Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for ...
详细信息
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In this paper, we question, apparently for the first time, whether this domain is over-complex for pair-sharing analysis, We show that the answer is Yes. By defining an equivalence relation over the set-sharing domain we obtain a simpler domain, reducing the complexity of the abstract unification procedure, We present experimental results showing that, in practice, our domain compares favorably with the set-sharing one over a wide range of benchmark and real programs. (C) 2002 Elsevier Science B.V. All rights reserved.
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML (SML) programs, This analysis will predict abrupt termination of SML programs, which is SMLs ...
详细信息
We present a static analysis that detects potential runtime exceptions that are raised and never handled inside Standard ML (SML) programs, This analysis will predict abrupt termination of SML programs, which is SMLs only one "safety hole". Even though SML program's control flow and exception now are in general mutually dependent, analyzing the two flows are safely decoupled. Program's control flow is firstly estimated by simple case analysis of call expressions. Using this call-graph information, program's exception flow is derived as set constraints, whose least model is our analysis result. Both of these two analyses are proven safe and the reasons behind each design decision are discussed. Our implementation of this analysis has been applied to realistic SML programs and shows a promising cost-accuracy performance, For the ML-Lex program, for example, the analysis takes 1.36 s and it reports 3 may-uncaught exceptions. which are exactly the exceptions that can really escape. Our final goal is to make the analysis overhead less than 10% of the compilation time (compiling the ML-Lex takes 6-7 s) and to analyze modules in isolation. (C) 2002 Elsevier Science B.V. All rights reserved.
Multiparadigm approach integrates programming language paradigms. We have proposed Holoparadigm (Holo) as a multiparadigm model oriented to development of distributed systems. Holo uses a logic blackboard (called hist...
详细信息
ISBN:
(纸本)0769517609
Multiparadigm approach integrates programming language paradigms. We have proposed Holoparadigm (Holo) as a multiparadigm model oriented to development of distributed systems. Holo uses a logic blackboard (called history) to implement a coordination mechanism. The programs are organized in levels using abstract entities called beings. First, we describe the principal concepts of the Holoparadigm. After, we propose the Distributed Holo (DHolo), a model to support the distributed execution of programs developed in Holo. DHolo is based on object mobility and blackboards. This distributed model can be fully implemented on Java platform. Experiments were done using Voyager and Horb to implement mobility. Blackboards were implemented using Jada and JavaSpaces.
We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that...
详细信息
ISBN:
(纸本)354000131X
We introduce the declarative programming language Indeed that uses both deduction and interaction through multi-agent system applications. The language design is addressed by providing a uniform programming model that combines two refinements of resolution along with some control strategies to introduce state-based descriptions. We show that the logical calculus in which the computational model is based is sound and complete. Finally, we compare our approach to others proposed for coupling interaction with automated deduction.
Adaptation is an important requirement for mobile applications due to the varying levels of resource availability that characterises mobile environments. However without proper control, multiple applications can each ...
详细信息
ISBN:
(纸本)0769516122
Adaptation is an important requirement for mobile applications due to the varying levels of resource availability that characterises mobile environments. However without proper control, multiple applications can each adapt independently in response to a range of different adaptive stimuli, causing conflicts or suboptimal performance. In this paper we present a policy driven approach for mobile adaptive systems that can overcome the aforementioned problems. Our system is based on a policy language derived from the Event Calculus logic programming formalism. Important characteristics of our policy language are the support for explicit expressions of time dependencies and the simple and user friendly syntax.
Different many-valued logic programming frameworks have been proposed to manage uncertain information in deductive databases and logic programming. A feature of these frameworks is that they rely on a predefined assum...
详细信息
ISBN:
(纸本)3540441905
Different many-valued logic programming frameworks have been proposed to manage uncertain information in deductive databases and logic programming. A feature of these frameworks is that they rely on a predefined assumption or hypothesis, i.e. an interpretation that assigns the same default truth value to all the atoms of a program, e.g. in the open world assumption, by default all atoms have unknown truth value. In this paper we extend these frameworks along three directions: (i) we will introduce non-monotonic modes of negation;(ii) the default truth values of atoms need not necessarily to be all equal each other;and (iii) a hypothesis can be a partial interpretation. We will show that our approach extends the usual ones: if we restrict our attention to classical logic programs and consider total uniform hypotheses, then our semantics reduces to the usual semantics of logic programs. In particular, under the everything false assumption, our semantics captures and extends the well-founded semantics to these frameworks.
Evolution (incremental change) of software is pre-dominant over development from scratch. Transformations provide a general and uniform view of incremental software development. Based on this unifying view, this works...
详细信息
ISBN:
(纸本)354044310X
Evolution (incremental change) of software is pre-dominant over development from scratch. Transformations provide a general and uniform view of incremental software development. Based on this unifying view, this workshop provides a forum to discuss both the phenomenon of evolution as such and its support by techniques and tools. Thereby, we cover: the transformation of different artifacts, like models, code, or data, different transformation techniques, like graph transformation, term-rewriting, logic programming, etc., different motivations for transformations, like forward, reverse, and re-engineering, as well as different semantic interpretations and combinations of transformations. Moreover, the workshop features a session on case studies for visual modelling techniques, held jointly with GT-VMT, which is open to all participants of the conference and includes problems related to evolution as one specific aspect.
The aspps system is an answer-set programming system based on the extended logic of propositional schemata [2], which allows variables but not function symbols in the language. We denote this logic PS+. A theory in th...
详细信息
ISBN:
(纸本)3540441905
The aspps system is an answer-set programming system based on the extended logic of propositional schemata [2], which allows variables but not function symbols in the language. We denote this logic PS+. A theory in the logic PS+ is a pair (D,P), where D is a set of ground atoms (only constant symbols as arguments) representing an instance of a problem (input data), and P is a set of PS+-clauses representing a program (an abstraction of a problem). The meaning of a PS+-theory T = (D,P) is given by a family of PS+-models [2].
Many logic programming implementations compile to C, but they compile to very low-level C, and thus discard many of the advantages of compiling to a high-level language. We describe an alternative approach to compilin...
详细信息
ISBN:
(纸本)3540433694
Many logic programming implementations compile to C, but they compile to very low-level C, and thus discard many of the advantages of compiling to a high-level language. We describe an alternative approach to compiling logic programs to C, based on continuation passing, that we have used in a new back-end for the Mercury compiler. The new approach compiles to much higher-level C code, which means the compiler back-end and run-time system can be considerably simpler. We present a formal schema for the transformation, and give benchmark results which show that this approach delivers performance that is more than competitive with the fastest previous implementation, with greater simplicity and better portability and interoperability. The approach we describe can also be used for compiling to other target languages, such as IL (the Microsoft NET intermediate language).
The class of finitary normal logic programs-identified recently, [1]-makes it possible to reason effectively with function symbols, recursion, and infinite stable models. These features may lead to a full integration ...
详细信息
ISBN:
(纸本)3540439307
The class of finitary normal logic programs-identified recently, [1]-makes it possible to reason effectively with function symbols, recursion, and infinite stable models. These features may lead to a full integration of the standard logic programming paradigm with the answer set programming paradigm. For all finitary programs, ground goals axe decidable, while nonground goals are semidecidable. Moreover, the existing engines (that currently accept only much more restricted programs [11,7]) can be extended to handle finitary, programs by replacing their front-ends and keeping their core inference mechanism unchanged. In this paper, the theory of finitary normal programs is extended to disjunctive programs. More precisely, we introduce a suitable generalization of the notion of finitary program and extend all the results of [1] to this class. For this purpose, a consistency result by Fages is extended from normal programs to disjunctive programs. We also correct an error occurring in [1].
暂无评论