Artifact for "SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-based, and SAT Techniques"

doi:10.5281/zenodo.10801691

Published March 10, 2024 | Version v1

Software Open

Artifact for "SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-based, and SAT Techniques"

1. Universidad Complutense de Madrid
2. Monash University

This artifact includes the necessary data to reproduce the experiments in the paper "SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-based, and SAT Techniques," accepted in PLDI'24.

Files

pldi2024-superstack.zip

Files (558.3 MB)

Name	Size	Download all
pldi2024-superstack.zip md5:9610f6676a2e3b3fec7ddc8eb96519cc	558.3 MB	Preview Download
README.md md5:b863d34ea227ebe930c7ddd97a469b66	22.6 kB	Preview Download

117

Views

Downloads

Show more details

	All versions	This version
Views	117	117
Downloads	45	45
Data volume	9.5 GB	9.5 GB

More info on how stats are collected....

DOI

Resource type

Software

Publisher

Zenodo

GNU Lesser General Public License v3.0 or later

Permissions of this copyleft license are conditioned on making available complete source code of licensed works and modifications under the same license or the GNU GPLv3. Copyright and license notices must be preserved. Contributors provide an express grant of patent rights. However, a larger work using the licensed work through interfaces provided by the licensed work may be distributed under different terms and without source code for the larger work. Read more

Technical metadata

Created: March 12, 2024
Modified: April 29, 2024

Artifact for "SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-based, and SAT Techniques"

Creators

Description

Files

pldi2024-superstack.zip

Files (558.3 MB)