119,851 Hits in 9.1 sec

LR(K) Parser Construction Using Bottom-up Formal Analysis

Nazir Ahmad Zafar
2012 Journal of Software Engineering and Applications  
Design and construction of an error-free compiler is a difficult and challenging process.  ...  First, we have defined grammar then language derivation procedure is given using right-most derivations. Verification of a given language is done by recursive procedures based on the words.  ...  The design and construction of a fully verified compiler will remain a challenge of twenty first century.  ... 
doi:10.4236/jsea.2012.51004 fatcat:aorg2nmmk5hehj3kvt5accjatu

An Automatically Generated and Provably Correct Compiler for a Subset of Ada

Jens Palsberg
1992 DAIMI Report Series  
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada.  ...  The compiler is generated from an action semantic description; it emits absolute code for an abstract RISC machine language that currently is assembled into code for the SPARC and the HP Precision Architecture  ...  The author thanks Peter Mosses and Michael Schwartzbach for helpful comments on a draft of the paper. The author also thanks Peter Ørbaek for implementing the Cantor system.  ... 
doi:10.7146/dpb.v21i383.6615 fatcat:iohdrj7xqrhn3d7oylu2455f2e

An Analysis of Approximate Knowledge Compilation

Alvaro del Val
1995 International Joint Conference on Artificial Intelligence  
language closed under subsumption (including a wide family of languages which guarantee polynomial size approximations); and generalize the procedure to arbitrary target languages.  ...  We provide general characterizations of the LUB that are independent of the target language; analyze the properties of the Generate-LUB algorithm of Selman and Kautz, proving its correctness for any target  ...  We thus improve and correct Selman and Kautz's analysis of their general framework for knowledge compilation, greatly expanding the set of target languages for which the generic Generate-LUB algorithm  ... 
dblp:conf/ijcai/Val95 fatcat:3522z3sjprdylhxuga7oyn4oki

Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation

