Compilers
Keith D. Cooper, Ken Kennedy, Linda Torczon · Elsevier eBooks · 2003
Cited by 2
Search 250 million research papers
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “compilers”
Compilers
Forest Service, Fire Surrogate · 2009
Okanogan-Wenatchee National ForestThe Forest Service of the U.S. Department of Agriculture is dedicated to the principle of multiple use management of the Nation’s forest resources for sustained yields of wood, water, forage, wildlife, and recreation. Through forestry research, cooperation with the States and private forest owners, and management of the National Forests and National Grasslands, it strives—as directed by Congress—to provide increasingly greater service to a growing Nation. The U.S. Department of Agriculture (USDA) prohibits discrimination in all its programs and activities on the basis of race, color, national origin, age, disability, and where applicable, sex, marital status, familial status, parental status, religion, sexual orientation, genetic information, political beliefs, reprisal, or because all or part of an individual’s income is derived from any public assistance program. (Not all prohibited bases apply to all programs.) Persons with disabilities who require alternative means for communication of program information (Braille, large print, audiotape, etc.) should contact USDA’s TARGET Center at (202) 720-2600 (voice and TDD). To file a complaint of discrimination, write
Cited by 0
Compilers
Nelson H. F. Beebe · 2014
Version 3.209 This bibliography records books and historical publications about the UNIX operating sys-tem, and UNIX programming tools. It mostly excludes networks and network programming, which are treated in a separate bibliography, internet.bib. This bibliography was started from material in postings to the sunflash
Cited by 0
compilers
Xipeng Shen, Michael L. Scott · 2008
Utility programs, which perform similar and largely independent operations on a sequence of inputs, include such common applications as compilers, interpreters, and document parsers; databases; and compression and encoding tools. The repetitive behavior of these programs, while often clear to users, has been difficult to capture automatically. We present an active profiling technique in which controlled inputs to utility programs are used to expose execution phases, which are then marked, automatically, through binary instrumentation, enabling us to exploit phase transitions in production runs with arbitrary inputs. We demonstrate the effectiveness and programmability of active profiling via experiments with six utility programs from the SPEC benchmark suite; compare to code and interval phases; and describe applications of active profiling to memory management and memory leak detection.
Cited by 0
Compilers:
Sea Turtle Symposium, National Marine, Fisheries Service et al. · 2000
Technical Memoranda are used for documentation and timely communication of preliminary resuits, interim reports, or special-purpose information, and have not received complete formal review, editorial control, or detailed editing. Table of Contents i
Cited by 0
Compilers
Daniel Page · Texts in computer science · 2009
Cited by 1
Compilers
Krisztián Pócza, Eötvös Loránd, Pázmány Péter Sétány /c et al. · 2008
Dynamic program slicing methods are very attractive for debugging because many statements can be ignored in the process of localizing a bug. Although language interoperability is a key concept in modern development platforms, current slicing techniques are still restricted to a single language. In this paper a cross-language dynamic program slicing technique is introduced for the.NET environment. The method is utilizing the CLR Debugging Services API, hence it can be applied to large multi-language applications.
Cited by 0
compilers
Yutao Zhong, Maksim Orlovich, Xipeng Shen et al. · 2008
While the memory of most machines is organized as a hierarchy, program data are laid out in a uniform address space. This paper defines a model of reference affinity, which measures how close a group of data are accessed together in a reference trace. It proves that the model gives a hierarchical partition of program data. At the top is the set of all data with the weakest affinity. At the bottom is each data element with the strongest affinity. Based on the theoretical model, the paper presents k-distance analysis, a practical test for the hierarchical affinity of source-level data. When used for array regrouping and structure splitting, k-distance analysis consistently outperforms data organizations given by the programmer, compiler analysis, frequency profiling, statistical clustering, and all other methods we have tried.
Cited by 0
COMPILERS
University of Hawaii Press eBooks · 2024
Cited by 0
Compilers:
Sea Turtle Symposium, National Marine, Fisheries Service et al. · 2000
Technical Memoranda are used for documentation and timely communication of preliminary resuits, interim reports, or special-purpose information, and have not received complete formal review, editorial control, or detailed editing. Table of Contents i
Cited by 0
Compilers
Forest Service, Rocky Mountain · 2005
and facilitates research to protect and restore human relationships with wilderness landscapes. Besides national U.S. leadership in wilderness social science issues, as a Fulbright Scholar and a Senior Fulbright Protected Area Specialist, Dr. Watson maintains strong commitment to the Finnish Forest Research Institute (Metla), the University of Lapland, and the Arctic Centre in Rovaniemi, Finland; the University of São Paulo at Piracicaba, Brasil; and the
Cited by 0
compilers
Xipeng Shen, Yutao Zhong, Chen Ding · 2008
As computer memory hierarchy becomes adaptive, its performance increasingly depends on forecasting the dynamic program locality. This paper presents a method that predicts the locality phases of a program by a combination of locality profiling and run-time prediction. By profiling a training input, it identifies locality phases by sifting through all accesses to all data elements using variabledistance sampling, wavelet filtering, and optimal phase partitioning. It then constructs a phase hierarchy through grammar compression. Finally, it inserts phase markers into the program using binary rewriting. When the instrumented program runs, it uses the first few executions of a phase to predict all its later executions. Compared with existing methods based on program code and execution intervals, locality phase prediction is unique because it uses locality profiles, and it marks phase boundaries in program code. The second half of the paper presents a comprehensive evaluation. It measures the accuracy and the coverage of the new technique and compares it with best known run-time methods. It measures its benefit in adaptive cache resizing and memory remapping. Finally, it compares the automatic analysis with manual phase marking. The results show that locality phase prediction is well suited for identifying large, recurring phases in complex programs.
Cited by 0
Compilers
David Bulbeck, Anthony Reid, Lay Cheng Tan et al. · 1998
Cited by 0Open access
\nCalculating compilers
Meijer, H.J.M. · Radboud Repository (Radboud University) · 1992
\n Contains fulltext :\n mmubn000001_136175155.pdf (Publisher’s version ) (Open Access)\n
Cited by 0
C++ Compilers
Slobodan Dmitrović · Apress eBooks · 2023
C++ programs are usually a collection of some C++ code spread across one or multiple source and header files. Source files, by convention, have the .cpp extension, and header files, by convention, have the .h extension. Other extensions are also possible. Both header and source files are regular text files containing some C++ source code. The C++ compiler is a program that compiles these files and turns them into object files. A linker then links object files together to create an executable file or a library. At the time of writing, some of the more popular C++ compilers are
Cited by 0
Extensible Compilers
Adam Granicz, Jason Hickey · 2002
This paper describes a practical approach for implementing certain types of domain-specific languages with extensible compilers.
Cited by 0
Embedded Compilers
Baars, A.I., Software Technology, Dep Informatica · Data Archiving and Networked Services (DANS) · 2009
For automation it is important to express the knowledge of the experts in a form that is understood by a computer. Each area of knowledge has its own terminology and ways of formulating things; be it by drawing diagrams, using formulae, or using formalized languages. In the last case we say we have a "Domain Specific Language", and --since it is formalised-- it can usually be processed or analysed by a computer or even be compiled into machine code. Domain-specific languages often do not have a formal specification and are usually designed and implemented in an ad-hoc fashion, frequently leading to inconsistent designs. Furthermore they often lack features that are usually found in programming languages, such as abstraction mechanisms, type systems, and static analysis. Such features are often considered to take too much effort to implement. Initially these features are not really missed, however, when programs grow, they become indispensable. Defining a complete and consistent language from scratch is not an easy task, and so the question arises: how to support the design and implementation of domain-specific languages? A solution is to embed a domain-specific language in a general-purpose host language. This approach has many advantages. One does not have to implement an entirely new compiler, one can simply reuse the features of the host language, such as the type system and abstraction mechanisms. Futhermore, different embedded languages can be combined together in a single program. In the Haskell community embedding domain-specific languages by means of combinator libraries is common practice. The rich type system and flexible notational features, such as user-defined operators, type classes, and do-notation, make Haskell very suitable for embedding domain-specific languages. Originally combinator-based embedded languages directly expressed the denotational semantics of the embedded language. As a consequence, techniques used in conventional compilers are not applicable because the representation of the embedded progam is implicit. A logical next step along this line of development is to first build an intermediate structure, which can then be analyzed, transformed and optimized as in an ordinary compiler. How to do such things effectively in a strongly typed host language is the subject of this thesis: Embedded Compilers.
Cited by 0Open access
PORTABLE COMPILERS
Portable Compilers Andrew, A. S. Tanenbaum, H. Van et al. · 2008
Cited by 0
Compilers' Note
Colorado General Assembly · eYLS (Yale Law School) · 1966
Cited by 0
Calculating compilers
Meijer, H.J.M. · Data Archiving and Networked Services (DANS) · 1992
Cited by 1Open access