Programming languages and verification
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
16 records · Search and filter
- CS-264 A fixed-basis semibasis certificate for DG-module interoperability
- CS-302 Circular Assume–Guarantee Reasoning for General Systems
- CS-507 Specialized algebra kernels and certified interoperability
- CS-566 A typed plural-paper certificate for mathematical communication
- CS-567 A semantics-bound certified bridge between Lean and computer algebra
- CS-569 Ordered proof traces for sound educational interoperability
- CS-573 Version-pinned workspace semantics for activities
- CS-581 A semantic contract for journal-style theorem output
- CS-602 A versioned capability contract for PreTeXt programming languages
- CS-604 A semantic degradation contract and state lower bound for EPUB knowl fallbacks
- CS-613 Truncation representatives, semantic equality certificates, and functorial cohomology maps
- CS-654 Universal Semantic Communication Across Different Meanings
- CS-703 Bit-Width-Independent Verification of Integer Multipliers
- CS-758 Interoperable Virtual Laboratories for Scientific Simulation
- CS-811 Formal Verification of AI-Generated Mathematical Proofs
- CS-814 Scaling Paradigms for Lean Autoformalization