scholarly journals A Language for the Description of Program Instrumentation and Automatic Generation of Instrumenters

2018 ◽  
Vol 6 (1) ◽  
Author(s):  
Adenilso S. Simao ◽  
Auri M. R. Vincenzi ◽  
Antonio C. L. Santana ◽  
Jose C. Maldonado
Keyword(s):  
Automatic Generation ◽  
Product Structure ◽  
C Language ◽  
Program Instrumentation ◽  
Language L ◽  
Transformational Programming ◽  
Software Product ◽  
Target Languages ◽  
Context Free ◽  
Testing Criteria

Instrumentation is a technique frequently used in software engineering for several different purposes, e.g. program and/or specification execution trace, testing criteria coverage analy- sis, and reverse engineering. Instrumenting a software product can be divided into two main tasks: (i) deriving the software product structure and (ii) inserting statements for collecting runtime/simulation information. Most instrumentation approaches are specific to a given domain or language. Thus, it is very difficult to reuse the effort expended in developing an instrumenter, even if the target languages are quite similar. To tackle this problem, in this paper, we propose an instrumentation-oriented meta-language, named IDeL, designed to support the description of both main tasks of instru- mentation process, namely: (i) the product structure derivation and (ii) the insertion of the instrumentation statements. In order to apply IDeL to a specific language L, it should be in- stantiated with a context-free grammar of L. To promote IDeL’s practical use, we also developed a supporting tool, named idelgen, that can be thought of as an application generator, based on the transformational programming paradigm and tailored to the instrumentation process. We illustrate the main concepts of our proposal with examples describing the instrumentation required in some traditional data flow testing criteria for C language.

scholarly journals REPRESENTATIONS AND CHARACTERIZATIONS OF LANGUAGES IN CHOMSKY HIERARCHY BY MEANS OF INSERTION-DELETION SYSTEMS

2008 ◽  
Vol 19 (04) ◽  
pp. 859-871 ◽  
Author(s):  
GHEORGHE PĂUN ◽  
MARIO J. PÉREZ-JIMÉNEZ ◽  
TAKASHI YOKOMORI
Keyword(s):  
Dna Computing ◽  
Research Direction ◽  
Regular Languages ◽  
Turing Computability ◽  
Chomsky Hierarchy ◽  
Recursively Enumerable ◽  
Enumerable Language ◽  
Language L ◽  
Context Free

Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability and characterizations or representations of languages in Chomsky hierarchy were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Schützenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩ D), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages – this time using insertion systems of weight (3, 0) and star languages.

scholarly journals Software Product Line Analysis Using Variability-aware Datalog

2021 ◽  
Author(s):  
Ramy Shahin ◽  
Murad Akhundov ◽  
marsha chechik
Keyword(s):  
Research Problem ◽  
Product Line ◽  
Product Lines ◽  
C Language ◽  
Lifted Inference ◽  
Software Analysis ◽  
Software Product ◽  
Database Size ◽  
Fundamental Research ◽  
Line Engineering

Applying program analyses to Software Product Lines (SPLs) has been a fundamental research problem at the intersection<br>of Product Line Engineering and software analysis. Different attempts have been made to "lift" particular product-level analyses to run on the entire product line. In this paper, we tackle the class of Datalog-based analyses (e.g., pointer and taint analyses), study the theoretical aspects of lifting Datalog inference, and implement a lifted inference algorithm inside the Souffl  Datalog engine. We evaluate our implementation on a set of Java and C-language benchmark product lines. We show significant savings in processing time and fact database size (billions of times faster on one of the benchmarks) compared to brute-force analysis of each product individually.

scholarly journals Software Product Line Analysis Using Variability-aware Datalog

2021 ◽  
Author(s):  
Ramy Shahin ◽  
Murad Akhundov ◽  
marsha chechik
Keyword(s):  
Research Problem ◽  
Product Line ◽  
Product Lines ◽  
C Language ◽  
Lifted Inference ◽  
Software Analysis ◽  
Software Product ◽  
Database Size ◽  
Fundamental Research ◽  
Line Engineering

