Target language

AIMM 3D Models from 2D MACCS Connection Tables— Use of the GENIE Target Language to Specify Rules for Structure Building. ... 

Obviously we want to be sure that a program is entirely free of such run-time errors. So what about the approach of constructing a mathematical proof of freedom from such errors We don t need a specially written formal specification, so most of the potential problems described above (Section 4) disappear. We do need a well-defined target language, so that we have a proper formal definition of what we mean by a run-time error. 

Instruction selection The process of mapping the compiler s intermediate representation of the program into the target language produced by the compiler. 

Source-to-source translator A compiler that produces, as its target language, a programming language (rather than the native language of some target computer). 

Compiler optimization is the process by which the compiler rewrites the internal representation of a program into a form that yields a more efficient target-language program. The word optimization is a misnomer, since the compiler cannot guarantee optimality for the resulting code. In practice, optimizers apply a fixed sequence of analyses and transformations that the compiler writer believes will produce better code. 

To improve a program, the optimizer must rewrite the code (or its IR form) in a way that produces better a target language program. Before it can rewrite the code, however, the compiler must prove that the proposed transformation... 

There are atomic transformation rules, such as unfolding (which mimics the execution mechanism of the target ImguagQ), folding (which performs the reverse transformation of unfolding), universal instantiation, abstraction, predicate definition, and various (possibly conditional) rewrite rules for the target language and the lemmas of the application domain. 

The two approaches have complementary advantages and drawbacks interpretation is not as efficient as the execution of a compiled version, but the choice of a target language might obscure computational properties of proofs. 

Contracts separate a requirement into assumptions and a promise [2]. The assumptions specify the required behavior of the environment, while the promise states the expected functionality provided by the component. This separation allows to reason about the correct decomposition of requirements [4,7], which is essential for a modular safety case. The assertions themselves are described in a formal, pattern-based language, which can be translated to many target languages such as LTL or timed-automata [1] in order to enable automated verification. ... 

---