Pith. sign in

REVIEW 1 cited by

Using LLVM-based JIT Compilation in Genetic Programming

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1701.05730 v1 pith:LRHIBTCO submitted 2017-01-20 cs.NE

Michal Gregor , Juraj Spalek This is my paper · ORCID
classification cs.NE
keywords treesapproachexecutiongeneticprogrammingsyntaxabstractbisonc
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a parser (based on FlexC++ and BisonC++) that can construct the trees from a simple toy language with C-like syntax. The approach is compared with a previous implementation (based on direct execution of trees using polymorphic functors) in terms of execution speed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OpenMLDB: A Real-Time Relational Data Feature Computation System for Online ML

    cs.DB 2025-01 conditional novelty 4.0 of 10

    OpenMLDB unifies offline and online feature computation with one SQL compiler plus specialized window and join optimizations, reporting large latency and memory gains over Spark, Flink, DuckDB, and Redis/Trino pipelines.

Pith tools