Courses from 1000+ universities
$7.2 billion in combined revenue since 2020. $8 billion in lost market value. This merger marks the end of an era in online education.
600 Free Google Certifications
Computer Science
Information Technology
Data Analysis
The Science of Gastronomy
Transforming Digital Learning: Learning Design Meets Service Design
Intelligenza Artificiale
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore efficient memory management for immutable data structures with cycles using reference counting, combining strongly connected components and union-find algorithms for precise reachability.
Explore a managed memory system for microcontrollers using NOR flash memory, optimizing performance and reducing flash erasures through innovative garbage collection and object movement techniques.
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 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 for detecting data races in concurrent data structures using summarization-guided concolic testing, enhancing efficiency in exploring dynamic shapes and exposing hidden races.
Explore ValBench, a comprehensive benchmark suite for evaluating value analysis tools in Java and Android. Learn about its test cases, evaluation framework, and insights into current challenges in program analysis.
Explore advancements in program optimization through relational contextual equality saturation, examining challenges and applications in combining with relational models.
Explore a technique for optimizing C extension functions in dynamic language interpreters using typed methods, reducing call and return overhead for improved performance.
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 a novel compaction algorithm that reduces heap fragmentation with a single pass, improving efficiency in memory management and garbage collection.
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 hardware-assisted secure memory disaggregation, combining trusted VMs with a dedicated engine for efficient isolation and protection of remote memory pages, ensuring confidentiality and integrity.
Explore an inductive approach to Spacer, unifying it with GPDR and addressing refutational completeness issues in constrained Horn clause satisfiability problem solving.
Explore SPORE, a novel stateless model checker combining symmetry and partial order reduction for efficient program verification. Learn how it optimizes model checking by leveraging program structure.
Explore a novel approach using symbolic finite automata for verifying representation invariants in functional programs interacting with stateful libraries, enhancing data structure implementation efficiency.
Get personalized course recommendations, track subjects and courses with reminders, and more.