Kelemen, Erik · Brno University of Technology Digital Library (Brno University of Technology) · 2021
This thesis focuses on transformation model described by object oriented Petri net to sequence diagram, which allows reverse mapping to original description. As a solution is used discrete simulation of model described in PNtalk language. Result of work is fully automated generator, which generates sequence diagram according to gathered data from simulation. Generator aims for minimal loss of relevant information and presenting valid sequence diagram.
Cited by 0
Rene, Christophe, Priol, Thierry, Centre National de la Recherche Scientifique (CNRS), 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA) et al. · OpenGrey (Institut de l'Information Scientifique et Technique) · 1999
This paper describes a technique that allows a MPI code to be encapsulated into a component. Our goal is to provide a software infrastructure to build distributed simulation applications for computational grids [3]. Our technique is based on an extension to the Common Object Request Broker Architecture (CORBA) from the OMG (Object Management Group). The proposed extensions do not modified the CORBA core infrastructure (the Object Request Broker) so that it can fully co-exist with existing CORBA applications. A MPI code is seen as a new kind of CORBA object that hides most of the cumbersome problems when dealing with parallelism.
Cited by 0Open access
Manton, James · Figshare · 2014
Cited by 0Open access
B. Sc, Michael Joseph Zastre, Michael Joseph Zastre · 1995
ion by Michael Joseph Zastre B.Sc., Simon Fraser University, 1993 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE in the Department of Computer Science We accept this thesis as conforming to the required standard ________________________________________________________________ Dr. R. N. Horspool, Supervisor (Dept. of Computer Science) ________________________________________________________________ Dr. D. M. Hoffman (Dept. of Computer Science) ________________________________________________________________ Dr. G. C. Shoja (Dept. of Computer Science) ________________________________________________________________ Dr. R. Vahldieck (Dept. of Electrical and Computer Engineering) Ó Michael Joseph Zastre, 1995 University of Victoria All rights reserved. This thesis may not be reproduced in whole or in part, by photocopying or other means, without the permission of the author. ii Supervisor: Dr. R. N. Horspool Abstract Current compiler ...
Cited by 0
Jinlong Hu · 2007
This paper introduces the shape error concealment on video object code, then introduces some new typical shape error concealment algorithms and analyses the general features and applicability of these algorithms.And the conclusion is given out.
Cited by 0
Shah Mohammad Faizur Rahman, Zhe Wang, Daniel A. Jiménez · 2009
Modern microprocessors have many microarchitectural features. Quantifying the performance impact of one feature such as dynamic branch prediction can be difficult. On one hand, a timing simulator can predict the difference in performance given two different implementations of the technique, but simulators can be quite inaccurate. On the other hand, real systems are very accurate representations of themselves, but often cannot be modified to study the impact of a new technique.
Cited by 4
Giuliano Antoniol, Gerardo Canfora, G. Casazza et al. · 2002
Software system documentation is almost always expressed informally, in natural language and free text. Examples include requirement specifications, design documents, manual pages, system development journals, error logs and related maintenance reports. We propose an approach to establish and maintain traceability links between source code and free text documents. A premise of our work is that programmers use meaningful names for program items, such as functions, variables, types, classes, and methods. We believe that the application-domain knowledge that programmers process when writing the code is often captured by the mnemonics for identifiers; therefore, the analysis of these mnemonics can help to associate high level concepts with program concepts, and vice-versa. The approach is applied to software written in an object oriented language, namely Java, to trace classes to functional requirements.
Cited by 45
Giulio Antoniol A, Bruno Caprile B, Ra Potrich B et al. · 2014
Traceability is a key issue to ensure consistency among software artifacts of subsequent phases of the development cycle. However, few works have so far addressed the theme of tracing object oriented (OO) design into its implementation and evolving it. This paper presents an approach to checking the compliance of OO design with respect to source code and support its evolution. The process works on design artifacts expressed in the OMT (Object Modeling Technique) notation and accepts C++ source code. It recovers an “as is ” design from the code, compares the recovered design with the actual design and helps the user to deal with inconsistencies. The recovery process exploits the edit distance computation and the maximum match algorithm to determine traceability links between design and code. The output is a similarity measure associated to design-code class pairs, which can be classified as matched and unmatched by means of a maximum likelihood threshold. A graphic display of the design with different green levels associated to different levels of match and red for the unmatched classes is provided as a support to update the design and improve its traceability to the code. 1.
Cited by 0
Andreas Wierda, Eric Dortmans, Lou Somers · Communications in computer and information science · 2008
Cited by 10
Marco Benini, Dirk Nowotka, Sara Kalvala · IrInSubria (University of Insubria) · 1998
Formal verification of software typically consists in checking programs in a high-level language against an abstract specification. Confidence on the correctness of the actual program running on a machine also relies on the soundness of the translation from the high-level language to the machine code, i.e., the correctness of a compiler, including its code optimisation techniques.
If one wishes to have confidence on the final code, another approach is object code verification, i.e., verification of program code at assembly level. Now the confidence in the implementation of a program on an actual machine is more direct, relying on the correctness of the hardware model and no other software.
But, dealing with object code also has a price. It is, in a sense, further away from its specification because it has to deal with a more concrete machine, considering registers, limited memory, and so on. There is a vast shift in granularity between code and specification.
The technique for object code verification we are developing emphasises the use of abstraction, aided by a process algebraic framework. The concept of simulation provides the tool with which abstractions on the process algebraic representation of the program can be formalised.
However, the correctness proof takes place in higher-order logic (HOL), which we believe presents a more amenable proof environment. Abstraction at the logical level is obtained by unlifting results from the CCS level using the CCS semantics. More precisely, let < be a simulation relation, and let [[ ]]^s be the lifting operator for a particular sequence s of states, then
If P < Q then for all s . [[P]]^s implies [[Q]]^s .
The interaction between the logical and the algebraic level is fundamental for our methodology.
We have implemented this approach in a proof system we call Holly. We use Isabelle/HOL, in which we embedded a variation of Milner's Calculus of Communicating Systems (CCS) as a process algebra. When verifying a program, its object code is translated both into a representation in HOL and an equivalent representation in CCS. At any point in a proof either deductions in HOL or simulations in the process algebra can be used.
Holly demonstrates the concurrent use of a logical and an algebraic model to make object code verification feasible. In this talk, we expand on the interaction between these models, and highlight the interaction within an example proof in Holly.
Cited by 0
W. Peter · 1996
Abstract : Research performed in collaboration with George Mason University, the University of California at Berkeley, and Berkeley Research Associates in order to develop a freely-available, re-usable, object-oriented PIC code in C++. The code should have a state-of-the-art graphical user interface (GUI) and physics capabilities such as a fully relativistic and electromagnetic field solver, variable geometries (cylindrical, cartesian, etc.), a multi-conductor package, extensive diagnostics, etc. The code will have extensive documentation.
Cited by 0
Gu, Hongji, Shen, Dingtao,, Zhang, Chunxiao, et al. · Figshare · 2024
Extreme Rainfall Object Capture Code in Python.
Cited by 0Open access
Jauhar, Ali, 35758, ジョハル, アリ · Terrestrial Environment Research Center (University of Tsukuba) · 1998
Cited by 0Open access
Frlička, Eduard · Brno University of Technology Digital Library (Brno University of Technology) · 2023
PNtalk is a language used for modelling of object-oriented Petri nets. The existing simu- lator implemented in Smalltalk language is used mainly for modelling and debugging. For practical use, however, a more efficient representation of Petri net models is needed. This work presents a C++ representation of object-oriented Petri nets.
Cited by 0
2008
Software reuse, the use of existing software artefacts or knowledge to create new software, has two main purposes: to increase the reliability of software and to reduce the cost of software development. The SRI model for the definition of the structure of a reusable component and an object oriented method with reuse based on the model have been introduced in previous works. Our current goal is to map design artefacts to object oriented code. A rigorous method that bridges the gap between UML diagrams and Eiffel is described. The idea is to link UML diagrams with SRI components. This will enable the simulation and execution of correction tests in an independent implementation way and the subsequent transformation to efficient code.
Cited by 0
Gu, Hongji, Shen, Dingtao,, Zhang, Chunxiao, et al. · Figshare · 2024
Extreme Rainfall Object Capture Code in Python.
Cited by 0Open access
Robert Dyer, Harish Narayanappa, Hridesh Rajan · 2006
For a number of reasons, such as to generate object code that is compliant with the existing virtual machines (VM), current compilers for aspect-oriented languages sacrifice design modularity when transforming source to object code by losing textual locality and intermingling concerns in the object code. Sacrificing design modularity has significant costs, especially in terms of the speed of incremental compilation. We present an intermediate language design that preserves aspect-oriented design modularity in Java byte code. We briefly describe our extensions to the Sun Hotspot VM to support the new intermediate language design. 1.
Cited by 0
G. Antoniol, B. Caprile, A. Potrich et al. · 2007
Traceability is a key issue to ensure consistency among software artifacts of subsequent phases of the development cycle. However, few works have so far addressed the theme of tracing object oriented (OO) design into its implementation and evolving it. This paper presents an approach to checking the compliance of OO design with respect to source code and support its evolution. The process works on design artifacts expressed in the OMT (Object Modeling Technique) notation and accepts C++ source code. It recovers an \\as is&quot; design from the code, compares recovered design with the actual design and helps the user to deal with inconsistencies. The recovery process exploits the edit distance computation and the maximum match algorithm to determine traceability links between design and code. The output is a similarity measure associated to design-code class pairs, which can be classied as matched and unmatched by means of a maximum likelihood threshold. A graphic display of the design with dierent green levels associated to dierent levels of match and red for the unmatched classes, is provided as a support to update the design and improve its traceability to the code. ii DRAFT G. Antoniol, B. Caprile, A. Potrich and P. Tonella, Design-Code Traceability for OO Systems 1 1
Cited by 0
Radu Vanciu, Marwan Abi-antoun · 2013
Object graphs help developers understand the runtime structure of an object-oriented system, in terms of objects and their runtime relations (points-to, call, or dataflow, depending on the intent of the diagram). Ideally, an object graph is sound and shows all possible objects and the relations between them. The object graph should also be hierarchical to scale and convey architectural abstraction. Achieving soundnessrequiresastatic analysis, butarchitectural hierarchy is not available in code written in general-purpose programming languages. To achieve hierarchy in a statically extracted object graph, we leverage ownership types in the code. We then abstractly interpret the annotated program and extract a global, sound, hierarchical object graph with dataflow communication edges that show the flow of objects due to field reads, field writes, and method invocations. We formalize the static analysis using a constraint-based specification and prove that the object graph is sound. Keywords: hierarchical object graphs, dataflow communication, ownership domainsDocument History
Cited by 0
Fryč, Tomáš · Brno University of Technology Digital Library (Brno University of Technology) · 2019
Tato práce se zabývá modelováním systémů pomocí Objektově orientovaných Petriho sítí (OOPN) a navržením mechanismu, který tento formalismus transformuje do programovacího jazyka Java. V první části práce je popis Petriho sítí, rozšíření o objektovou orientaci a jazyka PNtalk, který je konkretní implementací OOPN. Další část se zabývá samotným mechanismem, který z modelu zapsaných v jazyku PNtalk vygeneruje ekvivalentní modely v Javě a popisuje způsob simulace takto vygenerovaných modelů. Generátor je koncipiován tak, aby byl snadno rozšiřitelný a vygenerované modely modifikovatelné.
Cited by 0