Log in

Relevant bibliographies by topics / Language Compiler languages PL / Journal articles

To see the other types of publications on this topic, follow the link: Language Compiler languages PL.

Journal articles on the topic 'Language Compiler languages PL'

Author: Grafiati

Published: 26 July 2024

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Language Compiler languages PL.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Bodik, Rastislav. "Small languages in an undergraduate PL/Compiler course." ACM SIGPLAN Notices 43, no. 11 (2008): 39–44. http://dx.doi.org/10.1145/1480828.1480836.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dzhidzhoyev, Vladislav Muratovich, Ruben Arturovich Buchatskiy, Michael Vyacheslavovich Pantilimonov, and Alexander Nikolaevich Tomilin. "Dynamic Compilation of User-Defined Functions in PL/pgSQL Language." Proceedings of the Institute for System Programming of the RAS 32, no. 5 (2020): 67–80. http://dx.doi.org/10.15514/ispras-2020-32(5)-5.

Full text

Abstract:

Many modern RDBMS provide procedural extensions for SQL programming language, which allow users to perform server-side complex computations. Use of such extensions improves modularity and code reuse, simplifies programming of application logic, and helps developers to avoid network overhead and enhance performance. Interpretation is mostly used to execute SQL queries and procedural extensions code, resulting in significant computational overhead because of indirect function calls and performing of generic checks. Moreover, most RDBMS use different engines for SQL queries execution and procedur

APA, Harvard, Vancouver, ISO, and other styles

3

Jain, Abhishek, Manohar Kumar, and Manohar Kumar. "System Programming Drawbacks." Journal of Advance Research in Computer Science & Engineering (ISSN: 2456-3552) 2, no. 4 (2015): 16–22. http://dx.doi.org/10.53555/nncse.v2i4.453.

Full text

Abstract:

A system programming language usually refers to a programming language used for system programming; such languages are designed for writing system software, which usually requires different development approaches when compared to application software. System software is computer software designed to operate and control the computer hardware, and to provide a platform for running application software. System software includes software categories such as operating systems, utility software, device drivers, compilers, and linkers. In contrast with application languages, system programming languag

APA, Harvard, Vancouver, ISO, and other styles

4

Piyush, Choudhary. "STUDY OF FRONT END AND BACK END MODEL OF COMPILER." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES [FRTSSDS-18] (June 13, 2018): 33–39. https://doi.org/10.5281/zenodo.1288409.

Full text

Abstract:

No two languages are alike, every language has their own unique style and methodology. If we talk about human languages there are wide no. of languages available in the world but technically computer understands only Machine Languages. Machine code is written in binary bits pattern (or hexadecimal pattern), which requires programmer exceptionally skilled with machine language.  Understanding the need of programmers, various tools are developed to convert one language into another language. One of the tools to transform one language into another is Compiler. This paper presents the study o

APA, Harvard, Vancouver, ISO, and other styles

5

Ritu, Sindhu, Gehlot Neha, and Malik Indu. "A New Compiler: Code Conversion at Assembly Level." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 2201–4. https://doi.org/10.35940/ijeat.C5172.029320.

Full text

Abstract:

Ever switched programming languages? If yes, you know how difficult it is to learn the syntax and get familiar with new language. But what if we write the code in our preferred language and it can run as any other language’s code. The thing is, whatever we write ultimately gets converted to 0’s and 1’s, the only difference is how these 0’s and 1’s is shown to our machine. We may need different languages, but what if the code with the syntax of one language, runs reasonably well as if it was written with syntax of some other language. This is where a compiler comes

APA, Harvard, Vancouver, ISO, and other styles

6

Chitra, A., and G. Sudha Sadasivam. "DESIGN AND IMPLEMENTATION OF A COMPONENTISED IDL COMPILER." Journal of Integrated Design and Process Science: Transactions of the SDPS, Official Journal of the Society for Design and Process Science 6, no. 3 (2002): 75–91. http://dx.doi.org/10.3233/jid-2002-6305.

Full text

Abstract:

An interface definition language (IDL) is a traditional language describing the interfaces between the components. IDL compilers generate stubs that provide communicating processes with the abstraction of local object invocation or procedure call. Typical IDL compilers are limited to a single IDL and target language, but the proposed IDL compiler is based on the insight that IDLs are true languages amenable to modern compilation techniques. Through the support of intermediate language representation called as Abstract Object Interface (AOI), our compiler can support multiple IDLs and target la

APA, Harvard, Vancouver, ISO, and other styles

7

Dhak, Bharat, Prachi Goje, Abhishek Raut, Ashwini Rane, and Avantika Tamsetwar. "Online Compiler with Whiteboard." International Journal for Research in Applied Science and Engineering Technology 11, no. 4 (2023): 2023–27. http://dx.doi.org/10.22214/ijraset.2023.50509.

Full text

Abstract:

