We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and submechanisms and is well-suited to the proof-planning paradigm. the system (ADEPTUS), that ...
详细信息
ISBN:
(纸本)9783540730835
We address the problem of automatic synthesis of decision procedures. Our synthesis mechanism consists of several stages and submechanisms and is well-suited to the proof-planning paradigm. the system (ADEPTUS), that we present in this paper, synthesised a decision procedure for ground arithmetic completely automatically and it used some specific method generators in generating a decision procedure for linear arithmetic, in only a few seconds of CPU time. We believe that this approach can lead to automated assistance in constructing decision procedures and to more reliable implementations of decision procedures.
the pest catastrophe prediction in ecology catastrophe is one of important part in expert system of intelligence agriculture and also the guarantee for preventing and controlling the pest catastrophe occurrence effici...
详细信息
ISBN:
(纸本)9783540725879
the pest catastrophe prediction in ecology catastrophe is one of important part in expert system of intelligence agriculture and also the guarantee for preventing and controlling the pest catastrophe occurrence efficiently. the paper introduces the basic principles and methods of current catastrophe prediction in ecology catastrophe. According to modeling for the dynamic process of population, up-grown and amount of spawn, the paper finds out the trigger point and critical value inducing the pest catastrophe and implements the catastrophe prediction of Cnaphalocrosis Medinalis, which take measures before catastrophe to prevent big population coming into being.
A major bottleneck in the evolutionary design of electronic circuits is the problem of scale. this refers to the very fast growth of the number of gates, used in the target circuit, as the number of inputs of the evol...
详细信息
ISBN:
(数字)9783540746263
ISBN:
(纸本)9783540746256
A major bottleneck in the evolutionary design of electronic circuits is the problem of scale. this refers to the very fast growth of the number of gates, used in the target circuit, as the number of inputs of the evolved logic function increases. Another related obstacle is the time required to calculate the fitness value of a circuit. In this paper, We propose a new means (Gene Expression programming) for designing electronic circuits and introduces the encoding of the circuit as a chromosome, the genetic operators and the fitness function. From the case studies show this means has proved to be efficient to the electronic circuit and the evolution speed is fast. the experiments results show that we have attained the better results.
CIRC is an automated circular coinductive prover implemented as an extension of Maude. the main engine of CIRC consists of a set of rewriting rules implementing the circularity principle. the power of the prover can b...
详细信息
CIRC is an automated circular coinductive prover implemented as an extension of Maude. the main engine of CIRC consists of a set of rewriting rules implementing the circularity principle. the power of the prover can be increased by adding new capabilities implemented also by rewriting rules. In this paper we prove the correctness of the coinductive prover and show how rewriting strategies, expressed as regular expressions, can be used for specifying proof tactics for CIRC. We illustrate the strength of the method by defining a proof tactic combining the circular coinduction with a particular form of simplification for proving the equivalence of context-free processes.
To be cost effective, the decision to automate tests that are usually hand-executed has to rely on a tradeoff between the time consumed to build the automation infrastructure and the time actually saved by the automat...
详细信息
For more than 20 years relational model is the most important database model. So, it is examined in the most various ways. A very important concept in the relational model is the concept of dependencies, especially fu...
详细信息
For more than 20 years relational model is the most important database model. So, it is examined in the most various ways. A very important concept in the relational model is the concept of dependencies, especially functional dependencies. It is proven that functional dependencies can be represented by formulae of prepositional or predicate calculus. there are several systems of transforming functional dependencies into a logic system, known from the literature, but all of them has one serious drawback: they do not have a form that is appropriate for reasoning about normalization. this paper presents a new approach to the process of transforming functional dependencies into predicate calculus. the system presented in this paper is designed in the way to be appropriate for normalization, reasoning about it, as well as for the building a system for automated normalization of databases.
the need for a more autonomous management of distributed systems and networks has driven research and industry to look for management frameworks that go beyond the direct manipulation of network devices and systems. O...
详细信息
ISBN:
(纸本)9783540721994
the need for a more autonomous management of distributed systems and networks has driven research and industry to look for management frameworks that go beyond the direct manipulation of network devices and systems. One approach towards this aim is to build policy-based management systems. Policy-based computing refers to a software paradigm developed around the concept of building autonomous systems that provide system administrators and decision makers with interfaces that let them set general guiding principles and policies to govern the behavior and interactions of the managed systems. Although many of the tasks are still carried out manually and ad hoc, instances of limited policy-based systems can be found in areas such as Internet service management, privacy, security and access management, management of quality of service and service level agreements in networks. Policies can be specified at many levels of abstraction, from natural language specifications to more elementary condition-action rule specifications. From these specifications policy systems need to come up with implementations. Some of these implementations can be done automatically, others require manual steps. In some cases policies impose legal commitments and systems should be able to demonstrate compliance. there are also situations in which policies are in conflict with each other and a system cannot implement them simultaneously without providing methods for conflict resolution. In this presentation I will review a few policy systems, applications and specification languages. then I will provide a more formal characterization of policies and their computational model. I will show a simple policy language in the style of the action description language A. I will discuss current solutions to policy conflicts, discuss the problem of policy refinement, i.e. transformations from high level specifications to lower level specifications, current approaches to refinement and provide a partial formal
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predi...
详细信息
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates. To improve expressivity, we have proposed a prover that can automatically handle user-defined predicates. these shape predicates allow programmers to describe a wide range of data structures withtheir associated size properties. In the current work, we shall enhance this prover by providing support for a new type of constraints, namely bag (multi-set) constraints. Withthis extension, we can capture the reachable nodes (or values) inside a heap predicate as a bag constraint. Consequently, we are able to prove properties about the actual values stored inside a data structure.
Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualitative forms of reasoning. Yet, this same combin...
详细信息
ISBN:
(纸本)9783540744061
Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualitative forms of reasoning. Yet, this same combinatorial explosion makes the traditional modelling paradigm based on systems of differential equations impractical. In contrast, agent-based or concurrent languages, such as kappa. [1,2,3] or the closely related BioNetGen language [4,5,6,7,8,9,10], describe biological interactions in terms of rules, thereby avoiding the combinatorial explosion besetting differential equations. Rules are expressed in an intuitive graphical form that transparently represents biological knowledge. In this way, rules become a natural unit of model building, modification, and discussion. We illustrate this with a sizeable example obtained from refactoring two models of EGF receptor signalling that are based on differential equations [11,12]. An exciting aspect of the agent-based approach is that it naturally lends itself to the identification and analysis of the causal structures that deeply shape the dynamical, and perhaps even evolutionary, characteristics of complex distributed biological systems. In particular, one can adapt the notions of causality and conflict, familiar from con-currency theory, to kappa, our representation language of choice. Using the EGF receptor model as an example, we show how causality enables the formalization of the colloquial concept of pathway and, perhaps more surprisingly, how conflict can be used to dissect the signalling dynamics to obtain a qualitative handle on the range of system behaviours. By taming the combinatorial explosion, and exposing the causal structures and key kinetic junctures in a model, agent- and rule-based representations hold promise for making modelling more powerful, more perspicuous, and of appeal to a wider audience.
State of the art analyzers in the logicprogramming (LP) paradigm are nowadays mature and sophisticated. they allow inferring a wide variety of global properties including termination, bounds on resource consumption, ...
ISBN:
(纸本)9783540696087
State of the art analyzers in the logicprogramming (LP) paradigm are nowadays mature and sophisticated. they allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. the aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (jvml). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a jvml interpreter implemented in LP together with (an LP representation of) a jvml program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original jvml programs. this can be seen as a decompilation from jvml to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of jvml programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode.
暂无评论