Filters








141,580 Hits in 3.0 sec

Compiler generation from relational semantics [chapter]

Mads Dam, Frank Jensen
1986 Lecture Notes in Computer Science  
We consider the problem of automatically deriving correct compilers from relational semantic specifications of programming languages.  ...  A relational semantics is an assignment of initial-state final-state relations (defined by means of proof rules) to programs. Compilers are generated in three steps.  ...  Thus a compiler for Prolog may be considered a universal compiler for relational semantics.  ... 
doi:10.1007/3-540-16442-1_1 fatcat:f5eypvlb5jdwpexmplyjzw7jge

An Executable Semantics for CompCert C [chapter]

Brian Campbell
2012 Lecture Notes in Computer Science  
The correctness theorem is defined in terms of a semantics for the 'CompCert C' language, but how can we gain faith in those semantics?  ...  CompCert is a C compiler developed by Leroy et al, the majority of which is formalised and verified in the Coq proof assistant.  ...  using that failure in the semantics we were able to derive a test case that also failed in the compiler.  ... 
doi:10.1007/978-3-642-35308-6_8 fatcat:r6l4dnwzofgcrmjqk6gwgax4dy

Toward optimized code generation through model-based optimization

Asma Charfi, Chokri Mraidha, Sebastien Gerard, Franois Terrier, Pierre Boulet
2010 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)  
Although automatic code generation and the use of optimizing compilers bring some answers to application optimization issue, we will show in this paper that optimization results may be enhanced by adding  ...  The well-known Gnu Compiler Collection (GCC) is used for this study.  ...  related to modeling language semantics.  ... 
doi:10.1109/date.2010.5457010 dblp:conf/date/CharfiMGTB10 fatcat:fi6jgds2q5dgpkzpw7fkwcti5y

Neural Program Repair with Execution-based Backpropagation [article]

He Ye, Matias Martinez, Martin Monperrus
2021 arXiv   pre-print
Yet, they have the limitation of generating low-quality patches(e.g., not compilable patches).  ...  The core novelty of RewardRepair is to improve NMT-based program repair with a loss function based on program compilation and test execution information, rewarding the network to produce patches that compile  ...  Notably, the unique bugs that benefit from semantic training come from different projects, showing that adding semantic training is beneficial in general.  ... 
arXiv:2105.04123v1 fatcat:fbvylcfwgra7lnrv55iojum654

Does Code Generation Promote or Prevent Optimizations?

Asma Charfi, Chokri Mraidha, Sébastien Gérard, François Terrier, Pierre Boulet
2010 2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing  
Such systems are designed using Model-Based Development (MBD) approach that consists of performing three major steps: building models, generating code from them and compiling the generated code.  ...  Actually, during the code generation, an important part of the modeling language semantics which could be useful for optimization is lost, thus, making impossible some optimizations achievement.  ...  related to the modeling language semantics.  ... 
doi:10.1109/isorc.2010.25 dblp:conf/isorc/CharfiMGTB10 fatcat:gk7eb3btjrgsfod24dwkavq3oa

Separation of concerns in compiler development using aspect-orientation

Xiaoqing Wu, Barrett R. Bryant, Jeff Gray, Suman Roychoudhury, Marjan Mernik
2006 Proceedings of the 2006 ACM symposium on Applied computing - SAC '06  
The ideas utilized in this paper can also be generalized to other software systems with a tree-like structure.  ...  A major difficulty in compiler development regards the proper modularization of concerns among the various compiler phases.  ...  The compiler can determine which class each field/method comes from in a relation definition and generate the Java code.  ... 
doi:10.1145/1141277.1141646 dblp:conf/sac/WuBGRM06 fatcat:ioucgeer5jghldzetqu7xkmsqi

Provably correct compiler development and implementation [chapter]

Bettina Buth, Karl-Heinz Buth, Martin Fränzle, Burghard Karger, Yassine Lakhneche, Hans Langmaack, Markus Müller-Olm
1992 Lecture Notes in Computer Science  
The first covers semantical correctness of the code to be generated, whereas the second concerns correctness of the compiler program with respect to the specification.  ...  The classical technique of bootstrapping compilers is revisited with respect to implementation correctness.  ...  In general, a representation relation is a relation which has a surjective function as its converse.  ... 
doi:10.1007/3-540-55984-1_14 fatcat:2uxcim2kjbb6tjbqz4jfqeuaqu

Towards a verified compiler prototype for the synchronous language SIGNAL

Zhibin Yang, Jean-Paul Bodeveix, Mamoun Filali, Kai Hu, Yongwang Zhao, Dianfu Ma
2015 Frontiers of Computer Science  
The front-end of the compiler, i.e. the translation from SIGNAL to S-CGA is presented. As well, the proof of semantics preservation is mechanized in the theorem prover Coq.  ...  Moreover, we present the back-end of the compiler, including sequential code generation and multi-threaded code generation with time-predictable properties.  ...  Related Work We discuss in this section some related work about two aspects: verification of the SIGNAL compilation (mainly focuses on sequential code generation) and multi-threaded code generation from  ... 
doi:10.1007/s11704-015-4364-y fatcat:7x6wchqztrfmpassc3ip7eres4