Abstract: The Internet has proved to be a life-changing invention of our time. Not only it is itself an invention, but it has been the key player to major things that have been invented in the twentieth century. The internet has proven itself in re-inventing almost everything, with education being no exception to it. CodeBox is also an effort, via the internet, to educate the young minds on the how-tos of coding and developing the spirit of competitive coding. It takes a lot of time and practice to get good at coding, and CodeBox aims to assist the user in this journey. In other code editors t

APA, Harvard, Vancouver, ISO, and other styles

8

Navas-López, Eduardo Adam. "Modular and Didactic Compiler Design with Xml Inter-Phases Communication." International Journal of Computer Science, Engineering and Information Technology 12, no. 1 (2022): 1–20. http://dx.doi.org/10.5121/ijcseit.2022.12101.

Full text

Abstract:

In Compiler Design courses, students learn how a program written in high level programming language and designed for humans understanding is systematically converted into low level assembly language understood by machines, through different representations. This article presents the design, educative characteristics and possibilities of a modular and didactic compiler for a Pascal-like programming minilanguage that is super-set of Niklaus Wirth's PL/0. The main feature is that it implements the compiling phases in such a way that the information delivered to each next one may be reflected as a

APA, Harvard, Vancouver, ISO, and other styles

9

Wermuth, Maria-Cornelia. "Language localization in scientific drug information." Journal of Internationalization and Localization 3, no. 1 (2016): 74–94. http://dx.doi.org/10.1075/jial.3.1.05wer.

Full text

Abstract:

Although localization is, in the first place, related to the cultural adaptation and translation of software and websites, it is important for written materials as well. In this paper we investigate how specialized medical discourse used in the Summary of Product Characteristics (SmPC) is localized in patient leaflets (PL). Both documents are issued by the European Medicines Agency (EMA) and provide detailed information on the product compiled and distributed by the drug manufacturer, after EMA review and approval. We describe by means of a case study the formal and linguistic features of SmPC

APA, Harvard, Vancouver, ISO, and other styles

10

Binder, David, Marco Tzschentke, Marius Müller, and Klaus Ostermann. "Grokking the Sequent Calculus (Functional Pearl)." Proceedings of the ACM on Programming Languages 8, ICFP (2024): 395–425. http://dx.doi.org/10.1145/3674639.

Full text

Abstract:

The sequent calculus is a proof system which was designed as a more symmetric alternative to natural deduction. The 𝜆𝜇𝜇-calculus is a term assignment system for the sequent calculus and a great foundation for compiler intermediate languages due to its first-class representation of evaluation contexts. Unfortunately, only experts of the sequent calculus can appreciate its beauty. To remedy this, we present the first introduction to the 𝜆𝜇𝜇-calculus which is not directed at type theorists or logicians but at compiler hackers and programming-language enthusiasts. We do this by writing a compiler

APA, Harvard, Vancouver, ISO, and other styles

11

Chen, Zhe, Yunlong Zhu, and Zhemin Wang. "Design and Implementation of an Aspect-Oriented C Programming Language." Proceedings of the ACM on Programming Languages 8, OOPSLA1 (2024): 642–69. http://dx.doi.org/10.1145/3649834.

Full text

Abstract:

Aspect-Oriented Programming (AOP) is a programming paradigm that implements crosscutting concerns in a modular way. People have witnessed the prosperity of AOP languages for Java and C++, such as AspectJ and AspectC++, which has propelled AOP to become an important programming paradigm with many interesting application scenarios, e.g., runtime verification. In contrast, the AOP languages for C are still poor and lack compiler support. In this paper, we design a new general-purpose and expressive aspect-oriented C programming language, namely Aclang, and implement a compiler for it, which bring

APA, Harvard, Vancouver, ISO, and other styles

12

Gagan, B. R., Shivaprakash T, Thirumalai Shaktivel C, Vaishak P, and Kushal Kumar B. N. "Design of a New Language Seeks Literature Survey." International Journal for Research in Applied Science and Engineering Technology 10, no. 3 (2022): 1623–27. http://dx.doi.org/10.22214/ijraset.2022.40949.

Full text

Abstract:

Abstract: In a scientific study, computing is a must-have tool. In general, scientists have various difficulties, requirements, and views when it comes to computation, which need to be addressed by the programming language that they use, this cannot be satisfied by general-purpose languages. Also, researchers need to concentrate on the issue they are working on rather than the optimizations for the calculations, so instead of using a general-purpose language, if there exists a language whose compiler would take care of those optimizations, it would make their work easier and faster. This is a

APA, Harvard, Vancouver, ISO, and other styles

13

Paraskevopoulou, Zoe, John M. Li, and Andrew W. Appel. "Compositional optimizations for CertiCoq." Proceedings of the ACM on Programming Languages 5, ICFP (2021): 1–30. http://dx.doi.org/10.1145/3473591.

Full text

Abstract:

