检索结果-内蒙古大学图书馆

Implementation of combinatorial generation based on object-oriented infrastructure for full enumeration

学校读者我要写书评

暂无评论

IPPTA: Quarterly Journal of Indian Pulp and Paper Technical ...

IPPTA: Quarterly Journal of Indian Pulp and Paper Technical Association 2018年第2期30卷 362-366页

作者： Wei, Yong Xu, Shouxiang He, Tao Software School Shenzhen Institute of Information Technology Shenzhen China

The enumeration infrastructure solves the enumeration problem of n steps. The generation of combinatorial c (m, n) can be regarded as a n step from m objects, and the problem of taking one object at each step. In the full enumeration infrastructure, n steps are considered as S1, S2,... Sn object, the choice of each step object r1, r2,... rn is a generating solution. The outer loop of the enumerated Infrastructure pops out the step object from the stack until the stack is empty, and the internal loop find the choice of each step from the currently popped step object to the last step object. If a step can select, push the step object into the stack. At the end of each inner loop, we can get an enumeration, then giving all the solutions of c (m, n) until the end of the program. © 2018 Indian Pulp and Paper Technical Association. All rights reserved.

关键词： object oriented programming

Smalltalk: The leading language to learn object-oriented programming

学校读者我要写书评

暂无评论

Smalltalk: The leading language to learn object-oriented pro...

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： José A. Gallud Ricardo Tesoriero Pedro González ISE Research Group. Computing Research Institute University of Castilla La Mancha Albacete Spain

ISBN: (纸本)9781467307086

The use of Java in the first courses of Computing, Computer Sciences and similar degrees is widely accepted. However, many programming professors realize that while is possible for students to use an object-oriented language, is also possible to program with them without applying an object-oriented mentality. This paper defends the use of Smalltalk programming language as the best option for students to learn object-oriented programming and acquiring an object-oriented mentality at the same time. This study is based on three years of experience in a course on Software Design.

关键词： Java object oriented programming Libraries Software design Communities

Thinging vs objectfyng in Software Engineering

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Al-Fedaghi, Sabah Computer Engineering Department Kuwait University Kuwait

In this paper, we propose the use of a modeling methodology based on the notion of thing, with a focus on the current stage of research being on the analysis phase of software system modeling. The object-oriented approach, which takes the object as a central concept, provides the opportunity to explore applying thinging to the reconceptualization of objects. Several object-oriented examples are recast in terms of thing-oriented modeling. The results indicate a positive development that leads to several possible options: (1) supplementing the object orientation (OO) paradigm with additional notations, and (2) promoting a further understanding of some aspect of the OO paradigm. The possibility of developing a new approach in modeling based on thinging also exists. Copyright © 2018, The Authors. All rights reserved.

关键词： object oriented programming

GENASIS Basics: object-oriented utilitarian functionality for large-scale physics simulations (Version 2)

学校读者我要写书评

暂无评论

Computer Physics Communications 2017年 214卷 247-248页

作者： Cardall, Christian Y. Budiardja, Reuben D. Physics Division Oak Ridge National Laboratory Oak RidgeTN37831-6354 United States Department of Physics and Astronomy University of Tennessee KnoxvilleTN37996-1200 United States National Institute for Computational Sciences University of Tennessee KnoxvilleTN37996 United States National Center for Computational Sciences Oak Ridge National Laboratory Oak Ridge TN37831-6354 United States

GENASISBasics provides Fortran 2003 classes furnishing extensible object-oriented utilitarian functionality for large-scale physics simulations on distributed memory supercomputers. This functionality includes physical units and constants;display to the screen or standard output device;message passing;I/O to disk;and runtime parameter management and usage statistics. This revision–Version 2 of Basics–makes mostly minor additions to functionality and includes some simplifying name changes. New version program summary Program Title: SineWaveAdvection, SawtoothWaveAdvection, and RiemannProblem (fluid dynamics example problems illustrating GENASISBasics);ArgonEquilibrium and ClusterFormation (molecular dynamics example problems illustrating GENASISBasics) Program Files doi:http://***/10.17632/6w9ygpygmc.1 Licensing provisions: GPLv3 programming language: Fortran 2003 (tested with gfortran 6.1.0, Intel Fortran 16.0.3, Cray Compiler 8.5.3) Journal reference of previous version: Computer Physics Communications, 196 (2015) 506 Does the new version supersede the previous version?: Yes Reasons for the new version: This version makes mostly minor additions to functionality and includes some simplifying name changes. Summary of revisions: Several additions to functionality are minor. Two new singleton objects are KIND_SMALL and KIND_TINY, for smaller sized numbers than those specified by the previously available KIND_DEFAULT. The class MeasuredValueForm can now handle some more complicated cases of unit string processing. The numerical values in the CONSTANT singleton have been updated to 2016 values [3], and CONSTANT and UNIT contain a few additional members. A new class TimerForm can be used to track the wall time occupied by various segments of code. The PROGRAM_HEADER singleton now contains an array member of this new class. With calls like [Figure presented] the user can initialize their own timers;on return iMyTimer contains the index of the newly initialized timer

关键词： object oriented programming

AutoFrame: Automatic Frame Inference for object-oriented Languages

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Rivera, Victor Meyer, Bertrand Australian National University Innopolis University Innopolis University Innopolis Russia Schaffhausen Institute of Technology Politecnico di Milano