A Certifying Code Generation Phase

Jan Olaf Blech, Arnd Poetzsch-Heffter
2007 Electronical Notes in Theoretical Computer Science  
One way to achieve trusted compilation is certifying compilation. A certifying compiler generates for each run a proof that it has performed the compilation run correctly.  ...  Guaranteeing correctness of compilation is a vital precondition for correct software. Code generation can be one of the most error-prone tasks in a compiler.  ...  They have to meet the requirements of the simulation relation from Section 2.3. • We have to prove that the initial states of both programs are in the simulation relation.  ... 
doi:10.1016/j.entcs.2007.09.008 fatcat:nlupz6t4zvdqtouwp23l2m72wq

An automatically generated, realistic compiler for imperative programming language

U. F. Pleban, P. Lee
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
cs.net We describe the automatic generation of a complete, realistic compiler from formal specifications of the syntax and semantics of Sol/C, a nontrivial imperative language "sort of like C."  ...  The compiler exhibits a three pass structure, is efficient, and produces object programs whose performance characteristics compare favorably with those produced by commercially available compilers.  ...  The semantics analyzer generates the compiler core (CC), written in SCHEME, from the semantics. The resulting compilers consist of three passes.  ... 
doi:10.1145/53990.54012 dblp:conf/pldi/PlebanL88 fatcat:2fovtyfwjzcpna5vsywzjwd2qq

BinGold: Towards robust binary analysis by extracting the semantics of binary code as semantic flow graphs (SFGs)

Saed Alrabaee, Lingyu Wang, Mourad Debbabi
2016 Digital Investigation. The International Journal of Digital Forensics and Incident Response  
Our technique allows more robust binary analysis because the extracted semantics of the binary code is generally immune from light obfuscation, refactoring, and varying the compilers or compilation settings  ...  Subsequently, various properties, such as reflexive, symmetric, antisymmetric, and transitive relations, are extracted from the SFG and applied to binary analysis.  ...  We generalize equivalence relations and equivalence classes, where an equivalence relation on a set of features (semantics features) F is a relation R3FxF such that: ðf i ; f j Þ εR for all f εF, which  ... 
doi:10.1016/j.diin.2016.04.002 fatcat:azrdejat4rcalgi5kx4h2frhay

Modeling Instruction Semantics in ADL Processor Descriptions for C Compiler Retargeting

Jianjiang Ceng, Weihua Sheng, Manuel Hohenauer, Rainer Leupers, Gerd Ascheid, Heinrich Meyr, Gunnar Braun
2006 Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology  
compiler, assembler, linker, and instruction-set simulator, can be automatically generated.  ...  However, the generation of C compilers requires high-level architecture information rather than low-level details needed by simulator generation.  ...  Furthermore, although the major motivation of the SEMANTICS section is to enable the automatic compiler generation, the use of the section itself should not require too much compiler knowledge from user  ... 
doi:10.1007/s11265-006-7273-3 fatcat:2vj3liwr6ba6np57yccalei4ju

Modeling Instruction Semantics in ADL Processor Descriptions for C Compiler Retargeting [chapter]

Jianjiang Ceng, Weihua Sheng, Manuel Hohenauer, Rainer Leupers, Gerd Ascheid, Heinrich Meyr, Gunnar Braun
2004 Lecture Notes in Computer Science  
compiler, assembler, linker, and instruction-set simulator, can be automatically generated.  ...  However, the generation of C compilers requires high-level architecture information rather than low-level details needed by simulator generation.  ...  Furthermore, although the major motivation of the SEMANTICS section is to enable the automatic compiler generation, the use of the section itself should not require too much compiler knowledge from user  ... 
doi:10.1007/978-3-540-27776-7_48 fatcat:lmvtrui7czddvcnrxsa5fl7iaq

A realistic compiler generator based on high-level semantics: another progress report

P. Lee, U. Pleban
1987 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87  
This paper describer the compiler generator MESS, which embodies the principles of high-level semantics. MESS has been used to generate compilers for nontrivial languages.  ...  The compilers are efficient, and produce object programs that are competitive with those generated by hand-written compilers.  ...  To verify the feasibility of our ideas, we have implemented a semantics directed compiler generator called MESS which automatically derives compiler implementations from high-level semantic descriptions  ... 
doi:10.1145/41625.41651 dblp:conf/popl/LeeP87 fatcat:4b47dlkej5e6dovgpftv7gs5um

Towards Acceptability of Optimizations

Wolfgang Goerigk
2002 Electronical Notes in Theoretical Computer Science  
Unacceptable error outcomes can semantically model pre-conditions such as well-formedness conditions for compilers or optimization pre-conditions for user programs.  ...  programs and their implementations in the same uniform relational setting.  ...  (which relates the compiler source program to the compiler machine program semantics).  ... 
doi:10.1016/s1571-0661(04)80399-2 fatcat:vsdrxqjcyjeoxjyalxm2kyc4eu
« Previous Showing results 1 — 15 out of 141,580 results