Results 1 - 10 of 755,874

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 818 (19 self) - Add to MetaCart
representation in Static Single Assignment (SSA) form, with several novel features: a simple, language-independent type-system that exposes the primitives commonly used to implement high-level language features; an instruction for typed address arithmetic; and a simple mechanism that can be used to implement

From System F to Typed Assembly Language

by Greg Morrisett, David Walker, Karl Crary, Neal Glew - ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS , 1998
"... ..."
Abstract - Cited by 647 (71 self) - Add to MetaCart
Abstract not found

Efficient and Language-Independent Mobile Programs

by Ali-Reza Adl-Tabatabai, Geoff Langdale, Steven Lucco, Robert Wahbe , 1996
"... This paper evaluates the design and implementation of Omniware: a safe, efficient, and language-independent system for executing mobile program modules. Previous approaches to implementing mobile code rely on either language semantics or abstract machine interpretation to enforce safety. In the form ..."
Abstract - Cited by 76 (0 self) - Add to MetaCart
This paper evaluates the design and implementation of Omniware: a safe, efficient, and language-independent system for executing mobile program modules. Previous approaches to implementing mobile code rely on either language semantics or abstract machine interpretation to enforce safety

ABSTRACT LLVM: A Compilation Framework for

by unknown authors
"... 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 repres ..."
Abstract - Add to MetaCart
representation in Static Single Assignment (SSA) form, with several novel features: a simple, language-independent type-system that exposes the primitives commonly used to implement high-level language features; an instruction for typed address arithmetic; and a simple mechanism that can be used to implement

Systematic design of program analysis frameworks

by Patrick Cousot, Radhia Cousot - In 6th POPL , 1979
"... Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant ..."
Abstract - Cited by 771 (52 self) - Add to MetaCart
Semantic analysis of programs is essential in optimizing compilers and program verification systems. It encompasses data flow analysis, data type determination, generation of approximate invariant

A translation approach to portable ontology specifications

by Thomas R. Gruber - KNOWLEDGE ACQUISITION , 1993
"... To support the sharing and reuse of formally represented knowledge among AI systems, it is useful to define the common vocabulary in which shared knowledge is represented. A specification of a representational vocabulary for a shared domain of discourse — definitions of classes, relations, functions ..."
Abstract - Cited by 3282 (9 self) - Add to MetaCart
to accommodate the stylistic and organizational differences among representations while preserving declarative content. Another is how to translate from a very expressive language into restricted languages, remaining system-independent while preserving the computational efficiency of implemented systems. We

A Framework for Defining Logics

by Robert Harper , Furio Honsell, Gordon Plotkin - JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY , 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lof's system of ariti ..."
Abstract - Cited by 807 (45 self) - Add to MetaCart
conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools such as proof editors and proof checkers

Term Rewriting Systems

by J. W. Klop , 1992
"... Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstra ..."
Abstract - Cited by 613 (18 self) - Add to MetaCart
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss

Computational Lambda-Calculus and Monads

by Eugenio Moggi , 1988
"... The -calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with -terms. However, if one goes further and uses fij-conversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract - Cited by 505 (7 self) - Add to MetaCart
The -calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with -terms. However, if one goes further and uses fij-conversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise

The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems

by Brian P. Gerkey, Richard T. Vaughan, Andrew Howard - In Proceedings of the 11th International Conference on Advanced Robotics , 2003
"... This paper describes the Player/Stage software tools applied to multi-robot, distributed-robot and sensor network systems. Player is a robot device server that provides network transparent robot control. Player seeks to constrain controller design as little as possible; it is device independent, non ..."
Abstract - Cited by 617 (14 self) - Add to MetaCart
This paper describes the Player/Stage software tools applied to multi-robot, distributed-robot and sensor network systems. Player is a robot device server that provides network transparent robot control. Player seeks to constrain controller design as little as possible; it is device independent
Results 1 - 10 of 755,874