Compiler Theory Research Articles

Modernization of Shibhul Iddah for Men Perspective Compilation of Islamic Law

Iddah is the mass or waiting time for an ex-wife who has been divorced by her ex-husband. Mass iddah applies to women who have been divorced or because her husband died at which time the ex-wife has not been allowed to remarry with another man. Masa Iddah here is meant as a form of respect, mourning, and tolerance to the deceased and family. Honouring someone who has contributed to his life is a good thing and is encouraged in Islam. In this ever-evolving age, the author sees how the implementation of ’iddah is also directed at men. Then it would be more beautiful if the law applied to both. This study will examine how the regulations on the mass of iddah for men that have been listed in the compilation of Islamic law are then connected to the point of view of Islamic jurisprudence. How the role of fiqh law delivers these regulations so that these regulations are considered applicable in Indonesia. The analysis method used is in the form of descriptive analysis by explaining what is meant by the theory of ’iddah, the compilation of Islamic law and Islamic jurisprudence. Furthermore, from this presentation, an analysis of the postulates that explain ’iddah is carried out. The analysis in question is to analyze the verse about ’iddah to be made into law and applied to men using the theory of compilation of Islamic law.
 Keywords: Shibhul ’Iddah male, compilation of Islamic law, interpretation

Patch It If You Can: Increasing the Efficiency of Patch Generation Using Context

Although program repair is a tremendous aspect of a software system, it can be extremely challenging. An Automated Program Repair (APR) technique has been proposed to solve this problem. Among them, template-based APR shows good performance. One of the key properties of the template-based APR technique for practical use is its efficiency. However, because the existing techniques mainly focus on performance improvement, they do not sufficiently consider the efficiency. In this study, we propose EffiGenC, which efficiently explores the patch ingredient search space to improve the overall efficiency of the template-based APR. EffiGenC defines the context using the concept of extended reaching definition from compiler theory. EffiGenC constructs the search space by collecting the ingredient required for patching in the context. We evaluated EffiGenC on the Defects4j benchmark. EffiGenC decreases the number of candidate patches from 27% to 86% compared to existing techniques. EffiGenC also correctly/plausibly fixes 47/72 bugs. For Future work, we will solve the search space problem that exists in multiline bugs using context.

Tinjauan Hukum Ekonomi Syariah Terhadap Praktik Jual Beli Dengan Fluktuasi Harga pada Sistem Pembayaran DP di Kopontren Al Mubarok Desa Pringgondani Kec. Sumberjambe

This study aims to explain the views of Islamic economic law on the practice of buying and selling with price fluctuations in the DP payment system at Kopontre Al Mubarok, Pringgondani Village, Kec. Sumberjambe. This study uses a qualitative approach. This type of research is in the form of field research. The location of this research is in the Al Mubarok Kopontren, Pringgondani Village, Kec. Sumberjambe. Determination of informants using purposive. Data collection techniques use observation, structured interviews and documentation. The data analysis uses data condensation, data presentation and conclusions. While the validity of the data using source triangulation techniques and technical triangulation. The results showed that the practice of buying and selling with fluctuations in consumer prices first made transactions between the kopontren managers and consumers for the goods being traded and the payment was using DP. In terms of sharia economic law, the practice of buying and selling with price fluctuations in the DP payment system at Al Mubarok Kopontren Pringgondani Village is permissible (legal), because according to the theory of compilation of sharia economic law (KHES) the pillars and conditions in articles 56-57 are fulfilled.

Partitioning Behavioral Retrieval: An Efficient Computational Approach With Transitive Rules

The number of process models in process repositories has grown in recent years. For this reason, it is becoming increasingly important to efficiently retrieve process models from the repositories for management purposes. In fact, the method of retrieval is also essential to increase the potential of additional analysis such as similarity and behavioral analysis and compliance checking. Most retrieval methods can be classified as structural or behavioral retrieval. Behavioral retrieval considers the relationships between activities during process execution. In this paper, we introduce such a new behavior-based retrieval method called Partitioning Behavioral Retrieval . It is the first retrieval method that allows process models to contain inclusive (OR) gateways. The method is based on the dominance relation and a node-based process structure tree known from compiler theory. Although it uses instance subgraph checking as a computational basis, it derives new behavioral relations by using transitive rules. Currently, the method is limited to acyclic process models for ease of introduction. Experiments show the time advantage offered by our new method.

