Type-safe modular parsing

Zhang, Haoyuan; Li, Huang; Oliveira, Bruno C. d. S.

doi:10.1145/3136014.3136016

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lattributed grammars [13] were motivated by their support for one-pass translation; in the Parsley context, they are also compatible with the backtracking requirements of PEG combinators. We are considering the approach to modularity in [14] in our design of the Parsley module system.…”

Section: Related Workmentioning

confidence: 99%

Research Report: The Parsley Data Format Definition Language

Mundkur

Briesemeister

Shankar

et al. 2020

2020 IEEE Security and Privacy Workshops (SPW)

View full text Add to dashboard Cite

Any program that reads formatted input relies on parsing software to check the input for validity and transform it into a representation suitable for further processing. Many security vulnerabilities can be attributed to poorly defined grammars, incorrect parsing, and sloppy input validation. In contrast to programming languages, grammars for even common data formats such as ELF and PDF are typically context-sensitive and heterogenous. However, as in programming languages, a standard notation or language to express these data format grammars can address poor or ambiguous definitions, and the automated generation of correct-byconstruction parsers from such grammar specifications can yield correct and type-and memory-safe data parsing routines. We present our ongoing work on developing such a data format description language. Parsley is a declarative data format definition language that combines grammars and constraints in a modular way. We show how it can be used to capture data formats such as MAVLink, PDF and ELF. We briefly describe the processing pipeline we are designing to generate verified parsers from these specifications. 300 2020 Symposium on Security and Privacy Workshops (SPW)

show abstract

Section: Related Workmentioning

confidence: 99%

Research Report: The Parsley Data Format Definition Language

Mundkur

Briesemeister

Shankar

et al. 2020

2020 IEEE Security and Privacy Workshops (SPW)

View full text Add to dashboard Cite

show abstract

“…Object Algebras Using object algebras [7] to solve EP has become popular over recent years [16,18,20,30,31]. An often neglected factor about solutions to EP is the complexity of term creation.…”

Section: Related Workmentioning

confidence: 99%

Instructed late binding

Haeri

Keir

2019

Proceedings of the 23rd Pan-Hellenic Conference on Informatics

View full text Add to dashboard Cite

Integration of a decentralised pattern matching is a technique that enables a recent solution to the Expression Problem. The single former implementation of this technique was in Scala. In this paper, we highlight the C++ implementation of the same technique to solve the Expression Problem in C++. Unlike the former implementation which relies on stackability of Scala traits, this new implementation relies on compile-time metaprogramming for automatic iterative pointer introspection at runtime. That iteration enables late binding using overload resolution, which the compiler is already capable of. The C++ implementation outperforms the Scala one by providing strong static type safety and offering considerably easier usage.

show abstract

Modular Educational Languages

Hoobergs

2023

Companion Proceedings of the 2023 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: So

View full text Add to dashboard Cite

Type-safe modular parsing

Cited by 3 publications

References 21 publications

Research Report: The Parsley Data Format Definition Language

Research Report: The Parsley Data Format Definition Language

Instructed late binding

Modular Educational Languages

Contact Info

Product

Resources

About