Filters








199 Hits in 5.8 sec

A Program Result Checker for the Lexical Analysis of the GNU C Compiler

Sabine Glesner, Simone Forster, Matthias Jäger
2005 Electronical Notes in Theoretical Computer Science  
We show that the lexical analysis of the GNU C compiler can be formally specified and checked within the theorem prover Isabelle/HOL utilizing program checking.  ...  Such a proof is necessary to establish result checking as the method of choice to implement compilers correctly.  ...  Acknowledgments: Thanks to Jan Olaf Blech for many helpful discussions. Also thanks to the anonymous reviewers for their supportive comments.  ... 
doi:10.1016/j.entcs.2005.01.029 fatcat:7y4w2pwhjnaijcq4empa5mmiqe

Applications of the Asf+Sdf Meta-Environment [chapter]

M. G. J. van den Brand
2006 Lecture Notes in Computer Science  
Over the years, this system has been used in a variety of academic and industrial projects ranging from formal program manipulation to conversion of industrial Cobol systems.  ...  The Meta-Environment has been applied in various projects in order to enable the development of high quality tools for the analysis and transformation of large software systems written in languages such  ...  Acknowledgements I would like to thank all current and former members of the Generic Language Technology group at CWI for making the Meta-Environment work.  ... 
doi:10.1007/11877028_9 fatcat:itdojufahncdtprbn7sm5gxtwi

Xoc, an extension-oriented compiler for systems programming

Russ Cox, Tom Bergan, Austin T. Clements, Frans Kaashoek, Eddie Kohler
2008 Proceedings of the 13th international conference on Architectural support for programming languages and operating systems - ASPLOS XIII  
Xoc programmers concisely define powerful compiler extensions that, by construction, can be combined; even some parts of the base compiler, such as GNU C compatibility, are structured as extensions.  ...  Lazy computation of attributes allows extension writers to use the results of analyses by other extensions or the core without needing to worry about pass scheduling.  ...  Acknowledgments Todd Millstein provided much useful advice on the design of xoc. Robert Grimm provided advice on using xtc. The anonymous reviewers gave valuable feedback on an earlier draft.  ... 
doi:10.1145/1346281.1346312 dblp:conf/asplos/CoxBCKK08 fatcat:pn3odayu6zaqlcnim7ilpycckm

Xoc, an extension-oriented compiler for systems programming

Russ Cox, Tom Bergan, Austin T. Clements, Frans Kaashoek, Eddie Kohler
2008 ACM SIGOPS Operating Systems Review  
Xoc programmers concisely define powerful compiler extensions that, by construction, can be combined; even some parts of the base compiler, such as GNU C compatibility, are structured as extensions.  ...  Lazy computation of attributes allows extension writers to use the results of analyses by other extensions or the core without needing to worry about pass scheduling.  ...  Acknowledgments Todd Millstein provided much useful advice on the design of xoc. Robert Grimm provided advice on using xtc. The anonymous reviewers gave valuable feedback on an earlier draft.  ... 
doi:10.1145/1353535.1346312 fatcat:mzk3osz4ivbazal6o2jicn6rjy

Xoc, an extension-oriented compiler for systems programming

Russ Cox, Tom Bergan, Austin T. Clements, Frans Kaashoek, Eddie Kohler
2008 SIGPLAN notices  
Xoc programmers concisely define powerful compiler extensions that, by construction, can be combined; even some parts of the base compiler, such as GNU C compatibility, are structured as extensions.  ...  Lazy computation of attributes allows extension writers to use the results of analyses by other extensions or the core without needing to worry about pass scheduling.  ...  Acknowledgments Todd Millstein provided much useful advice on the design of xoc. Robert Grimm provided advice on using xtc. The anonymous reviewers gave valuable feedback on an earlier draft.  ... 
doi:10.1145/1353536.1346312 fatcat:ujrl7jxihnfxddpdos7dql6xdq

Xoc, an extension-oriented compiler for systems programming

Russ Cox, Tom Bergan, Austin T. Clements, Frans Kaashoek, Eddie Kohler
2008 SIGARCH Computer Architecture News  
Xoc programmers concisely define powerful compiler extensions that, by construction, can be combined; even some parts of the base compiler, such as GNU C compatibility, are structured as extensions.  ...  Lazy computation of attributes allows extension writers to use the results of analyses by other extensions or the core without needing to worry about pass scheduling.  ...  Acknowledgments Todd Millstein provided much useful advice on the design of xoc. Robert Grimm provided advice on using xtc. The anonymous reviewers gave valuable feedback on an earlier draft.  ... 
doi:10.1145/1353534.1346312 fatcat:hnezii322nbdtchxcxvvilajke

Towards Vulnerability Discovery Using Staged Program Analysis [article]

Bhargava Shastry, Fabian Yamaguchi, Konrad Rieck, Jean-Pierre Seifert
2016 arXiv   pre-print
Static analysis is a promising approach for discovering vulnerabilities since it can provide developers early feedback on the code they write.  ...  Based on the intuition that real-world vulnerabilities manifest themselves across multiple parts of a program, Melange performs both local and global analyses.  ...  Authors would like to thank colleagues at SecT and Daniel Defreez for valuable feedback on a draft of this paper, and Janis Danisevskis for discussions on the C++ standard and occasional code reviews.  ... 
arXiv:1508.04627v2 fatcat:v353f43rvvfk7eaowkyhztdyjm