Theory and Practice of Water Resources Balance Sheet Compilation in the Yangtze River Basin

Tang, Y.; Wang, Y.; Yang, Q.; Hwang, E., and He, Q., 2020. Theory and practice of water resources balance sheet compilation in the Yangtze River Basin. In: Hu, C. and Cai, M. (eds.), Geo-informatics and Oceanography. Journal of Coastal Research, Special Issue No. 105, pp. 71–75. Coconut Creek (Florida), ISSN 0749-0208.Drawing on the preparation method for a natural resources balance sheet, combined with the characteristics of water resources, this paper calculates the physical quantity and value of water resources. Considering the influence of natural factors such as water quantity and water quality and social factors such as human factors and policies, the monetization and marketization of the use of water resources will help in the establishment of a water rights system and the promotion of a paid-use system. This paper focuses on the analysis of the preparation method and preparation procedure of a water resources balance sheet and adopts the case analysis method. Taking the Yangtze River Basin as the research object, it fully demonstrates the preparation process for a water resources balance sheet.

CONTENT STRUCTURE DESIGN OF NEW CENTURY EDITION OF THE NATIONAL FUNDAMENTAL GEOGRAPHIC ATLAS OF CHINA

Abstract. The research and compilation of new century version of the National Huge Atlas of the People's Republic of China is the special basic work project by Ministry of Science and Technology of the People's Republic of China from June 2013 to May 2018. The National Fundamental Geographic Atlas is one of the important achievements, which represents the spatial distribution of basic geographic elements such as water system, landform, residential area, transportation, boundary, soil and vegetation in detail by relative balance. In order to meet the requirements of the construction of ecological civilization and the development of new urbanization, the set of surface coverage maps and the set of urban maps are added, and the new structure model of the National Fundamental Geographic Atlas is constructed. The Atlas is in 4-forma size, it is made up of five parts: group of sequence maps, group of topography and terrain maps, group of surface coverage maps, group of city maps and index of place names. This paper mainly discusses and studies the theory of compilation and research and content planning, the principle of topic selection and taking account of factors, structure design and map arrangement of Atlas.

Tina, an Interpreter for Interpreting Compilation Theory

The traditional C, C ++, Java compiler system are large and integrate a large number of libraries and frameworks, allowing developers to use conveniently, are not conducive to understand the compiler theory and technology. In this paper, aiming at the above problems, we research a simple structure of code compiler technology, developed a simple compiler system with common sense, making the reader better learn compiler theory and technology and increasing the interest of this course. Firstly, the main features and applications what Tina interpreter were discussed, and the analysis and discussion of the implementation process. The actual situation in the field of researching, proposed Tina compiler which is the design method of this solution. Secondly, from code structure and format of Tina, it analyzes the common lexical, grammatical problems. Research on the compiler technology, control structures and procedures, parsing judgment for detailed analysis. Compilation process is divided into lexical analysis, syntax analysis and code generation three processing stages,which let the Windows system as the development platform and let C language as development tools and use recursive technique and the data structure of lists and queue and stacks implementing the three modules of the specific design.

Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation

We revisit an algorithm [called Edge Pushing (EP)] for computing Hessians using Automatic Differentiation (AD) recently proposed by Gower and Mello (Optim Methods Softw 27(2): 233–249, 2012). Here we give a new, simpler derivation for the EP algorithm based on the notion of live variables from data-flow analysis in compiler theory and redesign the algorithm with close attention to general applicability and performance. We call this algorithm Livarh and develop an extension of Livarh that incorporates preaccumulation to further reduce execution time—the resulting algorithm is called Livarhacc. We engineer robust implementations for both algorithms Livarh and Livarhacc within ADOL-C, a widely-used operator overloading based AD software tool. Rigorous complexity analyses for the algorithms are provided, and the performance of the algorithms is evaluated using a mesh optimization application and several kinds of synthetic functions as testbeds. The results show that the new algorithms outperform state-of-the-art sparse methods (based on sparsity pattern detection, coloring, compressed matrix evaluation, and recovery) in some cases by orders of magnitude. We have made our implementation available online as open-source software and it will be included in a future release of ADOL-C.

Converting unstructured into semi-structured process models

