Results 1 - 10 of 6,510

Compiling Problem Specifications into SAT

by Marco Cadoli, Andrea Schaerf , 2001
"... We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called np-spec, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such to captu ..."
Abstract - Cited by 43 (12 self) - Add to MetaCart
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called np-spec, which allows the definition of complex problems in a highly declarative way, and whose expressive power

LLVM: A compilation framework for lifelong program analysis & transformation

by Chris Lattner, Vikram Adve , 2004
"... ... a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing high-level information to compiler transformations at compile-time, link-time, run-time, and in idle time between runs. LLVM defines a common, low-level code re ..."
Abstract - Cited by 852 (20 self) - Add to MetaCart
for several interprocedural problems; and (c) illustrative examples of the benefits LLVM provides for several challenging compiler problems.

Department of Economic and Social Affairs, Population Division

by United Nations , 1999
"... vital interface between global policies in the economic, social and environmental spheres and national action. The Department works in three main interlinked areas: (i) it compiles, generates and analyses a wide range of economic, social and environmental data and information on which Member States ..."
Abstract - Cited by 505 (3 self) - Add to MetaCart
vital interface between global policies in the economic, social and environmental spheres and national action. The Department works in three main interlinked areas: (i) it compiles, generates and analyses a wide range of economic, social and environmental data and information on which Member States

Trace Scheduling: A Technique for Global Microcode Compaction

by Joseph A. Fisher - IEEE TRANSACTIONS ON COMPUTERS , 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract - Cited by 683 (5 self) - Add to MetaCart
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages

Certification of Programs for Secure Information Flow

by Dorothy E. Denning, Peter J. Denning , 1977
"... This paper presents a certification mechanism for verifying the secure flow of information through a program. Because it exploits the properties of a lattice structure among security classes, the procedure is sufficiently simple that it can easily be included in the analysis phase of most existing c ..."
Abstract - Cited by 490 (1 self) - Add to MetaCart
compilers. Appropriate semantics are presented and proved correct. An important application is the confinement problem: The mechanism can prove that a program cannot cause supposedly nonconfidential results to depend on confidential input data.

Effective Compiler Support for Predicated Execution Using the Hyperblock

by Scott A. Mahlke, et al. , 1992
"... Predicated execution is an effective technique for dealing with conditional branches in application programs. However, there are several problems associated with conventional compiler support for predicated execution. First, all paths of control are combined into a single path regardless of their ex ..."
Abstract - Cited by 374 (24 self) - Add to MetaCart
Predicated execution is an effective technique for dealing with conditional branches in application programs. However, there are several problems associated with conventional compiler support for predicated execution. First, all paths of control are combined into a single path regardless

Optimal And Near-Optimal Solutions For Hard Compilation Problems

by Ulrich Kremer , 1998
"... An optimizing compiler typically uses multiple program representations at different levels of program and performance abstractions in order to be able to perform transformations that -- at least in the majority of cases -- will lead to an overall improvement in program performance. The complexities ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
of the program and performance abstractions used to formulate compiler optimization problems have to match the complexities of the high--level programming model and of the underlying target system. Scalable parallel systems typically have multi--level memory hierarchies and are able to exploit coarse

Shared memory consistency models: A tutorial

by Sarita V. Adve, Kourosh Gharachorloo - IEEE Computer , 1996
"... Parallel systems that support the shared memory abstraction are becoming widely accepted in many areas of computing. Writing correct and efficient programs for such systems requires a formal specification of memory semantics, called a memory consistency model. The most intuitive model—sequential con ..."
Abstract - Cited by 441 (10 self) - Add to MetaCart
—sequential consistency—greatly restricts the use of many performance optimizations commonly used by uniprocessor hardware and compiler designers, thereby reducing the benefit of using a multiprocessor. To alleviate this problem, many current multiprocessors support more relaxed consistency models. Unfortunately

The DaCapo Benchmarks: Java Benchmarking Development and Analysis

by Stephen M Blackburn, Robin Garner , Chris Hoffmann , Asjad M Khan , Kathryn S Mckinley , Rotem Bentzur , Amer Diwan , Daniel Feinberg , Daniel Frampton , Samuel Z Guyer , Martin Hirzel , Antony Hosking , Maria Jump , Han Lee , J Eliot B Moss, Aashish Phansalkar , Darko Stefanović , Thomas Vandrunen , Daniel Von Dincklage , Ben Wiedermann
"... Since benchmarks drive computer science research and industry product development, which ones we use and how we evaluate them are key questions for the community. Despite complex runtime tradeoffs due to dynamic compilation and garbage collection required for Java programs, many evaluations still us ..."
Abstract - Cited by 397 (65 self) - Add to MetaCart
Since benchmarks drive computer science research and industry product development, which ones we use and how we evaluate them are key questions for the community. Despite complex runtime tradeoffs due to dynamic compilation and garbage collection required for Java programs, many evaluations still

Extending and Implementing the Stable Model Semantics

by Patrik Simons, Ilkka Niemelä, Timo Soininen , 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract - Cited by 396 (9 self) - Add to MetaCart
and functions and compiles general weight constraint rules to basic constraint rules. A major part of the work is the development of an ecient search procedure for computing stable models for this kernel language. The procedure is compared with and empirically tested against satis ability checkers
Results 1 - 10 of 6,510