The “Linking Open Data” community initiative contributed a great deal to the concretization of the web of data, describing best practice, publishing large sets of RDF data on the web, and consequently giving birth to a new area of possibilities for innovative mashups using these data. Enterprises’ information systems too can be envisioned as a space of linked data. We describe herein how we use...

The diierent properties characterizing the operational behavior of logic programs can be organized in a hierarchy of xpoint semantics related by Galois insertions, having the least Herbrand model as most abstract semantics, and the SLD operational semantics as most concrete semantics. The choice of a semantics in the hierarchy allows to model precisely the program properties of interest while g...

Semantics Similar to concrete semantics:  A complete lattice (L#, ≤) as the domain for abstract elements  A monotone function F# corresponding to the concrete function F  Then the abstract semantics is the least fixed point of F#, lfp F# If F# “correctly approximates” F, then lfp F# “correctly approximates” lfp F. An Example Abstract Domain for Values of Variables How to relate the two?  Co...

A new product concept emerges in communication between participants in a design process. In order to succeed in a geographically distributed situation, a computer support system must be able to mediate this kind of communication in product concept design. We will elaborate on concept design, focusing on how designers communicate using artifacts and space to mediate their understandings. During ...

Design patterns provide an especially effective way to improve the quality of a software system design as they provide abstracted, generalized and verified solutions of non-trivial design problems that occur repeatedly. The paper presents a method of design pattern instantiation support based on the key principles of both MDD and MDA. The method allows specification of the pattern instance occu...

As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into a meaningful taxonomy? (2) To what ontology are computer programs committed? (3) What explains the proliferation of programming languages and how do they come about? Taking the complementary perspectives software eng...

In the paper, we develop the notation of duality and equivalence of categories and concrete categories based on [22]. The development was motivated by the duality theory for continuous lattices (see [10, p. 189]), where we need to cope with concrete categories of lattices and maps preserving their properties. For example, the category UPS of complete lattices and directed suprema preserving map...

The present paper concretizes the models proposed by S. Ri and N. Secelean. construction of fractal interpolation function (FIF) considering finite systems consisting Rakotch contractions, but produced no concretization model. Secelean considered countable Banach contractions to produce function. Based on abovementioned results, in this paper, we propose two different algorithms functions both ...

Title of dissertation: FRAMEWORK SYNTHESIS FOR SYMBOLIC EXECUTION OF EVENT-DRIVEN FRAMEWORKS Jinseong Jeon, Doctor of Philosophy, 2016 Dissertation directed by: Professor Jeffrey S. Foster Department of Computer Science Symbolic execution is a powerful program analysis technique, but it is very challenging to apply to programs built using event-driven frameworks, such as Android. The main reaso...