Business process models capture process requirements that are typically expressed in unstructured, directed graphs that specify parallelism. However, modeling guidelines or requirements from execution engines may require that process models are structured in blocks. The goal of this paper is to define an automated method to convert an unstructured process model containing parallelism into an equivalent semi-structured process model, which contains blocks and synchronization links between parallel branches. We define the method by means of an algorithm that is based on dominators, a well-known technique from compiler theory for structuring sequential flow graphs. The method runs in polynomial time. We implemented and evaluated the algorithm extensively. In addition we compared the method in detail with the BPStruct method from literature. The comparison shows that our method can handle cases that BPStruct is not able to and that the method coincides with BPStruct for the cases that BPStruct is able to handle.

Exploring the benefits and boundaries of transactive memory systems in adapting to team member loss.

This study examines how teams respond to unplanned member loss. We draw on theory of team compilation and adaptation to suggest that teams with well-developed transactive memory systems (TMS) will be better equipped to withstand the loss of a member. Then, based on role criticality theories, we argue that those effects depend on which member is absent, such that when a more critical member is lost, the performance benefits of a TMS are reduced. Finally, we reason that this interactive effect is because of the team’s ability to engage in plan formulation. We tested and found support for our hypotheses using 78 four-member teams engaged in a command-andcontrol simulation. TMS positively affected team performance following the loss of a member, but the benefits of the TMS were reduced following the loss of a critical member because teams had more difficulty engaging in plan formulation. We discuss how the results of this study add to our understanding of the precursors of successful team adaptation.

ALGORITHM FOR THE ANALYSIS OF EXACTICTY OF BANERJEE TEST

In compiler theory, the Banerjee test is a dependence test. The Banerjee test assumes that all loop indices are independent, however in reality, this is often not true. The Bannerjee test is a conservative test. That is, it will not break a dependence that does not exist.This means that the only thing the test can guarantee is the absence of dependence.This paper proposes an innovative algorithm which allows precise determination of information about dependences and can act in situation where certain cycling limits are known.

Special issue: second international workshop on workflow management in service and cloud computing (WMSC2010)

Special issue: second international workshop on workflow management in service and cloud computing (WMSC2010)

Reviving the Past: al-Shartūnī's Kitāb Matāli' and the Theory of Compilation in the Nahdah

AbstractThe Arab Renaissance (nahdah) in the late nineteenth and early twentieth centuries represents one of the most crucial periods in the development of Arabic literature and culture. This period witnessed a significant revival by nineteenth-century Arab poets and critics of their own literary and cultural heritage in the wake of Western influence. This article examines Sa'īd al-Shartūnī's thesis on poetry, which is part of his larger manual on style and eloquence, Kitāb Matāli'. Studying al-Shartūnī's ideas and approach within his immediate nineteenth-century context reveals him as a compiler who synthesises for a new generation of students the tradition of Arabic criticism as found in the great classics of the medieval period. In so doing, this article exposes broader literary structures underlying writing, reading and interpretation in the nahdah.

Language engineering in the context of a popular, inexpensive robot platform

Language engineering - the theory and practice of building language processors and compilers, has long been recognized as important subject in Computer Science curricula. However, due to lack of suitable target systems, educators face significant challenges to teach language engineering classes effectively. Leveraging the emerging inexpensive robot devices, this paper presents a new approach of using robots as system context to teach language engineering topics. We designed the Chirp-Scribbler Language, which targets the popular Scribbler robot; combined together, they provide an engaging and feature-rich platform to teach a wide range of topics in language engineering. This paper describes the Chirp-Scribbler Language, its integration with the target robot, and the teaching practice of using them to teach language translation basics in an undergraduate programming course.

A domain-specific compiler theory based framework for automated reaction network generation

Catalytic chemical reaction networks are often very complicated because of the numerous species and reactions involved. Hence, automating the network generation process is necessary as it is quite labor intensive and error prone to write down all the reactions manually. We present an automated integrated framework for reaction network generation based on domain-specific compiler theory using a knowledge base of chemistry rules. The chemistry rules represent basic reaction mechanisms that the reactants can undergo. The system's domain-specific compiler takes the rules and initial reactants as inputs, parses the rule text, generates the intermediate representation, and finally produces the reaction network by interpreting the intermediate representation. We chose the Abstract Syntax Tree (AST) as the intermediate representation because of its transparency and ease of search. The system executes the AST using the initial reactants, and generates the reaction network. The Reaction Description Language (RDL) has been extended to describe the chemistry rules for catalytic systems, and the molecules are represented by Simplified Molecular Input Line Entry System (SMILES). This framework separates the molecules and the behavior of catalysts, represented by the chemistry rules. This approach accelerates the speed of generating hypotheses for building the kinetic models for catalytic systems.

