
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 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.

Explore gradual typing and verification techniques in programming languages with Ronald Garcia's preview of the POPL'24 session.

Explore sound gradual verification using symbolic execution techniques. Learn about optimized run-time check generation and its implementation in verification tools.

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 advanced compiler testing techniques for loop optimizations in C++ and data-parallel languages. Learn about YARPGen's reimplementation, static undefined behavior avoidance, and loop code diversity mechanisms.

Explore novel coverage criteria for generating high-quality conformance tests in programming language implementations, focusing on feature-sensitive and feature-call-path-sensitive approaches.

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 a verified monadic interpreter for WebAssembly, its adoption as a fuzzing oracle, and its performance compared to other interpreters and oracles.

Explore a sound symbolic quantitative information flow analysis for bounding information leakage in programs using approximate model counting and symbolic execution.

Explore a novel type-based verification method for validating coverage in test input generators, enhancing property-based testing with underapproximate reasoning and refinement types.

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 a novel symbolic execution technique for efficient bug finding, reducing path explosion through compatible branch coverage and program dependency analysis for faster software testing.

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.