The possibility of employing the semantic theory of programming languages to analyze Win32 applications for detecting locks and deadlocks in them is proved. An appropriate formal method is developed. The use of the pr...
详细信息
The possibility of employing the semantic theory of programming languages to analyze Win32 applications for detecting locks and deadlocks in them is proved. An appropriate formal method is developed. The use of the proposed approach is demonstrated on examples.
Many important investigation problems of operations, game theory, computation mathematics and mathematical economics are reduced to the problem of equilibrium programming. For solving equilibrium problems the second-o...
详细信息
Many important investigation problems of operations, game theory, computation mathematics and mathematical economics are reduced to the problem of equilibrium programming. For solving equilibrium problems the second-order continuous variant of the gradient-projection method is suggested with forecasting in the space with variable metric. The trajectory convergence to an equilibrium points set in any choice of the initial point is proved.
In type systems based on subtyping, type equality is replaced with subtyping, which is a less restrictive relationship. The idea is, if τ1 is a subtype of τ2, then a value of type τ1 can be transparently supplied w...
详细信息
In type systems based on subtyping, type equality is replaced with subtyping, which is a less restrictive relationship. The idea is, if τ1 is a subtype of τ2, then a value of type τ1 can be transparently supplied whether a value of type τ2 is expected. Subtyping is used as a key concept to create formal type systems for object-oriented languages. These systems often require to be annotated with user-supplied type information. Being able to omit this information, or at least part of it, provides the programmer a greater degree of freedom, hence the desire arises to do type inference in the presence of subtyping.
This paper describes a formal derivation of an optimized Ackermann's function following a general and systematic method based on incrementalization. The method identifies an appropriate input increment operation a...
详细信息
This paper describes a formal derivation of an optimized Ackermann's function following a general and systematic method based on incrementalization. The method identifies an appropriate input increment operation and computes the function by repeatedly performing an incremental computation at the step of the increment. This eliminates repeated subcomputations in executions that follow the straightforward recursive definition of Ackermann's function, yielding an optimized program that is drastically faster and takes extremely little space. This case study uniquely shows the power and limitation of the incrementalization method, as well as both the iterative and recursive nature of computation underlying the optimized Ackermann's function.
The article is devoted to review of modern methods of transformation synthesis program. The considered methods are classified into algebraic, algebra-grammatical, logic-grammatical, theoretical-graph program synthesis...
详细信息
The article is devoted to review of modern methods of transformation synthesis program. The considered methods are classified into algebraic, algebra-grammatical, logic-grammatical, theoretical-graph program synthesis, mixed calculation and concrete programming. A special attention is paid to specifications, based on integration of algebraic, logic-theoretical and grammatical formalisms.
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languages, including tag-free garbage collect...
详细信息
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, polymorphic marshalling, and flattened data structures. A type-theoretic framework that supports intensional polymorphism, but avoids many of the disadvantages of type passing, is presented. In this method, run time type information is represented in ordinary terms. This avoids the duplication problem, allows to recover abstraction, and avoids complications with closure conversion. In addition, the type system provides another improvement in expressiveness.
We provide a set of transformations capable of transforming a straight line program into any other equivalent one assuming no algebraic laws hold. We then show that optimization of straight line code under “reasonabl...
详细信息
We provide a set of transformations capable of transforming a straight line program into any other equivalent one assuming no algebraic laws hold. We then show that optimization of straight line code under “reasonable” cost criteria can always be accomplished by applying sequences of these transformations in a prescribed order.
The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a aggregation-disaggregation scheme is applied to similarly...
详细信息
The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a aggregation-disaggregation scheme is applied to similarly structured and organized enterprise. In contrast to the known aggregation techniques, where the decision variables/production planes are aggregated, it is proposed to aggregate resources allocated by the central planning department among the divisions. This approach results in a decomposition procedure, in which the central unit has no optimization problem to solve and should only average local information provided by the divisions.
Package instances, such as generic formal package parameters, need to be incorporated into Ada9X. Local package instances are not capable of providing the full expressive power of generic package parameters. Several e...
详细信息
Package instances, such as generic formal package parameters, need to be incorporated into Ada9X. Local package instances are not capable of providing the full expressive power of generic package parameters. Several examples, including a window manager, are cited to help explain why package parameters are needed and cannot be achieved by Ada83.
The idea of modular term rewriting systems (TRSs) is extended by allowing modules to share constructors, and it is proved that there is no infinite sequence of modular reduction;thus a modular TRS with shared construc...
详细信息
The idea of modular term rewriting systems (TRSs) is extended by allowing modules to share constructors, and it is proved that there is no infinite sequence of modular reduction;thus a modular TRS with shared constructors is terminating iff every module is terminating.
暂无评论