A DSL for Resource Checking Using Finite State Automaton-Driven Symbolic Execution

Endre Fülöp, Norbert Pataki
2020 Open Computer Science  
Clang Static Analyzer is a powerful symbolic execution engine based on the Clang compiler infrastructure that can be used with C, C++ and Objective-C.  ...  We have developed a tool for this approach which parses the automaton and generates Clang Static Analyzer checker that can be used in the symbolic execution engine.  ...  The work by Starynkevitch provides a generic DSL called Melt, which provides access to the internal data structures of the GNU C Compiler (GCC).  ... 
doi:10.1515/comp-2020-0120 fatcat:lt5v23t675fe5psc7gjbfxvpje

Model Checking C++ with Exceptions

Petr Ročkai, Jiří Barnat, Luboš Brim
2014 Electronic Communications of the EASST  
This constitutes an important step towards support of both the full C++ specification and towards verification of real-world C++ programs using a software model checker.  ...  The extension consists of two parts, a language-neutral implementation of the LLVM exception-handling instructions, and an adaptation of the C++ runtime for the DIVINE/LLVM exception model.  ...  In C++, this action is userspecified, and defaults to terminating the program. The GNU compilers ship with libstdc++, which contains, as a subproject a runtime support library libsupc++.  ... 
doi:10.14279/tuj.eceasst.70.983 dblp:journals/eceasst/RockaiBB14 fatcat:2oeh3fbjq5ghpbgnk6clnxxque

Oasis: An Optimizing Action-based Compiler Generator

Peter Ørbæk
1994 DAIMI Report Series  
In this paper we present several analyses of actions, and apply them in a compiler generator capable of generating efficient, optimizing compilers for procedural and functional languages with higher order  ...  Action Semantics is a new and interesting foundation for semantics based compiler generation.  ...  Mosses for encouragements and guidance in the preparation of the article. I also want to thank Ole L. Madsen for reading a draft of the paper.  ... 
doi:10.7146/dpb.v13i471.6944 fatcat:g6wwanpyevhgjodggom6f5edpi

OASIS: An optimizing action-based compiler generator [chapter]

Peter Ørbæk
1994 Lecture Notes in Computer Science  
In this paper we present several analyses of actions, and apply them in a compiler generator capable of generating efficient, optimizing compilers for procedural and functional languages with higher order  ...  Action Semantics is a new and interesting foundation for semantics based compiler generation.  ...  Mosses for encouragements and guidance in the preparation of the article. I also want to thank Ole L. Madsen for reading a draft of the paper.  ... 
doi:10.1007/3-540-57877-3_1 fatcat:ccirr4ght5b4ddjsds2l6lufki

Watch Your Spelling!

Kurt Hornik, Duncan Murdoch
2011 The R Journal  
We analyze the results of spell checking all Rd files in all CRAN packages and show how these can be employed for building such a dictionary.  ...  We discuss the facilities in base R for spell checking via Aspell, Hunspell or Ispell, which are useful in particular for conveniently checking the spelling of natural language texts in package Rd files  ...  Aspell is the standard spell checker for the GNU software system, with packages available for all common Linux distributions.  ... 
doi:10.32614/rj-2011-014 fatcat:uz2j647lprhbxmceeou4hlltqm

The architecture of Montana

Michael Karasick
1998 Software engineering notes  
Montana is an open, extensible integrated programming environment for C++ that supports incremental compilation and linking, a persistent code cache called a CodeStore, and a set of programming interfaces  ...  CodeStore serves as a central source of information for compiling, browsing, and debugging. CodeStore contains information about both the static and dynamic structure of the compiled program.  ...  Consequently, the GNU compiler servers more as a research vehicle than the basis of any standardized tool suite. Ensemble [2] is a vendor-neutral tool for analyzing C programs.  ... 
doi:10.1145/291252.288284 fatcat:i26p6q4aijclzmvuxmm3rscmvi

A framework for the static verification of api calls

Diomidis Spinellis, Panagiotis Louridas
2007 Journal of Systems and Software  
A number of tools can statically check program code to identify commonly encountered bug patterns.  ...  At the same time, programs are increasingly relying on external APIs for performing the bulk of their work: the bug-prone program logic is being fleshed-out, and many errors involve tricky subroutine calls  ...  Acknowledgments We would like to thank the authors of FindBugs for the work they put into the platform, and in particular Dave Brosius for his help in integrating our type-inference patches that made it  ... 
doi:10.1016/j.jss.2006.09.040 fatcat:ajyieh67jfa3tet6o62jpmc63e

An empirical evaluation of Lex/Yacc and ANTLR parser generation tools

Francisco Ortin, Jose Quiroga, Oscar Rodriguez-Prieto, Miguel Garcia, Sergio Consoli
2022 PLoS ONE  
Under the context of the academic study conducted, ANTLR has shown significant differences for most of the empirical features measured.  ...  Two random groups of students implement the same language using a different parser generator, and we statistically compare their performance with different measures.  ...  The process of recognizing the terminal symbols, also called tokens, from a sequence of characters is called lexical analysis [2] . Lexical analyzers are commonly called lexers or scanners.  ... 
doi:10.1371/journal.pone.0264326 pmid:35239695 pmcid:PMC8893623 fatcat:bsdh56avsbeadj5vafbrijub6u
« Previous Showing results 1 — 15 out of 199 results