Compositional compiler verification is a difficult problem that focuses on separate compilation of program components with possibly different verified compilers. Logical relations are widely used in proving correctness of program transformations in higher-order languages; however, they do not scale to compositional verification of multi-pass compilers due to their lack of transitivity. The only known technique to apply to compositional verification of multi-pass compilers for higher-order languages is parametric inter-language simulations (PILS), which is however significantly more complicated

APA, Harvard, Vancouver, ISO, and other styles

14

Hensley, Dalton, and Heba Elgazzar. "Design and Implementation of the Morehead-azalea Compiler (MAC)." Computer Science & Engineering: An International Journal 15, no. 1 (2025): 315–28. https://doi.org/10.5121/cseij.2025.15133.

Full text

Abstract:

Within the realm of computer science exists the ever ubiquitous programming language compiler. The role of the programming language compiler is that of a translation device which, among other things, must correctly and efficiently translate its source language to any number of target languages. For example, the C compiler is designed to convert its source code into executable binaries that are backed by a myriad of so-called instruction set architectures, such as x86-64. In any case, this translation process is said to be opaque to the compiler’s end-user, allowing for the automation of an end

APA, Harvard, Vancouver, ISO, and other styles

15

Xu, Haoran, and Fredrik Kjolstad. "Copy-and-patch compilation: a fast compilation algorithm for high-level languages and bytecode." Proceedings of the ACM on Programming Languages 5, OOPSLA (2021): 1–30. http://dx.doi.org/10.1145/3485513.

Full text

Abstract:

Fast compilation is important when compilation occurs at runtime, such as query compilers in modern database systems and WebAssembly virtual machines in modern browsers. We present copy-and-patch, an extremely fast compilation technique that also produces good quality code. It is capable of lowering both high-level languages and low-level bytecode programs to binary code, by stitching together code from a large library of binary implementation variants. We call these binary implementations stencils because they have holes where missing values must be inserted during code generation. We show ho

APA, Harvard, Vancouver, ISO, and other styles

16

I. Salem, Abdulkream. "Phases of Work Lexical Analysis." مجلة آفاق للدراسات الإنسانية والتطبيقية, no. 3 (March 17, 2025): 294–99. https://doi.org/10.37376/ajhas.vi3.7250.

Full text

Abstract:

The purpose of the Compiler is generally to translate the program from the source language into the target language, and the Compiler is going through several phases And one of these is a phase Lexical Analysis, and this phase is used in different types in computer applications, including processing important texts, extracting information and Identification of languages required for example C++. This paper focuses on work steps Lexical Analysis to build literal table and identifier table , and build a uniform symbol tabl .

APA, Harvard, Vancouver, ISO, and other styles

17

Cristiá, Maximiliano, Diego A. Hollmann, and Claudia Frydman. "A multi-target compiler for CML-DEVS." SIMULATION 95, no. 1 (2018): 11–29. http://dx.doi.org/10.1177/0037549718765080.

Full text

Abstract:

Discrete Event System Specification (DEVS) is a modular and hierarchical formalism for system modeling and simulation. DEVS models can be mathematically described; simulation is performed by tools called concrete simulators. Concerning atomic DEVS models, each concrete simulator has its own input language which is, essentially, a general-purpose programming language (such as Java or C++). Hence, once engineers have written the mathematical model, they need to manually translate it into the input language of the concrete simulator of their choice. In this paper we present a multi-target compile

APA, Harvard, Vancouver, ISO, and other styles

18

Tassarotti, Joseph, and Jean-Baptiste Tristan. "Verified Density Compilation for a Probabilistic Programming Language." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 615–37. http://dx.doi.org/10.1145/3591245.

Full text

Abstract:

This paper presents ProbCompCert, a compiler for a subset of the Stan probabilistic programming language (PPL), in which several key compiler passes have been formally verified using the Coq proof assistant. Because of the probabilistic nature of PPLs, bugs in their compilers can be difficult to detect and fix, making verification an interesting possibility. However, proving correctness of PPL compilation requires new techniques because certain transformations performed by compilers for PPLs are quite different from other kinds of languages. This paper describes techniques for verifying such t

APA, Harvard, Vancouver, ISO, and other styles

19

Addis, Andrea, and Olimpia Giuliana Loddo. "An Intersemiotic Translation of Normative Utterances to Machine Language." International journal of Web & Semantic Technology 13, no. 1 (2022): 1–11. http://dx.doi.org/10.5121/ijwest.2022.13101.

Full text

Abstract:

Programming Languages (PL) effectively performs an intersemiotic translation from a natural language to machine language. PL comprises a set of instructions to implement algorithms, i.e., to perform (computational) tasks. Similarly to Normative Languages (NoL), PLs are formal languages that can perform both regulative and constitutive functions. The paper presents the first results of interdisciplinary research aimed at highlighting the similarities between NoL (social sciences) and PL (computer science) through everyday life examples, exploiting Object-Oriented Programming Language tools and

