the proceedings contain 10 papers. the topics discussed include: certified web services in Ynot;towards a framework for the verification of UML models of services;analyzing a proxy cache server performance model with ...
the proceedings contain 10 papers. the topics discussed include: certified web services in Ynot;towards a framework for the verification of UML models of services;analyzing a proxy cache server performance model withthe probabilistic model checker PRISM;verification of web content: a case study on technical documentation;a query language for OWL based on logicprogramming;obtaining accessible RIA UIs by combining RUX-Method and SAW;automatic functional and structural test case generation for web applications based on agile frameworks;benchmarking and improving the accessibility of Norwegian municipality web sites;a rule-based approach for semantic consistency management in web information systems development;and slicing microformats for information retrieval.
this paper proposes a declarative description of user interfaces that abstracts from low-level implementation details. In particular, the user interfaces specified in our framework are executable as graphical user int...
详细信息
ISBN:
(纸本)9783540929949
this paper proposes a declarative description of user interfaces that abstracts from low-level implementation details. In particular, the user interfaces specified in our framework are executable as graphical user interfaces for desktop applications as well as web user interfaces via standard web browsers. thus, our approach combines the advantages of existing user interface technologies in a flexible way without demands on the programmer's side. We sketch an implementation of this concept in the declarative multi-paradigm programming language Curry and show how the integrated functional and logic features of Curry are exploited to enable a high-level implementation of this concept.
the current trends in software engineering aim at narrowing the semantic and syntactic gap between the representation formalism of humans and of computers. this paper gives an overview on the application of natural la...
详细信息
the current trends in software engineering aim at narrowing the semantic and syntactic gap between the representation formalism of humans and of computers. this paper gives an overview on the application of natural language interface in software engineering applications and describes the structure of a NLI-based UML model developer module. An extended UML kernel metamodel is presented for the NLI dialog interface and UML generation.
Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contr...
详细信息
ISBN:
(纸本)9783540789680
Since linear logic was proposed by Girard, a number of type systems inspired by linear logic (or substructural logics in general) have been proposed. Examples include linear type systems, where the weakening and contraction rules are restricted, and ordered type systems, where the exchange rule is also restricted. those type systems turned out to be very useful for reasoning about temporal properties of programs, like a memory cell is deallocated only once, or a memory cell is never read or written after it is deallocated. In this talk, I will focus on substructural type systems for program analysis, and review their principles and applications [1,2,3,4,5]. 1 will also discuss some emerging techniques and future directions of substructural-type-based program analysis.
Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. this problem affects every aspect of a planning process...
详细信息
ISBN:
(纸本)9783540776833
Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. this problem affects every aspect of a planning process. We will present an argumentation-based formalism that an agent could use for constructing plans starting from a previously introduced formalism. In such a formalism, agents represent their knowledge about their environment in Defeasible logicprogramming, and have a set of actions they can execute to affect their environment. these actions are defined in combination with a defeasible argumentation formalism. We will analyze the interplay of arguments and actions when constructing plans using Partial Order Planning techniques.
the proceedings contain 25 papers. the topics discussed include: coupling design and verification in software product lines;random geometric identification;strategic abilities of agents;alternative characterizations f...
详细信息
ISBN:
(纸本)3540776834
the proceedings contain 25 papers. the topics discussed include: coupling design and verification in software product lines;random geometric identification;strategic abilities of agents;alternative characterizations for program equivalence under answer-set semantics based on unfounded sets;appropriate reasoning about data dependencies in fixed and undetermined universes;autonomous sets - a method for hypergraph decomposition with applications in database theory;information-optimal reflections of view updates on relational database schemata;merging first-order knowledge using dilation operators;reasoning on data models in schema translation;tightly integrated probabilistic description logic programs for representing ontology mappings;using transversals for discovering XML functional dependencies;and visibly pushdown transducers for approximate validation of streaming XML.
In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible logicprogramming) in game-theoretic terms. By considering a game between a Proponent and an Opponent, in which they present a...
详细信息
ISBN:
(纸本)9783540776833
In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible logicprogramming) in game-theoretic terms. By considering a game between a Proponent and an Opponent, in which they present arguments for and against each literal we obtain a bigger gamut of truth values for those literals and their negations as they are defended and attacked. An important role in the determination of warranted literals is assigned to a defeating relation among arguments. We consider first an unrestricted version in which these games may be infinite and then we analyze the underlying assumptions commonly used to make them finite. Under these restrictions the games are always determined -one of the players has a winning strategy. We show how varying the defeating relation may alter the set of truth values reachable under this formalism. We also show how alternative characterizations of the defeating relation may lead to different assignations of truth values to the literals in a DeLP program.
the practical problem can be described in the following way. Physical objects (credit cards, important documents) should be identified using geometric labels. An optical device reads the label and a simple computation...
详细信息
ISBN:
(纸本)3540776834
the practical problem can be described in the following way. Physical objects (credit cards, important documents) should be identified using geometric labels. An optical device reads the label and a simple computation checks whether the label belongs to the given object or not. this could be done by "asking" an authority which stores certain data (e.g. the reading of the label) of the objects in question. this, however, supposes the existence of an online connection which could technically be difficult, on the other hand it would be a source of evedropping. this is why the identification will be done using the label and a 0,1 sequence both placed on the object. the sequence can be determined from the label. this calculation is done first when the document is supplied withthem, later each time when identification is needed the reading and calculation are repeated and it is checked whether the result is the 0,1 sequence written on the object or not. Of course the method has practical values only when the label cannot be easily reproduced. Moreover we suppose that the labels are randomly generated. More mathematically, the space S of all possible labels is known and a (deterministic) function f mapping S into {0,1} n, that is, the set of 0,1 sequences of length n. this function is used first in the "factory" where the labels and the 0,1 sequences are placed on the objects, and later each time when the identification is necessary. the size |S| of S is either infinite or finite, but even in the latter case |S| is much larger than the number of 0,1 sequences, 2n. the subset A ⊂ S satisfying A = { a: f(a) = i} for a given 0,1 sequence i is denoted by Ai. Of course, must hold for . the situation however is even more serious. the reading device can read the label only with a certain error. therefore we have to suppose that the space is endowed with a distance d. (0 ≤ d(a,b)(= d(b,a)) is defined for all pairs a,b ∈ S, where d(a,b) = 0 iff a = b and the triangle inequality d(
Embedded computer systems are rapidly gaining more and more ground, from stand alone systems to networked based systems with complex logic. the primary goal of embedded systems is to provide a reliable service over a ...
详细信息
ISBN:
(纸本)9781424414420
Embedded computer systems are rapidly gaining more and more ground, from stand alone systems to networked based systems with complex logic. the primary goal of embedded systems is to provide a reliable service over a period of time without any kind of intervention. these systems are mainly programmed in low level languages and are often the subject of software flaws inherited from unsafeness of these languages. the purpose of our research is to develop safe, secure, verifiable software for these systems, without significant performance loss. Withthe use of functional paradigm we are able to rapidly develop elegant code and solve complex tasks with ease.
the integration of functional and logicprogramming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: sharing computations across non-deter...
详细信息
ISBN:
(纸本)9783540766360
the integration of functional and logicprogramming is a well developed field of research. We discuss that the integration could be improved significantly in two separate aspects: sharing computations across non-deterministic branching and the declarative encapsulation of logic search. We then present a formal approach which shows how these improvements can be realized and prove the soundness of our approach.
暂无评论