Applying program analyses to Software Product Lines (SPLs) has been a fundamental research problem at the intersection<br>of Product Line Engineering and software analysis. Different attempts have been made to "lift" particular product-level analyses to run on the entire product line. In this paper, we tackle the class of Datalog-based analyses (e.g., pointer and taint analyses), study the theoretical aspects of lifting Datalog inference, and implement a lifted inference algorithm inside the Souffl  Datalog engine. We evaluate our implementation on a set of Java and C-language benchmark product lines. We show significant savings in processing time and fact database size (billions of times faster on one of the benchmarks) compared to brute-force analysis of each product individually.

scholarly journals Calculation of fractional integrals using partial sums of Fourier series for structural mechanics problems

2021 ◽  
Vol 274 ◽  
pp. 03011
Author(s):  
Anis Galimyanov ◽  
Tatyana Gorskaya
Keyword(s):  
Quadrature Formula ◽  
Environmental Changes ◽  
Continuous Functions ◽  
Fractional Integrals ◽  
Partial Sums ◽  
Generalized Derivatives ◽  
C Language ◽  
Spaces Of Continuous Functions ◽  
Software Product ◽  
Properties Of Materials

The goal of this study is to develop and apply an approximate method for calculating integrals that are part of models using Riemann-Liouville integrals, and to create a software product that allows such calculations for given functions. The main results of the study consist in the construction of a quadrature formula for an integral, and the cases where the density of the integral is a function from the spaces of continuous functions with generalized derivatives with weight and the Helder classes of functions with weight were considered. For the proposed quadrature formula we further investigated the error of its approximation in the spaces of continuous functions and quadratic-summing functions with weight. As a result of the study, effective error estimates of the approximating apparatus in the proposed classes of functions have been established. In addition, the approximated method has been implemented on the computer in the form of a program in the C language. The significance of the obtained results for the construction industry consists in the fact that when solving problems, including problems on finding the shapes of structures, taking into account the properties of materials, environmental changes, in the models of which the Riemann-Liouville integrals are used, it will be possible to apply an approximate approach, the quadrature formula proposed in the article.

Code Automation Technology Based COSINE Software Development

2013 ◽  
Author(s):  
Hao Ren ◽  
Wentao Mo ◽  
Shuo Liu ◽  
Dong Li ◽  
Yang Sun ◽  
...  
Keyword(s):  
Software Development ◽  
Nuclear Power ◽  
Source Code ◽  
Data Access ◽  
Automatic Generation ◽  
Code Generator ◽  
C Language ◽  
Fortran Code ◽  
Development Feature ◽  
Automation Technology

Source code automatic generation technology can improve software development’s quality and productivity significantly. However, the existing code generators cannot satisfy nuclear power software development demand. This paper analyzes development feature of scientific computing software and develops a FORTRAN Code Generator (FCG) using C# language. FCG can generate program variables definition FORTRAN source code automatically according to input metadata. FCG also can generate memory allocation source code for dynamic variables in program. Besides, FCG can generate data access interface for global variables in code. Right now, FCG has been applied to source code development of COSINE (Core and System Integrated Engine for design and analysis) software package. Development practice has proved that FCG can improve development efficiency of nuclear power software greatly.

scholarly journals Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups

2016 ◽  
Vol 99 (113) ◽  
pp. 177-191
Author(s):  
Mohammed Ayyash ◽  
Emanuele Rodaro
Keyword(s):  
Inverse Semigroup ◽  
Word Problem ◽  
Polynomial Time ◽  
Inverse Semigroups ◽  
Free Graph ◽  
Hnn Extensions ◽  
Language L ◽  
Hnn Extension ◽  
Context Free ◽  
Standard Presentation

We prove that the Sch?tzenberger graph of any element of the HNN-extension of a finite inverse semigroup S with respect to its standard presentation is a context-free graph in the sense of [11], showing that the language L recognized by this automaton is context-free. Finally we explicitly construct the grammar generating L, and from this fact we show that the word problem for an HNN-extension of a finite inverse semigroup S is decidable and lies in the complexity class of polynomial time problems.

scholarly journals RESEARCH ON MODELING AND OPTIMIZATION PROGRAM OF LONG-SPAN HYBRID GRID HANGAR BASED ON LEVERAGE PRINCIPLE