APA, Harvard, Vancouver, ISO, and other styles

20

Ballantyne, Michael, Mitch Gamburg, and Jason Hemann. "Compiled, Extensible, Multi-language DSLs (Functional Pearl)." Proceedings of the ACM on Programming Languages 8, ICFP (2024): 64–87. http://dx.doi.org/10.1145/3674627.

Full text

Abstract:

Implementations of domain-specific languages should offer both extensibility and performance optimizations. With the new syntax-spec metalanguage in Racket, programmers can easily create DSL implementations that are both automatically macro-extensible and subject to conventional compiler optimizations. This pearl illustrates this approach through a new implementation of miniKanren, a widely used relational programming DSL. The miniKanren community has explored, in separate implementations, optimization techniques and a wide range of extensions. We demonstrate how our new miniKanren implementat

APA, Harvard, Vancouver, ISO, and other styles

21

Ebresafe, Oghenevwogaga, Ian Zhao, Ende Jin, Arthur Bright, Charles Jian, and Yizhou Zhang. "Certified Compilers à la Carte." Proceedings of the ACM on Programming Languages 9, PLDI (2025): 372–95. https://doi.org/10.1145/3729261.

Full text

Abstract:

Certified compilers are complex software systems. Like other large systems, they demand modular, extensible designs. While there has been progress in extensible metatheory mechanization, scaling extensibility and reuse to meet the demands of full compiler verification remains a major challenge. We respond to this challenge by introducing novel expressive power to a proof language. Our language design equips the Rocq prover with an extensibility mechanism inspired by the object-oriented ideas of late binding, mixin composition, and family polymorphism. We implement our design as a plugin for Ro

APA, Harvard, Vancouver, ISO, and other styles

22

Power, James, and David Sinclair. "A Formal Model of Forth Control Words in the Pi-Calculus." JUCS - Journal of Universal Computer Science 10, no. (9) (2004): 1272–93. https://doi.org/10.3217/jucs-010-09-1272.

Full text

Abstract:

In this paper we develop a formal specification of aspects of the Forth programming language. We describe the operation of the Forth compiler as it translates XSForth control words, dealing in particular with the interpretation of immediate words during compilation. Our goal here is to provide a basis for the study of safety properties of embedded systems, many of which are constructed using Forth or Forth-like languages. To this end we construct a model of the Forth compiler in the -calculus, and have simulated its execution by animating this model using the Pict programming language.

APA, Harvard, Vancouver, ISO, and other styles

23

Livinskii, Vsevolod, Dmitry Babokin, and John Regehr. "Fuzzing Loop Optimizations in Compilers for C++ and Data-Parallel Languages." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1826–47. http://dx.doi.org/10.1145/3591295.

Full text

Abstract:

Compilers are part of the foundation upon which software systems are built; they need to be as correct as possible. This paper is about stress-testing loop optimizers; it presents a major reimplementation of Yet Another Random Program Generator (YARPGen), an open-source generative compiler fuzzer. This new version has found 122 bugs, both in compilers for data-parallel languages, such as the Intel® Implicit SPMD Program Compiler and the Intel® oneAPI DPC++ compiler, and in C++ compilers such as GCC and Clang/LLVM. The first main contribution of our work is a novel method for statically avoidin

APA, Harvard, Vancouver, ISO, and other styles

24

Leskelä, Leealaura, Arto Mustajoki, and Aino Piehl. "Easy and plain languages as special cases of linguistic tailoring and standard language varieties." Nordic Journal of Linguistics 45, no. 2 (2022): 194–213. http://dx.doi.org/10.1017/s0332586522000142.

Full text

Abstract:

AbstractThis article aims to introduce new insights to further the understanding of easy language (EL) and plain language (PL) as examples of tailored language and place them within a broader context of linguistic varieties. We examine EL and PL in relation to standard language, and we consider the degree of conscious effort required in tailoring and the compliance with the codified norms of standard language. Both EL and PL are used in asymmetric communication: PL to mediate between specialists and the general public and EL in communication with people with language barriers. We argue that wh

APA, Harvard, Vancouver, ISO, and other styles

25

Vidhan Singh, Dayanand Choudhary, Nagendra Singh, Manish Kumar,. "Introduction to the basic data types in programming." Tuijin Jishu/Journal of Propulsion Technology 43, no. 4 (2023): 246–49. http://dx.doi.org/10.52783/tjjpt.v43.i4.2345.

Full text

Abstract:

In the era of technology, the need for developing a language to communicate with computers led to the development of different programming languages. Computers cannot understand the commands in the normal human languages so we needed programming languages to communicate with computers and develop different apps, website and software programs. A crucial part for programming languages are data types. Data types are the classifications of data which tells the compiler or interpreter how the developer wants to insert the data.

APA, Harvard, Vancouver, ISO, and other styles

26