Automatic program verification has made tremendous strides, but is not yet for the masses. How do we make it less painful? This ar-ticle addresses one of the obstacles: The need to specify explicit \frame clauses", expressing what properties are left unchanged by an operation. It is fair enough to ask the would-be (human) prover to state what each operation changes, and how, but the (mechanical) prover also requires knowledge of what it does not change. The process of specifying and ver-ifying these properties is tedious and error-prone, and must be repeated whenever the software evolves. It is also hard to justify, since all the information about what the code changes is in the code itself. The AutoFrame tool presented here performs this analysis entirely auto-matically. It applies to object-oriented programming, where the issue is compounded by aliasing: if x is aliased to y, any update to x.a also affects y.a, even though the updating instruction usually does not even men-tion y. This aspect turns out to be the most delicate, and is addressed in AutoFrame by taking advantage of a companion tool, AutoAlias, which performs sound and sufficiently precise alias analysis, also in an entirely automatic way. Some practical results of AutoFrame so far are: (1) the automatic re-construction (in about 25 seconds on an ordinary laptop) of the exact frame clauses, a total of 169 clauses, for an 8,000-line data structures and algorithms library which was previously (with the manually written frame clauses) verified for functional correctness using a mechanical pro-gram prover;and (2) the automatic generation (in less than 4 minutes) of frame conditions for a 150,000-line graphical and GUI library. The source code of AutoFrame and these examples are available for download. Copyright © 2018, The Authors. All rights reserved.

关键词： object oriented programming

The Problems of programming Teaching

学校读者我要写书评

暂无评论

The Problems of Programming Teaching

International Conference on Information Technologies in Engineering Education (Inforino)

作者： N.V. Chibizova Applied Mathematics Department Moscow Power Engineering Institute Moscow Russia

The article deals with the problems that arise at the programming teaching of first-year students, and possible approaches to their solution. The choice of the programming language used in the first year andthe set of... 详细信息

ISBN: (纸本)9781538658338

关键词： programming profession Task analysis Education Computer languages Software object oriented programming

AutoAlias: Automatic Variable-Precision Alias Analysis for object-oriented Programs

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Rivera, Victor Meyer, Bertrand Innopolis University Innopolis Russia Politecnico di Milano Milan Italy

The aliasing question (can two reference expressions point, during an execution, to the same object?) is both one of the most crit-ical in practice, for applications ranging from compiler optimization to programmer verification, and one of the most heavily researched, with many hundreds of publications over several decades. One might then expect that good off-The-shelf solutions are widely available, ready to be plugged into a compiler or verifier. This is not the case. In practice, efficient and precise alias analysis remains an open problem. We present a practical tool, AutoAlias, which can be used to perform au-tomatic alias analysis for object-oriented programs. Based on the theory of \duality semantics", an application of Abstract Interpretation ideas, it is directed at object-oriented languages and has been implemented for Eiffel as an addition to the EiffelStudio environment. It offers variable-precision analysis, controllable through the choice of a constant that governs the number of fixpoint iterations: A higher number means better precision and higher computation time. All the source code of AutoAlias, as well as detailed results of analyses reported in this article, are publicly available. Practical applications so far have covered a library of data structures and algorithms and a li-brary for GUI creation. For the former, AutoAlias achieves a precision appropriate for practical purposes and execution times in the order of 25 seconds for about 8000 lines of intricate code. For the GUI library, AutoAlias produces the alias analysis in around 232 seconds for about 150000 lines of intricate code. Copyright © 2018, The Authors. All rights reserved.

关键词： object oriented programming

Java Subtyping as an Infinite Self-Similar Partial Graph Product

学校读者我要写书评

暂无评论

arXiv 2018年

作者： AbdelGawad, Moez A. Informatics Research Institute SRTA-City Alexandria Egypt

Due to supporting variance annotations, such as wildcard types, the structure of the subtyping relation in Java and other generic nominally-typed OO programming languages is both interesting and intricate. In these languages, the subtyping relation between ground object types, i.e., ones with no type variables, is the basis for defining the full OO subtyping relation, i.e., that includes type variables. As an ordering relation over the set of types, the subtyping relation in object-oriented programming languages can always be represented as a directed graph. In order to better understand some of the subtleties of the subtyping relation in Java, in this paper we present how the subtyping relation between ground Java types can be precisely constructed using two new operations (a binary operation and a unary one) on directed graphs. The binary operation we use, called a partial Cartesian graph product, is similar in its essence to standard graph products and group products. Its definition is based in particular on that of the standard Cartesian graph product. We believe the use of graph operations in constructing the ground generic Java subtyping relation reveals some of the not-immediately-obvious structure of the subtyping relation not only in Java but, more generally, also in mainstream generic nominally-typed OO programming languages such as C#, Scala and Kotlin. Accordingly, we believe that describing precisely how graph operations can be used to explicitly construct the subtyping relation in these languages, as we do in this paper, may significantly improve our understanding of features of the type systems of these languages such as wildcard types and variance annotations, and of the dependency of these features on nominal subtyping in nominally-typed OOP. Copyright © 2018, The Authors. All rights reserved.

关键词： object oriented programming

What should you know before developing a service identification approach

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Shatnawi, Anas Mili, Hafedh Abdellatif, Manel Boussaidi, Ghizlane El Guéhéneuc, Yann-Gaël Moha, Naouel Privat, Jean LATECE Technical LATECE Laboratoire Université du Québec à Montréal Canada

In this paper, we answer a set of research questions that are required to develop service identification approach based on the analysis of object-oriented software. Such research questions are: (1) what is a service, (2) how are services different from software components, (3) what are types of services, (4) what are existing service identification approaches that consider service types into account, and (5) how to identify services based on the object-oriented source code with respect to their types. Our methodology is based on performing a literature review to identify the answers of these research questions. Also, we propose a taxonomy of service types. Copyright © 2018, The Authors. All rights reserved.

关键词： object oriented programming