
Improve efficiency of bounded model checkers with static analysis and SMT encoding optimizations for memory models, reducing verification time by up to 40% in challenging benchmarks.

Explore DebloaterX, a novel approach for efficient object-sensitive pointer analysis. Learn how container-usage patterns improve context debloating, enhancing performance with minimal precision loss.

Explore a novel graph IR for aggressive global optimizations in impure higher-order languages, combining reachability types and effect systems for precise dependency tracking and efficient code optimization.

Explore a new algorithm for efficient regex matching with bounded repetition using nondeterministic bit vector automata, offering improved performance for challenging patterns in practice.

Explore bidirectional object-oriented programming for programmatic and direct object manipulation, focusing on a novel language extension and its application in HTML document generation through GUI design.

Explore a novel cocktail approach for efficient call graph construction in C-based software, improving precision and scalability for vulnerability detection and code understanding.

Explore a mechanically verified compiler translating SQL to imperative code, addressing implementation challenges and leveraging formalization advances in query compilation.

Explore automated translation of functional big data queries to SQL, improving efficiency while maintaining abstraction benefits. Learn about novel column-wise decomposition for query synthesis.

Explore efficient Boolean unification for Hindley-Milner-style type and effect systems. Learn about a hybrid algorithm improving compilation speed and reducing inference overhead in polymorphic effect systems.

Explore Verus, an SMT-based tool for formally verifying Rust programs. Learn how it leverages Rust's linear types and borrow checking to prove functional correctness in low-level, high-assurance systems.

Explore a novel technique for quantifying compiler-internal events in optimized code, reducing profiling perturbation and enhancing dynamic analysis accuracy.

Explore innovative concrete type inference for dynamically typed languages, combining machine learning and SMT solving to enable code optimization without manual type annotations, significantly boosting performance.

Explore prefix-guided execution for accelerating coverage-guided fuzzing, improving bug detection and code coverage in software testing through early termination of unlikely tests.

Explore a low-code platform for systematic language composition using visual interfaces and pre-built components, streamlining domain-specific language development and promoting reuse.

Explore a tool for automating Java interface generation to access foreign language objects in GraalVM, improving code clarity and reducing errors in language interoperability.

Explore YJIT's performance in Ruby, comparing benchmarks and real-world deployment. Analyze speed, memory usage, and warm-up time against other JIT compilers for pragmatic evaluation.

Explore an in-depth study of memory behavior in Java benchmarks, offering insights into object allocations, accesses, and memory pressure through comprehensive profiling techniques.

Explore the comparison of Rapid Type Analysis and Points-To Analysis in GraalVM Native Image, focusing on performance improvements and trade-offs in ahead-of-time compilation for Java applications.

Explore an algorithm for approximating type stability in Julia's JIT compiler, enhancing performance in this dynamic scientific computing language.

Explore Google's innovative approach to unit testing Borg deployment configurations, addressing complexity challenges in large-scale systems and improving development efficiency.

Explore automated testing of Dafny programs with DTest. Learn to generate system-level tests, identify dead code, and ensure verified properties hold at runtime, enhancing confidence in code execution.