Fayed, Mahmoud Samir, and Yousef A. Alohali. "Ring: A Lightweight and Versatile Cross-Platform Dynamic Programming Language Developed Using Visual Programming." Electronics 13, no. 23 (2024): 4627. http://dx.doi.org/10.3390/electronics13234627.

Full text

Abstract:

New programming languages are often designed to keep up with technological advancements and project requirements while also learning from previous attempts and introducing more powerful expression mechanisms. However, most existing dynamic programming languages rely on English keywords and lack features that facilitate easy translation of language syntax. Additionally, maintaining multiple implementations of the same language for different platforms, such as desktops and microcontrollers, can lead to inconsistencies and fragmented features. Furthermore, they usually do not use visual programmi

APA, Harvard, Vancouver, ISO, and other styles

27

Ferreira, Elisabete, Rogério Paulo, Cruz da, and Pedro Henriques. "Integration of the ST language in a model-based engineering environment for control systems: An approach for compiler implementation." Computer Science and Information Systems 5, no. 2 (2008): 87–101. http://dx.doi.org/10.2298/csis0802087f.

Full text

Abstract:

In the context of the INTEGRA project, compilation and code generation features for behavior definition are to be integrated in an existing model-based engineering environment for control systems. The devised compiler architecture is domain-specific and provides support for multiple input languages and multiple target platforms. In this paper we discuss an architectural approach in which the compiling process is organized in two different stages: the compiling stage and the linking stage. The compiling stage generates target independent code from possibly multiple input languages. The linking

APA, Harvard, Vancouver, ISO, and other styles

28

Sun, Bojin, and Minze Sun. "Concurrency and Operating Systems, Processors, and Programming Languages." Highlights in Science, Engineering and Technology 39 (April 1, 2023): 881–87. http://dx.doi.org/10.54097/hset.v39i.6667.

Full text

Abstract:

The main content of our research is to optimize and improve the concurrency of the system from the three aspects of operating system, processor and programming language. Previous solutions have focused on hardware techniques to improve concurrency. Our goal is to solve the problem of resource occupancy and contention through algorithms, data structures, optimization interrupts, and optimization of process and coroutine scheduling. In the final ideal case, the finite-state machine switching code generated by the compiler can be used to switch the coroutines in the same process. For threads, the

APA, Harvard, Vancouver, ISO, and other styles

29

Dold, Axel, Friedrich von Henke, and Wolfgang Goerigk. "A Completely Verified Realistic Bootstrap Compiler." International Journal of Foundations of Computer Science 14, no. 04 (2003): 659–80. http://dx.doi.org/10.1142/s0129054103001947.

Full text

Abstract:

This paper reports on a large verification effort in constructing an initial fully trusted bootstrap compiler executable for a realistic system programming language and real target processor. The construction and verification process comprises three tasks: the verification of the compiling specification (a relation between abstract source and target programs) with respect to the language semantics and a realistic correctness criterion. This proof has been completely mechanized using the PVS verification system and is one of the largest case-studies in formal verification we are aware of. Secon

APA, Harvard, Vancouver, ISO, and other styles

30

BERNARD, THOMAS A. M., CLEMENS GRELCK, and CHRIS R. JESSHOPE. "ON THE COMPILATION OF A LANGUAGE FOR GENERAL CONCURRENT TARGET ARCHITECTURES." Parallel Processing Letters 20, no. 01 (2010): 51–69. http://dx.doi.org/10.1142/s0129626410000053.

Full text

Abstract:

The challenge of programming many-core architectures efficiently and effectively requires models and methods to co-design chip architectures and their software tool chain, using an approach that is both vertical and general. In this paper, we present compilation schemes for a general model of concurrency captured in a parallel language designed for system-level programming and as a target for higher level compilers. We also expose the challenges of integrating these transformation rules into a sequential-oriented compiler. Moreover, we discuss resource mapping inherent to those challenges. Our

APA, Harvard, Vancouver, ISO, and other styles

31

Artal, Cayetano Guerra, Maria Dolores Afonso Suarez, Idafen Santana Perez, and Ruben Quesada Lopez. "OLC, On-Line Compiler to Teach Programming Languages." International Journal of Computers Communications & Control 3, no. 1 (2008): 69. http://dx.doi.org/10.15837/ijccc.2008.1.2376.

Full text

Abstract:

The advance of Internet towards Web 2.0 conveys the potential it has in a wide range of scopes. The ongoing progress of the Web technology and its availability in teaching and learning, as well as a students’ profile increasingly more used to managing an important amount of digital information, offers lecturers the opportunity and challenge of putting at students’ disposal didactic tools making use of the Internet. Programming is one of the essential areas taught in university studies of Computer Science and other engineering degrees. At present, it is a knowledge acquired through tutorial cla

APA, Harvard, Vancouver, ISO, and other styles

32