2021 ◽  
Vol 30 (1) ◽  
Author(s):  
Wenbo Zhang ◽  
Deyou Wang ◽  
Guangshun Shi
Keyword(s):  
Optimization Design ◽  
Design Method ◽  
Vertical Displacement ◽  
Automatic Generation ◽  
Structure Design ◽  
Particle Swarm Algorithm ◽  
Grid Structure ◽  
C Language ◽  
Long Span ◽  
Hybrid Grid

A long-span hybrid grid hangar structure and a modeling method for the long-span hybrid grid hangar structure based on the principle of leverage are proposed in this paper. Based on the SAP2000 spatial structure design software, the C# language was used to develop a plug-in to automatically create a long-span hybrid grid structure based on the principle of leverage, which realized the automatic generation by inputting parameters such as the span of the hangar structure, the number of horizontal grids, and the number of vertical grids. The optimization design method of the long-span hybrid grid structure based on particle swarm algorithm is proposed. SAP2000 software is used and the C# language is used to develop the optimization design program of the long-span hybrid grid structure based on the principle of leverage. The optimization design is carried out, and the optimization results show that the program can reduce the thickness of the roof and reduce the vertical displacement at the opening of the hangar roof on the basis of meeting the current specifications.

MORPHIC CHARACTERIZATIONS OF LANGUAGE FAMILIES IN TERMS OF INSERTION SYSTEMS AND STAR LANGUAGES

2011 ◽  
Vol 22 (01) ◽  
pp. 247-260 ◽  
Author(s):  
FUMIYA OKUBO ◽  
TAKASHI YOKOMORI
Keyword(s):  
Unique Feature ◽  
Recursively Enumerable ◽  
Context Free Language ◽  
Similar Characterization ◽  
Language L ◽  
Finite Set ◽  
Context Free ◽  
String Rewriting ◽  
Free Language ◽  
Recursively Enumerable Languages

Insertion systems have a unique feature in that only string insertions are allowed, which is in marked contrast to a variety of the conventional computing devices based on string rewriting. This paper will mainly focus on those systems whose insertion operations are performed in a context-free fashion, called context-free insertion systems, and obtain several characterizations of language families with the help of other primitive languages (like star languages) as well as simple operations (like projections, weak-codings). For each k ≥ 1, a language L is a k-star language if L = F+ for some finite set F with the length of each string in F is no more than k. The results of this kind have already been presented in [10] by Păun et al., while the purpose of this paper is to prove enhanced versions of them. Specifically, we show that each context-free language L can be represented in the form L = h(L(γ)∩F+), where γ is an insertion system of weight (3, 0) (at most three symbols are inserted in a context-free manner), h is a projection, and F+ is a 2-star language. A similar characterization can be obtained for recursively enumerable languages, where insertion systems of weight (3, 3) and 2-star languages are involved.

A Mesh Feature Paradigm for Rapid Generation of CAE-Based Design of Experiments Data

2002 ◽  
Author(s):  
Yifan Chen ◽  
Paul Stewart ◽  
Anne Marsan ◽  
Huaicai Mo ◽  
Basavaraj Tonshal
Keyword(s):  
Design Of Experiments ◽  
Large Scale ◽  
Automatic Generation ◽  
Mesh Deformation ◽  
Maximum Time ◽  
Modeling Paradigm ◽  
Time Savings ◽  
Rapid Generation ◽  
Context Free ◽  
Base Design

CAE-Based simulation and Design of Experiments (DoE) are becoming mature and increasingly effective in development of complex industrial products such as automobiles. We present in this paper a CAE mesh-modeling paradigm that ultimately led to fast, automatic generation of a family of meshes based on a base design. This paradigm is hinged on the so-called mesh features to achieve productivity for modeling CAE meshes. Mesh features are self-contained mesh deformation operations that are context-free, stored separately from the base model, and can be applied to the model in a proper mix at any time. Libraries of mesh features can also be established to archive useful features for future use. Furthermore, by assigning mesh features for DoE factors, one can specify for the system the proper way to assemble features and apply them automatically to the base model to generate input meshes for a DoE study. Automatic generation of a family of DoE input meshes results in maximum time savings and minimum chances for errors, especially for applications involving large-scale CAE models.

Sign in / Sign up

Export Citation Format

Share Document