this paper presents the application of evolutionary programming to combined environmental/economic dispatch. the economic and emission objectives are combined linearly to form a single bi-criterion objective. the impl...
详细信息
this paper presents the application of evolutionary programming to combined environmental/economic dispatch. the economic and emission objectives are combined linearly to form a single bi-criterion objective. the implementation of evolutionary programming (EP) approach is demonstrated by an example. Its results are compared with fuzzy logic controlled genetic algorithms. the test results prove that EP method is one of the most effective methods available for solving bi-objective optimisation problems.
the proceedings contain 19 papers. the special focus in this conference is on Models, logic and Verification. the topics include: Towards object-oriented graphs and grammars;rewriting based model for probabilistic dis...
ISBN:
(纸本)3540204911
the proceedings contain 19 papers. the special focus in this conference is on Models, logic and Verification. the topics include: Towards object-oriented graphs and grammars;rewriting based model for probabilistic distributed object systems;engineering the sdl formal language definition;a syntax-directed hoare logic for object-oriented programming concepts;inheritance of temporal logic properties;temporal logic based static analysis for non-uniform behaviours;operational semantics and type system;a calculus for long-running transactions;formal analysis of some timed security properties in wireless protocols;inductive proof outlines for monitors in java;managing the evolution of .NET programs;on mobility extensions of UML statecharts;new operators for the turtle real-time UML profile;checking consistency in UML diagrams;compositional verification using CADP of the scalagent deployment protocol for software components;verification of distributed object-based systems and design and verification of distributed multi-media systems.
the main purpose of our work is the typing of concurrent, distributed and mobile programs based on the actor programming model, that is non-uniform behaviour concurrent objects communicating by asynchronous message pa...
详细信息
ISBN:
(纸本)3540204911
the main purpose of our work is the typing of concurrent, distributed and mobile programs based on the actor programming model, that is non-uniform behaviour concurrent objects communicating by asynchronous message passing. One of the key difficulties is to give a precise definition of "message not understood" errors in this context. In this paper, we investigate temporal logic and model-checking based technologies for an asynchronous message passing process calculi. We focus on non uniform input interfaces for processes, and then define a temporal logic tailored to their description and analyses. this logic deals with infinite-state systems, as mailboxes of actors are unbounded multisets of messages, but yet happens to be decidable. We use our logic to specify possible communication errors in actor-based programs in order to give precise and sound definition of type disciplines.
this paper outlines a sound and complete Hoare logic for a sequential object-oriented language with inheritance and subtyping like Java. It describes a weakest precondition calculus for assignments and object-creation...
详细信息
this paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers a rule supporting gliders and the sec...
详细信息
Monads have been recognized by Moggi as an elegant device for dealing with stateful computation in functional programming languages. It is thus natural to develop a Hoare calculus for reasoning about computational mon...
详细信息
the proceedings contain 27 papers. the special focus in this conference is on Software components, Mobile computing, Aspect and object-oriented programming, Distributed and web applications, Software measurements, For...
ISBN:
(纸本)3540008993
the proceedings contain 27 papers. the special focus in this conference is on Software components, Mobile computing, Aspect and object-oriented programming, Distributed and web applications, Software measurements, Formal verification, Analysis and testing and Model integrations and extensions. the topics include: An ontology for software component matching;a description language for composable components;a logical basis for the specification of reconfigurable component-based systems;an overall system design approach doing object-oriented modeling to code-generation for embedded electronic systems;composing specifications of event based applications;a Spatio-Temporal logic for the specification and refinement of mobile systems;spatial security policies for mobile agents in a sentient computing environment;towards UML-based formal specifications of component-based real-time software;modelling recursive calls with UML state diagrams;model-based development of web applications using graphical reaction rules;modular analysis of dataflow process networks;foundations of a weak measurement-theoretic approach to software measurement;an information-based view of representational coupling in object-oriented systems;a temporal approach to specification and verification of pointer data-structures;a program logic for handling java card’s transaction mechanism;automatic model driven animation of SCR specifications;probe mechanism for object-oriented software testing;integration of formal datatypes within state diagrams;towards a natural interoperability between XML and ER diagrams;detecting implied scenarios analyzing non-local branching choices and capturing overlapping, triggered, and preemptive collaborations using MSCs.
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infinite set F the chosen domain is the se...
详细信息
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infinite set F the chosen domain is the set of trees whose nodes, in possibly infinite number, are labelled by elements of F. the operation linked to each element f of F is the mapping (a(1),...a(n)) bar right arrow b, where b is the tree whose initial node is labelled f and whose sequence of daughters is a(1)..., a(n). We first consider tree constraints involving long alternated sequences of quantifiers there ExistsFor Allthere ExistsFor All.... We show how to express winning positions of two-person games with such constraints and apply our results to two examples. We then construct a family of strongly expressive tree constraints, inspired by a constructive proof of a complexity result by Pawel Mielniczuk. this family involves the huge number alpha(k), obtained by top down evaluating a power tower of 2's, of height k. By a tree constraint of size proportional to k, it is then possible to define a tree having exactly alpha(k) nodes or to express the multiplication table computed by a Prolog machine executing up to alpha(k) instructions. By replacing the Prolog machine with a Turing machine we show the quasi-universality of tree constraints, that is to say, the ability to concisely describe trees which the most powerful machine will never have time to compute. We also rediscover the following result of Sergei Vorobyov: the complexity of an algorithm, deciding whether a tree constraint without free variables is true, cannot be bounded above by a function obtained from finite composition of simple functions including exponentiation. Finally, taking advantage of the fact that we have at our disposal an algorithm for solving such constraints in all their generalities, we produce a set of benchmarks for separating feasible examples from purely speculative ones. Among others we notice that it is poss
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infinite set F the chosen domain is the se...
详细信息
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infinite set F the chosen domain is the set of trees whose nodes, in possibly infinite number, are labelled by elements of F. the operation linked to each element f of F is the mapping (a(1),...a(n)) bar right arrow b, where b is the tree whose initial node is labelled f and whose sequence of daughters is a(1)..., a(n). We first consider tree constraints involving long alternated sequences of quantifiers there ExistsFor Allthere ExistsFor All.... We show how to express winning positions of two-person games with such constraints and apply our results to two examples. We then construct a family of strongly expressive tree constraints, inspired by a constructive proof of a complexity result by Pawel Mielniczuk. this family involves the huge number alpha(k), obtained by top down evaluating a power tower of 2's, of height k. By a tree constraint of size proportional to k, it is then possible to define a tree having exactly alpha(k) nodes or to express the multiplication table computed by a Prolog machine executing up to alpha(k) instructions. By replacing the Prolog machine with a Turing machine we show the quasi-universality of tree constraints, that is to say, the ability to concisely describe trees which the most powerful machine will never have time to compute. We also rediscover the following result of Sergei Vorobyov: the complexity of an algorithm, deciding whether a tree constraint without free variables is true, cannot be bounded above by a function obtained from finite composition of simple functions including exponentiation. Finally, taking advantage of the fact that we have at our disposal an algorithm for solving such constraints in all their generalities, we produce a set of benchmarks for separating feasible examples from purely speculative ones. Among others we notice that it is poss
the proceedings contain 18 papers. the special focus in this conference is on Constraints, Program Transformation and Analysis. the topics include: the essence of XML;to the gates of HAL;functional logic design patter...
ISBN:
(纸本)3540442332
the proceedings contain 18 papers. the special focus in this conference is on Constraints, Program Transformation and Analysis. the topics include: the essence of XML;to the gates of HAL;functional logic design patterns;on consistency and width notions for constraint programs with algebraic constraints;solving mixed quantified constraints over a domain based on real numbers and herbrand terms;on the correctness of the factoring transformation;lambda-lifting in quadratic time;the well-founded semantics in normal logic programs with uncertainty;monadic and CPS transformations into the linear lambda calculus;coinductive interpreters for process calculi;descendants and head normalization of higher-order rewrite systems;narrowing failure in functional logicprogramming;system description and performance evaluation;dynamic-cut with definitional trees;the head condition and polymorphic recursion;structural abstraction and application in logicprogramming and a functional calculus for scientific discovery.
暂无评论