SWAMY, NIKHIL, JUAN CHEN, CÉDRIC FOURNET, PIERRE-YVES STRUB, KARTHIKEYAN BHARGAVAN, and JEAN YANG. "Secure distributed programming with value-dependent types." Journal of Functional Programming 23, no. 4 (2013): 402–51. http://dx.doi.org/10.1017/s0956796813000142.

Full text

Abstract:

AbstractDistributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging. We present F*, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Our language provides arbitrary recursion while maintaining a l

APA, Harvard, Vancouver, ISO, and other styles

33

Lai, Yong, Dayou Liu, and Minghao Yin. "New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition." Journal of Artificial Intelligence Research 58 (March 8, 2017): 453–521. http://dx.doi.org/10.1613/jair.5271.

Full text

Abstract:

We identify two families of canonical knowledge compilation languages. Both families augment ROBDD with conjunctive decomposition bounded by an integer i ranging from 0 to ∞. In the former, the decomposition is finest and the decision respects a chain C of variables, while both the decomposition and decision of the latter respect a tree T of variables. In particular, these two families cover the three existing languages ROBDD, ROBDD with as many implied literals as possible, and AND/OR BDD. We demonstrate that each language in the first family is complete, while each one in the second family i

APA, Harvard, Vancouver, ISO, and other styles

34

Singh, Rashandeep, and Dr Gulshan Goyal. "Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings." Journal of Scientific Research 66, no. 02 (2022): 16–21. http://dx.doi.org/10.37398/jsr.2022.660203.

Full text

Abstract:

Computer Science and Engineering have given us the field of automata theory, one of the largest areas that is concerned with the efficiency of an algorithm in solving a problem on a computational model. Various classes of formal languages are represented using Chomsky hierarchy. These languages are described as a set of specific strings over a given alphabet and can be described using state or transition diagrams. The state/transition diagram for regular languages is called a finite automaton which is used in compiler design for recognition of tokens. Other applications of finite automata incl

APA, Harvard, Vancouver, ISO, and other styles

35

Wardak, Abdullah A. "Interfacing C and TMS320C6713 Assembly Language (Part II)." WSEAS TRANSACTIONS ON COMPUTERS 20 (April 27, 2021): 74–81. http://dx.doi.org/10.37394/23205.2021.20.9.

Full text

Abstract:

In this paper, an interfacing of C and the assembly language of TMS320C6713 is presented. Similarly, interfacing of C with the assembly language of Motorola 68020 (MC68020) microprocessor is also presented for comparison. However, it should be noted that the way the C compiler passes arguments from the main function in C to the TMS320C6713 assembly language subroutine is totally different from the way the C compiler passes arguments in a conventional microprocessor such as MC68020. Therefore, it is very important for a user of the TMS320C6713-based system to properly understand and follow the

APA, Harvard, Vancouver, ISO, and other styles

36

Marowka, Ami. "Execution Model of Three Parallel Languages: OpenMP, UPC and CAF." Scientific Programming 13, no. 2 (2005): 127–35. http://dx.doi.org/10.1155/2005/914081.

Full text

Abstract:

The aim of this paper is to present a qualitative evaluation of three state-of-the-art parallel languages: OpenMP, Unified Parallel C (UPC) and Co-Array Fortran (CAF). OpenMP and UPC are explicit parallel programming languages based on the ANSI standard. CAF is an implicit programming language. On the one hand, OpenMP designs for shared-memory architectures and extends the base-language by using compiler directives that annotate the original source-code. On the other hand, UPC and CAF designs for distribute-shared memory architectures and extends the base-language by new parallel constructs. W

APA, Harvard, Vancouver, ISO, and other styles

37

Olatunji, Ezekiel Kolawole, John B. Oladosu, Odetunji A. Odejobi, and Stephen O. Olabiyisi. "Design and implementation of an African native language-based programming language." International Journal of Advances in Applied Sciences 10, no. 2 (2021): 171. http://dx.doi.org/10.11591/ijaas.v10.i2.pp171-177.

Full text

Abstract:

<p>Most of the existing high level programming languages havehitherto borrowed their lexical items from human languages including European and Asian languages. However, there is paucity of research information on programming languages developed with the lexicons of an African indigenous language. This research explored the design and implementation of an African indigenous language-based programming language using Yoruba as case study. Yoruba is the first language of over 30 million people in the south-west of Nigeria, Africa; and is spoken by over one hundred million people world-wide.

APA, Harvard, Vancouver, ISO, and other styles

38

Ezekiel, K. Olatunji, B. Oladosu John., A. Odejobi Odetunji, and O. Olabiyisi Stephen. "Design and implementation of an African native language-based programming language." International Journal of Advances in Applied Sciences (IJAAS) 10, no. 2 (2021): 171–77. https://doi.org/10.11591/ijaas.v10.i2.pp171-177.

Full text

Abstract:

Most of the existing high level programming languages have hitherto borrowed their lexical items from human languages including European and Asian languages. However, there is paucity of research information on programming languages developed with the lexicons of an African indigenous language. This research explored the design and implementation of an African indigenous language-based programming language using Yoruba as case study. Yoruba is the first language of over 30 million people in the south-west of Nigeria, Africa; and is spoken by over one hundred million people world-wide. It is ho

APA, Harvard, Vancouver, ISO, and other styles

39

KIRCHNER, HÉLÈNE, and PIERRE-ETIENNE MOREAU. "Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories." Journal of Functional Programming 11, no. 2 (2001): 207–51. http://dx.doi.org/10.1017/s0956796800003907.

Full text

Abstract:

First-order languages based on rewrite rules share many features with functional languages, but one difference is that matching and rewriting can be made much more expressive and powerful by incorporating some built-in equational theories. To provide reasonable programming environments, compilation techniques for such languages based on rewriting have to be designed. This is the topic addressed in this paper. The proposed techniques are independent from the rewriting language, and may be useful to build a compiler for any system using rewriting modulo Associative and Commutative (AC) theories.

APA, Harvard, Vancouver, ISO, and other styles

40

Kim, Caleb, Pai Li, Anshuman Mohan, Andrew Butt, Adrian Sampson, and Rachit Nigam. "Unifying Static and Dynamic Intermediate Languages for Accelerator Generators." Proceedings of the ACM on Programming Languages 8, OOPSLA2 (2024): 2242–67. http://dx.doi.org/10.1145/3689790.

Full text

Abstract:

Compilers for accelerator design languages (ADLs) translate high-level languages into application-specific hardware. ADL compilers rely on a hardware control interface to compose hardware units. There are two choices: static control, which relies on cycle-level timing; or dynamic control, which uses explicit signalling to avoid depending on timing details. Static control is efficient but brittle; dynamic control incurs hardware costs to support compositional reasoning. Piezo is an ADL compiler that unifies static and dynamic control in a single intermediate language (IL). Its key insight is th

APA, Harvard, Vancouver, ISO, and other styles

41

Lecoeur, Bastien, Hasan Mohsin, and Alastair F. Donaldson. "Program Reconditioning: Avoiding Undefined Behaviour When Finding and Reducing Compiler Bugs." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1801–25. http://dx.doi.org/10.1145/3591294.

Full text

Abstract:

We introduce program reconditioning, a method for allowing program generation and differential testing to be used to find miscompilation bugs, and test-case reduction to be used to simplify bug-triggering programs, even when (a) the programming language of interest features undefined behaviour (UB) and (b) no tools exist to detect and avoid this UB. We present two program generation tools based on our reconditioning idea: GLSLsmith for the OpenGL Shading Language (GLSL), a widely-used language for graphics programming, and WGSLsmith for the WebGPU Shading Language (WGSL), a new language for we

APA, Harvard, Vancouver, ISO, and other styles

42

Bourke, Timothy, Basile Pesin, and Marc Pouzet. "Verified Compilation of Synchronous Dataflow with State Machines." ACM Transactions on Embedded Computing Systems 22, no. 5s (2023): 1–26. http://dx.doi.org/10.1145/3608102.

Full text

Abstract:

Safety-critical embedded software is routinely programmed in block-diagram languages. Recent work in the Vélus project specifies such a language and its compiler in the Coq proof assistant. It builds on the CompCert verified C compiler to give an end-to-end proof linking the dataflow semantics of source programs to traces of the generated assembly code. We extend this work with switched blocks, shared variables, reset blocks, and state machines; define a relational semantics to integrate these block- and mode-based constructions into the existing stream-based model; adapt the standard source-t

APA, Harvard, Vancouver, ISO, and other styles

43

Afanasyev, Vitaly Olegovich, Alexey Evgenevich Borodin, and Andrey Andreevich Belevantsev. "Static Analysis for Scala." Proceedings of the Institute for System Programming of the RAS 36, no. 3 (2024): 9–20. http://dx.doi.org/10.15514/ispras-2024-36(3)-1.

Full text

Abstract:

The paper describes a static analyzer for finding defects in Scala programs. The proposed analysis scheme uses JVM bytecode produced during compilation. The generated bytecode is used as an input for inter-procedural static analyzer Svace. In contrast to the analysis of other languages supported by Svace, in this work we describe an approach that does not require compiler modifications and therefore simplifies language support. This approach can also be used in static analyzers that aim to support a large number of programming languages.

APA, Harvard, Vancouver, ISO, and other styles

44

Clément, Basile, and Albert Cohen. "End-to-end translation validation for the halide language." Proceedings of the ACM on Programming Languages 6, OOPSLA1 (2022): 1–30. http://dx.doi.org/10.1145/3527328.

Full text

Abstract:

This paper considers the correctness of domain-specific compilers for tensor programming languages through the study of Halide, a popular representative. It describes a translation validation algorithm for affine Halide specifications, independently of the scheduling language. The algorithm relies on “prophetic” annotations added by the compiler to the generated array assignments. The annotations provide a refinement mapping from assignments in the generated code to the tensor definitions from the specification. Our implementation leverages an affine solver and a general SMT solver, and scales

