A Formalization of the ABNF Notation and a Verified Parser of ABNF Grammars

Coglio, Alessandro

doi:10.1007/978-3-030-03592-1_10

Cited by 4 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Performance has been tested on a verified ABNF grammar parser [4] [19, abnf::abnf]. The parser takes as input a list of natural numbers, checks whether they are ASCII codes that form a grammar in the ABNF notation, and returns as output a concrete syntax tree for the parsed grammar (if parsing succeeds; otherwise it returns nil).…”

Section: Performance Of the Generated Codementioning

confidence: 99%

A Complex Java Code Generator for ACL2 Based on a Shallow Embedding of ACL2 in Java

Coglio

2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

This paper describes a code generator that translates ACL2 constructs to corresponding Java constructs, according to a shallow embedding of ACL2 in Java. Starting from purely functional ACL2 code, the generated Java code exhibits imperative and object-oriented features like destructive updates, loops, and overloading. The overall translation from ACL2 to Java is fairly elaborate, consisting of several ACL2-to-ACL2 pre-translation steps, an ACL2-to-Java proper translation step, and several Java-to-Java post-translation steps. Experiments suggest that the generated Java code is not much slower than the ACL2 code. The code generator can also recognize, and translate to Java, ACL2 representations of certain Java constructs, forerunning a code generation approach based on a shallow embedding of Java in ACL2 (i.e. going the other way). This code generator builds upon, and significantly extends, a simple Java code generator for ACL2 based on a deep embedding of ACL2 in Java.

show abstract

Section: Performance Of the Generated Codementioning

confidence: 99%

A Complex Java Code Generator for ACL2 Based on a Shallow Embedding of ACL2 in Java

Coglio

2022

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Constant is a wrapper of Value. 5 FunctionApplication stores a Function and an array of zero or more Terms. LambdaExpression stores an array of zero or more Variables and a Term.…”

Section: Termsmentioning

confidence: 99%

“…Each primitive function except if, whose calls are evaluated non-strictly as described in Section 3. 5 Primitive has no fields and only the above static methods; no instances of this class are created.…”

Section: Primitive Functionsmentioning

confidence: 99%

“…The second is an ACL2 function that computes Fibonacci non-tail-recursively. The third is a slightly modified version of the verified ABNF grammar parser [5] from the ACL2 Community Books [2, :doc abnf::grammar-parser]: the parser, in the :logic part of mbe, calls nat-list-fix on its input list of natural numbers just before reading each natural number, which makes execution "in the logic" (which is how AIJ executes) unduly slow; for testing AIJ more realistically, the parser was tweaked to avoid these calls of nat-list-fix. The tweaked parser is about 2,000 lines (including blank lines), including theorems to prove its termination so that it is in logic mode, and including return type theorems to prove its guards.…”

Section: Preliminary Tests and Optimizationsmentioning

confidence: 99%

See 1 more Smart Citation

A Simple Java Code Generator for ACL2 Based on a Deep Embedding of ACL2 in Java

Coglio

2018

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

AIJ (ACL2 In Java) is a deep embedding in Java of an executable, side-effect-free, non-stobjaccessing subset of the ACL2 language without guards. ATJ (ACL2 To Java) is a simple Java code generator that turns ACL2 functions into AIJ representations that are evaluated by the AIJ interpreter. AIJ and ATJ enable possibly verified ACL2 code to run as, and interoperate with, Java code, without much of the ACL2 framework or any of the Lisp runtime. The current speed of the resulting Java code may be adequate to some applications.

show abstract