On the origins of the Shang-shu : A theory of parallel compilation during the warring states period

On the origins of the Shang-shu : A theory of parallel compilation during the warring states period

Declarative techniques for model-driven business process integration

Business process integration and automation are among the most significant factors driving the information technology industry today. In addressing the manifold technology challenges of integration and automation, new standardization efforts aim at improving the interoperability of businesses by moving toward a declarative specification of business processes, that is, one which describes what a business process does and not how it is implemented. At the same time, Model Driven Architecture® focuses on improving the software-engineering methods with which business process solutions are implemented by separating the business or application logic from the underlying platform technology and representing this logic with precise semantic models. In this paper, we present an approach to the model-driven generation of programs in the Business Process Execution Language for Web Services (BPEL4WS), which transforms a graphically represented control-flow model into executable code by using techniques that originated in compiler theory. We discuss the underlying algorithms as well as general questions concerning the representation and analysis of model transformations. We study a declarative representation of transformation rules, where preconditions and postconditions are represented in the Object Constraint Language. By adopting a declarative approach, we pave the way for future automatic consistency checking of transformation rules and bidirectional reconciliation of evolving models.

CCL: A Subject Language for Compiler Projects

This paper presents CCL, a programming language designed for implementation efforts and laboratory projects in compilers courses for undergraduates. CCL is small, cohesive, and regular enough that a working compiler can be implemented by an individual student in a single semester; yet, CCL includes a collection of features (including pointers, dynamically-sized arrays, anonymous functions, and a restricted form of continuations) that make it a useful vehicle for studying compiler theory and design. Experiences using CCL in compilers courses are discussed, and suggestions for a number of projects concerning CCL are given.

Strategic directions in software engineering and programming languages

The computer revolution is based on the ability of a general-purpose machine to carry out a specific task under the control of special-purpose software. While the wide applicability of stock hardware has driven demand up and manufacturing cost per unit dramatically down, the same trends have led to increasing demand for ever more complex software for an astounding variety of uses: computer-aided education, improved business processes, what-if financial planning and analysis, new forms of entertainment, fly-by-wire avionics systems, and innumerable others both known and as yet unknown. Producing quality software systems at reasonable cost is an increasingly serious challenge due to ever-growing economic and societal demands. Moreover, software that cannot be modified, updated, or extended becomes useless, due to changes in its technological, social, and economic context. Successful evolution of software systems is a severe technical and managerial challenge that is only exacerbated by the everbroadening kinds of software that must be produced and changed. The techniques and tools that will be needed for efficient and accurate system development, in the face of increasing system complexity and declining life cycles, require deep, new, and exciting scientific and engineering research. The challenges are staggeringly hard, demanding the best efforts of both the programming language and the software engineering research communities. Specifically, we must use impressive advances in programming languages, compiler technology, and software engineering, balancing the beauty of programming language and compiler theory with the messy, ugly, often not entirely technical problems that arise in building and evolving real software. The synergy between software engineering and programming languages and compilers is not merely desirable—it is essential. With hard work, open minds, and appropriate resources, these two communities can apply existing results to make significant progress in bringing science and engineering together to address the challenges of building and evolving diverse software systems. To clarify the potential for synergy between the communities, consider two examples.

Instruction and practice in learning to use a device

We explore the extent to which Anderson's (1987) theory of knowledge compilation can account for the relationship between instructions and practice in learning to use a simple device. Bibby and Payne (1993) reported experimental support for knowledge compilation in this domain. This article replicates the finding of a performance cross-over between instruction type and task type that disappears with practice on the tasks. The research is extended by using verbal protocols to model the strategies of novice and more experienced individuals. Production system models of these strategies suggest that knowledge compilation only provides an adequate account of practice for one of two Instruction groups. To model the strategy shifts for the second group, we employ a “procedure modification heuristic” (after Neches, 1987), which relies on access to a declarative model of the configuration of the device. This suggests that instructionally derived declarative knowledge may have a subtle ongoing effect on the changes in procedural knowledge with practice.