APA, Harvard, Vancouver, ISO, and other styles

45

Liu, Amanda, Gilbert Bernstein, Adam Chlipala, and Jonathan Ragan-Kelley. "A Verified Compiler for a Functional Tensor Language." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 320–42. http://dx.doi.org/10.1145/3656390.

Full text

Abstract:

Producing efficient array code is crucial in high-performance domains like image processing and machine learning. It requires the ability to control factors like compute intensity and locality by reordering computations into different stages and granularities with respect to where they are stored. However, traditional pure, functional tensor languages struggle to do so. In a previous publication, we introduced ATL as a pure, functional tensor language capable of systematically decoupling compute and storage order via a set of high-level combinators known as reshape operators. Reshape operators

APA, Harvard, Vancouver, ISO, and other styles

46

Mahmoud, Amira T., Walaa Medhat, Sahar Selim, Hala Zayed, Ahmed H. Yousef, and Nahla Elaraby. "TC-Verifier: Trans-Compiler-Based Code Translator Verifier with Model-Checking." Applied System Innovation 8, no. 3 (2025): 60. https://doi.org/10.3390/asi8030060.

Full text

Abstract:

Code-to-code translation, a critical domain in software engineering, increasingly utilizes trans-compilers to translate between high-level languages. Traditionally, the fidelity of such translations has been evaluated using the BLEU score, which predominantly measures token similarity between the generated output and the ground truth. However, this metric falls short of assessing the methodologies underlying the translation processes and only evaluates the translations that are tested. To bridge this gap, this paper introduces an innovative architecture, “TC-Verifier”, to formally employ the U

APA, Harvard, Vancouver, ISO, and other styles

47

Zimmermann, Wolf, and Thilo Gaul. "On the Construction of Correct Compiler Back-Ends: An ASM-Approach." JUCS - Journal of Universal Computer Science 3, no. (5) (1997): 504–67. https://doi.org/10.3217/jucs-003-05-0504.

Full text

Abstract:

Existing works on the construction of correct compilers have at least one of the following drawbacks: (i) correct compilers do not compile into machine code of existing processors. Instead they compile into programs of an abstract machine which ignores limitations and properties of real-life processors. (ii) the code generated by correct compilers is orders of magnitudes slower than the code generated by unverified compilers. (iii) the considered source language is much less complex than real-life programming languages. This paper focuses on the construction of correct compiler backends which

APA, Harvard, Vancouver, ISO, and other styles

48

Isaeva, G. N., N. N. Teodorovich, and Y. Y. Sidorov. "Tendencies of development of languages of programming of the high level." Informacionno-technologicheskij vestnik 14, no. 4 (2017): 117–25. http://dx.doi.org/10.21499/2409-1650-2017-4-117-125.

Full text

Abstract:

The main directions of the development of modern high-level programming languages (HL PL) and their evolutionary development are considered in the article. The statistics are presented for the HL PL, which are key in the framework of various programming paradigms, based on the data of modern electronic resources. A tendency is shown to obliterate the boundaries between the strict classification of the HL PL, as belonging to different computational models underlying the development of the language. It is shown that the main reason for the popularity of scripting languages and languages of react

APA, Harvard, Vancouver, ISO, and other styles

49

Kovačević, Željko, Marjan Mernik, Miha Ravber, and Matej Črepinšek. "From Grammar Inference to Semantic Inference—An Evolutionary Approach." Mathematics 8, no. 5 (2020): 816. http://dx.doi.org/10.3390/math8050816.

Full text

Abstract:

This paper describes a research work on Semantic Inference, which can be regarded as an extension of Grammar Inference. The main task of Grammar Inference is to induce a grammatical structure from a set of positive samples (programs), which can sometimes also be accompanied by a set of negative samples. Successfully applying Grammar Inference can result only in identifying the correct syntax of a language. With the Semantic Inference a further step is realised, namely, towards inducing language semantics. When syntax and semantics can be inferred, a complete compiler/interpreter can be generat

APA, Harvard, Vancouver, ISO, and other styles

50

CASEAU, YVES, FRANÇOIS-XAVIER JOSSET, and FRANÇOIS LABURTHE. "CLAIRE: combining sets, search and rules to better express algorithms." Theory and Practice of Logic Programming 2, no. 6 (2002): 769–805. http://dx.doi.org/10.1017/s1471068401001363.

Full text

Abstract:

This paper presents a programming language which includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (functional) language. Although these paradigms are separately well known and are available under various programming environments, the originality of the CLAIRE language comes from the tight integration, which yields interesting run-time performances, and from the richness of this combination, which yields new ways in which to express complex algorithmic patterns with few elegant lines. To achieve the opposite goals of a

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!