Faster variational execution with transparent bytecode transformation

CP Wong, J Meinicke, L Lazarek… - Proceedings of the ACM on …, 2018 - dl.acm.org
Variational execution is a novel dynamic analysis technique for exploring highly
configurable systems and accurately tracking information flow. It is able to efficiently analyze …

Migrating gradual types

JP Campora, S Chen, M Erwig… - Proceedings of the ACM …, 2017 - dl.acm.org
Gradual typing allows programs to enjoy the benefits of both static typing and dynamic
typing. While it is often desirable to migrate a program from more dynamically-typed to more …

Variational satisfiability solving

JM Young, E Walkingshaw, T Thüm - … of the 24th ACM Conference on …, 2020 - dl.acm.org
Incremental satisfiability (SAT) solving is an extension of classic SAT solving that allows
users to efficiently solve a set of related SAT problems by identifying and exploiting shared …

Variational lists: Comparisons and design guidelines

K Smeltzer, M Erwig - Proceedings of the 8th ACM SIGPLAN …, 2017 - dl.acm.org
Variation is widespread in software artifacts (data and programs) and in some cases, such
as software product lines, is widely studied. In order to analyze, transform, or otherwise …

Should Variation Be Encoded Explicitly in Databases?

P Ataei, Q Li, E Walkingshaw - Proceedings of the 15th International …, 2021 - dl.acm.org
Variation occurs in databases in many different forms and contexts. For example, a single
database schema evolves over time, data from different sources may be combined, and the …

[PDF][PDF] Beyond configurable systems: Applying variational execution to tackle large search spaces

CP Wong - 2021 - reports-archive.adm.cs.cmu.edu
Variations are ubiquitous in software. Some variations are intentionally introduced, eg, to
provide extra functionalities or tweak certain program behavior, while some variations are …

Variational satisfiability solving: efficiently solving lots of related SAT problems

JM Young, PM Bittner, E Walkingshaw… - Empirical Software …, 2023 - Springer
Incremental satisfiability (SAT) solving is an extension of classic SAT solving that enables
solving a set of related SAT problems by identifying and exploiting shared terms. However …

[PDF][PDF] Variational debugging: understandig differences among executions.

J Meinicke - 2019 - cs.cmu.edu
Interactions among multiple program inputs or options can lead to undesired or wrong
behavior, such as system crashes and security vulnerabilities. This is especially challenging …

Formal Verification of the Variational Database Management System

F Khan - 2021 - ir.library.oregonstate.edu
Variation in data is abundant and ubiquitous in real-world applications. Managing variation
in databases is, however, difficult and has been extensively studied by the database …

How to efficiently process 2100 list variations

L Lazarek - Proceedings Companion of the 2017 ACM SIGPLAN …, 2017 - dl.acm.org
Variational execution offers an avenue of efficiently analyzing configurable systems, but data
structures like lists require special consideration. We implement automatic substitution of a …