Benjamin Mood, Debayan Gupta, Henry Carter, Kevin Butler, Patrick Traynor
2016 2016 IEEE European Symposium on Security and Privacy (EuroS&P)  
To ensure correctness we apply best practices for compiler design and development, including the use of standard data structures, helpful negative results, and structured validation testing.  ...  This produces a compiler that builds correct circuits, is efficient and extensible.  ...  We have tested (1) the correctness of each mini-circuit an operator uses, (2) all the ways in which data can populate each operator, (3) the base and nested rule for each construct (if statements, for  ... 
doi:10.1109/eurosp.2016.20 dblp:conf/eurosp/MoodGCBT16 fatcat:4ofotbxrpfa6vl2p7z2liyger4

Testing student-made compilers

José de Oliveira Guimarães
1994 ACM SIGCSE Bulletin  
Resumo This article presents a few guidelines and examples for testing Pascal compilers designed by students in introductory courses.  ...  A standard Pascal subset with little alteration is used, and the possible sources of errors are divided into eight categories. Examples and probable sources of error are exposed for each category.  ...  We are thankful to José Carlos Maldonado for the revision of this article and for the suggestions presented.  ... 
doi:10.1145/187387.187402 fatcat:qozftqaljbbovlpt6t54pqs6y4

A piggy-back compiler for Prolog

J. L. Weiner, S. Ramakrishman
1988 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88  
In contraat, for ail practical purposes, the back-elld for our compiler (a C language compiler) already exists for most machines (satisfying our goal of portability).  ...  Freeze is a procedure (coded in assembly language) that takes as its arguments the name of a procedure, the number of its arguments, and its continuation pointer, followed by a list of the arguments, and  ... 
doi:10.1145/53990.54019 dblp:conf/pldi/WeinerR88 fatcat:nbfmvenitvgyzmi7dpyqv2dfyq

Early Experiences with Euclid

David B. Wortman, James R. Cordy
1981 International Conference on Software Engineering  
The programming language Euclid was designed to be used for the construction of reliable and efficient systems software.  ...  This paper discusses the authors' experience in the design and implementation of the first large (about 60,000 source lines) piece of software written in Euclid.  ...  It extends Pascal by providing language features to aid in the construction of verifiable systems software. A summary of Euclid and a rationale for its design is presented in .  ... 
dblp:conf/icse/WortmanC81 fatcat:6tpm7ktqdvcbliy62y3hb4u3kq

Second Language Acquisition as a Hybrid Learning Process [chapter]

Gerard Kempen
1992 Cognitive Modelling and Interactive Environments in Language Learning  
The paper presents a characterization of SLA along these lines, outlines its empirical underpinnings, and explores the implications with respect to the design of second language instruction methods and  ...  Basic phenomena in the behaviour of language learners suggest that SLA roots in two entirely different learning processes: a grammatical induction device attuned to properties of natural languages, and  ...  After all, interference from the learner's native language seems to be accountable for a non-negligible proportion of L2 errors.  ... 
doi:10.1007/978-3-642-77575-8_17 fatcat:tvmcexcrqrdmtgberda4gmg2qu

Pattern-based object-oriented parallel programming [chapter]

Steve MacDonald, Jonathan Schaeffer, Duane Szafron
1997 Lecture Notes in Computer Science  
Users are given full access to all language features and library code which can be extended for their needs. Our architecture addresses the problems of non{intrusiveness, openness, and correctness.  ...  For instance, language features such as exceptions and dynamic method binding in languages like Java and C++ cause problems for optimizing compilers 9].  ... 
doi:10.1007/3-540-63827-x_70 fatcat:iefm5tjptjcwzfwceihsuegbce

Towards a toolkit for building language implementations

Carine Fédèle, Olivier Lecarme
1992 Software, Practice & Experience  
This work relies on use of the Amsterdam Compiler Kit (ACK) to ensure a full set of optimizers and code generators based on a semi-universal intermediate language, and, therefore, emphasizes the filling  ...  of the gap between parsing and the intermediate language.  ...  They are used for: (a) generating external procedure declarations for all first-level procedures of a Pascal module (b) generating a 'makefile' for building at will the various parts of the generated compiler  ... 
doi:10.1002/spe.4380221102 fatcat:3jg5mnjrjfb27dsascnfb6umti

The importance of implementation models in ALGOL 68

Daniel M. Berry
1970 SIGPLAN notices  
The need for implementation models in understanding languages, Algol 68 in particular , is stressed . The model is used to demonstrate the new concept of necessary environmen t of a procedure .  ...  A clear understanding of blocks, procedures, and the non-local and paramete r mechanisms was best obtained from a conceptual model for its ru n time dynamics .  ...  To regain correctness of implementation a modification in the definition of the e p of a procedure value is needed .  ... 
doi:10.1145/987429.987432 fatcat:z34e5eg4wfbpbmdqsaq2eeaw6q

Design and implementation of an African native language-based programming language

Ezekiel Kolawole Olatunji, John. B. Oladosu, Odetunji A. Odejobi, Stephen O. Olabiyisi
2021 International Journal of Advances in Applied Sciences  
A prototype implementation of the programming language was carried out as a source-to-source, 5-pass compiler. QBasic within QB64 IDE was the implementation language.  ...  The results from implementation showed functional correctness and effectiveness of the developed programming language.  ...  ACKNOWLEDGEMENTS The authors are grateful to their families for their support and encouragement. The editors and reviewers are also gratefully acknowledged.  ... 
doi:10.11591/ijaas.v10.i2.pp171-177 fatcat:grwl5ioztjb7jlfempohjtzdoi

The Persistent Abstract Machine [chapter]

R. Connor, A. Brown, R. Carrick, A. Dearle, R. Morrison
1990 Persistent Object Systems  
This allows the implementation of first class procedures and modules in programming languages with the minimum of effort.  ...  The heap based storage mechanism of the Persistent Abstract Machine is designed to support the block retention nature of the Napier language.  ...  For example, the development of the Napier system necessitated the design of reusable compiler componentry [4] , an intermediate language [5] , an abstract machine [6] and a persistent object store  ... 
doi:10.1007/978-1-4471-3173-1_24 fatcat:hbwo6hdw25hmregcnysivsdeoi

Multiple evaluators in an extensible programming system

Ben Wegbreit
1972 Proceedings of the December 5-7, 1972, fall joint computer conference, part II on - AFIPS '72 (Fall, part II)  
One wants a complete programming system with an interpreter, a fully compatible compiler, a source level optimizer, and facilities for proving properties of programs.  ...  Compiling an extensible language where compiled code is to be freely mixed with interpreted code presents several novel problems and therefore a few unique opportunities for optimization.  ...  , subcase of #1 -non-local gotos out of one procedure into a lower access environment. (3) Check that the arguments passed to compiled procedure are compatible with the formal parameter types. (4) Check  ... 
doi:10.1145/1480083.1480118 dblp:conf/afips/Wegbreit72 fatcat:ma3nopmnfzdzxhqxsb6gsqpxfy

Translation Validation for Security Properties [article]

Matteo Busi and Pierpaolo Degano and Letterio Galletta
2019 arXiv   pre-print
Still, to the best of our knowledge, no effective procedure is available to check if a compilation chain meets such requirements.  ...  Secure compilation aims to build compilation chains that preserve security properties when translating programs from a source to a target language.  ...  Our proposal The technique TV checks the correctness of the compilation of a given program P, rather than proving the compiler correct for all inputs.  ... 
arXiv:1901.05082v1 fatcat:vt5ozaoycfdg3lfv4dgc7syzvq
« Previous Showing results 1 — 15 out of 119,851 results