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

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 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 a low-code platform for systematic language composition using visual interfaces and pre-built components, streamlining domain-specific language development and promoting reuse.

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 new derivative-based theory and algorithm for nonbacktracking regex matching, supporting anchors and counting while preserving backtracking semantics. Implemented in .NET7 with formal proof of correctness.

Explore robust and modular verification of WebAssembly programs using Iris-Wasm, a mechanized higher-order separation logic for specifying and verifying individual modules with strong isolation guarantees.

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

Explore four languages for achieving software portability across different platforms and architectures in this concise programming talk.

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 RefinedRust, a novel type system for verifying both safe and unsafe Rust code. Learn about its implementation, evaluation, and potential impact on high-assurance software development.

Explore an inductive approach to Spacer, unifying it with GPDR and addressing refutational completeness issues in constrained Horn clause satisfiability problem solving.

Explore formal verification in APL, focusing on its potential for building dependable software. Examine a case study in quantum computing and discuss future implications for software development.

Explore memory management challenges on mobile devices, focusing on Android Runtime. Learn about evaluation methods, benchmarks, and performance impacts in this critical yet understudied area.

Explore property-based testing's integration with formal verification for enhanced code correctness assurance, using Cogent's framework as a case study.

Explore a novel programming-by-demonstration paradigm that bridges the syntax-semantics gap, enabling intuitive and visual program creation without learning complex syntax.

Explore a novel calculus combining linear and dependent types, addressing challenges in linear dependent types research and enabling efficient resource management in programming.

Explore formalization of intrinsically-typed probabilistic programming language in Coq, focusing on syntax, evaluation, and formal verification applications.