
Explore automated 'Extract Method' refactoring for Rust, addressing ownership and lifetime challenges through program transformations and repair procedures. Gain insights into advanced code refactoring techniques.

Explore a systematic approach to teaching Rust's ownership types, featuring a new assessment tool, conceptual model, and visualizations to improve learner understanding of memory safety concepts.

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 cocktail approach for efficient call graph construction in C-based software, improving precision and scalability for vulnerability detection and code understanding.

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 gradual typing and verification techniques in programming languages with Ronald Garcia's preview of the POPL'24 session.

Explore a novel dynamic algorithm for bidirected Dyck reachability, optimizing on-the-fly static analysis with superior performance and efficiency for continuous code updates.

Explore unboxed data constructors in ML languages, enhancing efficiency without compromising safety. Learn static analysis techniques and their implementation in OCaml, including termination detection algorithms.

Explore Wasm-prechk, a WebAssembly extension using indexed types for enhanced static safety. Learn about performance gains, type safety proofs, and implementation trade-offs in this innovative approach.

Explore an innovative approach to improve CFL-reachability scalability through graph folding, reducing input size and enhancing performance in program analysis applications like alias and value-flow analysis.

Explore compiler techniques for efficiently handling structured data, enhancing performance and optimization in programming languages.

Explore a static analysis approach for high-level quantum programming, focusing on dataflow analysis to detect variables requiring uncomputation for program correctness.

Explore a novel approach to JavaScript vulnerability detection using Multiversion Dependency Graphs, improving analysis efficiency and accuracy for npm packages.

Explore an efficient numerical abstract domain for analyzing floating-point programs, supporting conditionals, loops, and elementary functions. Learn about TVPI-FP's innovative use of interval arithmetic in inequalities.

Explore a novel dynamic analysis technique for JavaScript that improves static analysis accuracy, particularly for dynamic property accesses, enhancing call graph construction and analysis recall.

Explore a technique for optimizing C extension functions in dynamic language interpreters using typed methods, reducing call and return overhead for improved performance.

Explore custom static analyses supporting C/C++ code transition to CHERI hardware, enhancing memory protection and software compartmentalization for RISC-V and AArch64 architectures.

Explore a novel approach to interleaved Dyck reachability, offering improved precision for context- and field-sensitive static analyses through refined CFLs and on-demand application.

Explore jGuard, a Java extension enabling API designers to encode specifications directly, preventing misuse without additional tooling for users. Enhance API resilience effortlessly.

Explore combinator-based fixpoint algorithms for big-step abstract interpreters. Learn to develop and ensure soundness of sophisticated fixpoint algorithms using reusable combinators for static analysis.