Search results for "Compiler"
showing 10 items of 33 documents
Experimental evaluation of hypertext access structures
2002
Transient hypertextual access structures (THASs) are temporary graphs formed automatically on the basis of the situation-dependent information needs of software engineers. The approach is implemented in the HyperSoft system, which is a hypertext-based software maintenance support tool. THASs highlight the relevant parts of the program and enable nonlinear browsing between them. The system also supports various graphical views whose elements are linked to the program text. This paper describes the effects of using these hypertextual structures in two separate experiments. The subjects of both experiments were computer science students (total N = 70). In both experiments, the subjects perform…
Pure Functions in C: A Small Keyword for Automatic Parallelization
2017
AbstractThe need for parallel task execution has been steadily growing in recent years since manufacturers mainly improve processor performance by increasing the number of installed cores instead of scaling the processor’s frequency. To make use of this potential, an essential technique to increase the parallelism of a program is to parallelize loops. Several automatic loop nest parallelizers have been developed in the past such as PluTo. The main restriction of these tools is that the loops must be statically analyzable which, among other things, disallows function calls within the loops. In this article, we present a seemingly simple extension to the C programming language which marks fun…
Abstract Syntax as Interlingua: Scaling Up the Grammatical Framework from Controlled Languages to Robust Pipelines
2020
Abstract syntax is an interlingual representation used in compilers. Grammatical Framework (GF) applies the abstract syntax idea to natural languages. The development of GF started in 1998, first as a tool for controlled language implementations, where it has gained an established position in both academic and commercial projects. GF provides grammar resources for over 40 languages, enabling accurate generation and translation, as well as grammar engineering tools and components for mobile and Web applications. On the research side, the focus in the last ten years has been on scaling up GF to wide-coverage language processing. The concept of abstract syntax offers a unified view on many oth…
Pragmatic markers resulting from language contact. The case of sañani in Aymara
2020
This paper explores the pragmatic functions of a previously unattested pragmatic marker (Fraser, 1996, 2006) found in Aymara, i.e. sanani ‘let’s say’. The uses of sanani suggest that this marker is the result of the influence of Spanish on Aymara due to sustained language contact. Sanani seems to be the “replication” (Heine and Kuteva, 2005) of the Spanish pragmatic marker digamos ‘let’s say’. Like digamos (Grande Alija, 2010; Quartararo, 2017a), sanani functions as a pragmatic marker by signaling either an inferential process or the semantic relation between two discourse segments. The original data used for this analysis was gathered through the Family Problems Picture task (San Roque et …
Tool support for MOLA
2006
AbstractThe paper describes the MOLA Tool, which supports the model transformation language MOLA. MOLA Tool consists of two parts: MOLA definition environment and MOLA execution environment. MOLA definition environment is based on the GMF (Generic Modeling Framework) and contains graphical editors for metamodels and MOLA diagrams, as well as the MOLA compiler. The main component of MOLA execution environment is a MOLA virtual machine, which performs model transformations, using an SQL database as a repository. The execution environment may be used as a plug-in for Eclipse based modeling tools (e.g., IBM Rational RSA). The current status of the tool is truly academic.
Concept and Development of Modular VLIW Processor Based on FPGA
2010
Modern FPGA chips, with their larger memory capacity and reconfigurability potential, are opening new frontiers in rapid prototyping of embedded systems. With the advent of high density FPGAs it is now possible to implement a high performance VLIW processor core in an FPGA. Architecture based on Very Long Instruction Word (VLIW) processors are an optimal choice in the attempt to obtain high performance level in embedded system. In VLIW architecture, the effectiveness of these processors depends on the ability of compilers to provide sufficient instruction level parallelism(ILP) in program code. Using advanced compiler technology could take these functions, This paper describes research resu…
Imaginary time propagation code for large-scale two-dimensional eigenvalue problems in magnetic fields
2013
We present a code for solving the single-particle, time-independent Schr\"odinger equation in two dimensions. Our program utilizes the imaginary time propagation (ITP) algorithm, and it includes the most recent developments in the ITP method: the arbitrary order operator factorization and the exact inclusion of a (possibly very strong) magnetic field. Our program is able to solve thousands of eigenstates of a two-dimensional quantum system in reasonable time with commonly available hardware. The main motivation behind our work is to allow the study of highly excited states and energy spectra of two-dimensional quantum dots and billiard systems with a single versatile code, e.g., in quantum …
Cycle-triggered averaging of respiration-related neuronal activity
1985
Abstract A computer system is presented which provides off-line computation of cycle-triggered histograms (CTH) of respiration-related neuronal activity. Binwidths of the histograms are freely selectable by software from 10 ms to 100 ms. For special evaluation purposes. CTHs can be standardized in different ways concerning cycle duration as well as amplitude. Time incidence of maximum frequency, center of gravity and expiration-to-inspiration phase transition within the respiratory cycle are computed. The system employs special hardware interfaces to an 8-bit microcomputer which are briefly described. Data acquisition, data manipulation and output handling of the results are performed by ch…
A systematic approach to deriving incremental type checkers
2020
Static typing can guide programmers if feedback is immediate. Therefore, all major IDEs incrementalize type checking in some way. However, prior approaches to incremental type checking are often specialized and hard to transfer to new type systems. In this paper, we propose a systematic approach for deriving incremental type checkers from textbook-style type system specifications. Our approach is based on compiling inference rules to Datalog, a carefully limited logic programming language for which incremental solvers exist. The key contribution of this paper is to discover an encoding of the infinite typing relation as a finite Datalog relation in a way that yields efficient incremental up…
PenRed: An extensible and parallel Monte-Carlo framework for radiation transport based on PENELOPE
2021
Monte Carlo methods provide detailed and accurate results for radiation transport simulations. Unfortunately, the high computational cost of these methods limits its usage in real-time applications. Moreover, existing computer codes do not provide a methodology for adapting these kind of simulations to specific problems without advanced knowledge of the corresponding code system, and this restricts their applicability. To help solve these current limitations, we present PenRed, a general-purpose, stand-alone, extensible and modular framework code based on PENELOPE for parallel Monte Carlo simulations of electron-photon transport through matter. It has been implemented in C++ programming lan…