SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques.
Elvira AlbertMaria Garcia de la BandaAlejandro Hernández-CerezoAlexey IgnatievAlbert RubioPeter J. StuckeyPublished in: Proc. ACM Program. Lang. (2024)
Keyphrases
- search algorithm
- greedy algorithm
- satisfiability problem
- sat solvers
- smart card
- propositional satisfiability
- locally optimal
- sat problem
- virtual machine
- search space
- dynamic programming
- source code
- boolean satisfiability
- stochastic local search algorithms
- java card
- constraint satisfaction
- sat solving
- java virtual machine
- feature selection
- sat encodings
- greedy algorithms
- sat instances
- max sat
- stochastic local search
- greedy heuristic
- np complete
- search strategies
- propositional logic
- phase transition
- search strategy
- heuristic search
- hill climbing
- programs written