
Explore limitations of ⎕SH/⎕CMD and discover a new system function for enhanced shell command execution in APL, offering greater control over input/output redirections.

Explore challenges in hardware-software co-design for sparse machine learning, focusing on tensor algebra accelerators and real-world applications.

Explore gate-level verification for cryptographic software timing, abandoning leakage models. Discover a novel approach to ensure constant-time execution in hardware implementations.

Explore a novel approach to concurrent program verification using consistency-preserving propagation, improving efficiency in SMT solving.

Explore a novel technique for generating visualizations from natural language queries using program synthesis and refinement types, outperforming existing tools.

Explore modular verification of op-based CRDTs using separation logic. Learn about Reliable Causal Broadcast and OpLib for simplified CRDT implementation and correctness proofs.

Explore scalable linear invariant generation techniques using Farkas' Lemma, improving efficiency and accuracy for affine programs without compromising completeness.

Explore neural language models and few-shot learning for efficient processing of automotive engineering requirements in model-driven software engineering.

Explore key concepts in semantics, including type-based approaches, rewriting, game semantics, and category theory, with expert Ugo Dal Lago.

Explore advanced program synthesis techniques and their applications in software development, presented by expert Nate Foster at POPL 2023.

Explore algorithmic verification techniques and their applications in program analysis, presented by expert Umang Mathur at POPL 2023's innovative session preview track.

Explore automatic differentiation techniques and their applications in programming languages, presented by expert Sasa Misailovic at POPL 2023.

Explore type theory fundamentals and recent advancements in this expert-led session preview for POPL 2023, enhancing accessibility of upcoming talks.

Explore probabilistic inference concepts with expert Alexandra Silva in this POPL 2023 session preview, enhancing accessibility of advanced programming language topics.

Explore the metatheory of IRs and CPS-calculus, examining their foundations, semantics, and applications in compiler optimization and dependently-typed programming languages.

Explore a uniform type system for four control operators, examining their relationships and implementation in Agda. Gain insights into CPS translation and termination properties.

Explore APL workspace internals, memory management, and optimization techniques to enhance application performance and efficiency.

Explore Pasado, a technique for synthesizing precise static analyzers for Automatic Differentiation, improving precision in nonlinear operations and demonstrating applications in various domains.

Explore finite-aspect checkable languages and their role in decidable learning, connecting expression syntax tree evaluation to finite tree automata for new learning results.

Explore explainable program synthesis through subspecifications, enhancing implementation understanding with logical formulas. Learn algorithms for constructing and verifying subspecifications, their properties, and impact on code comprehension.

Explore algebro-geometric algorithms for template-based synthesis of polynomial programs, offering a scalable approach to program sketching without sacrificing completeness.