Cited By
View all- Nagy SKim JReps TD’Antoni L(2024)Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of ProgramsProceedings of the ACM on Programming Languages10.1145/36897158:OOPSLA2(113-139)Online publication date: 8-Oct-2024
- Mulleners NJeuring JHeeren B(2024)Example-Based Reasoning about the Realizability of Polymorphic ProgramsProceedings of the ACM on Programming Languages10.1145/36746368:ICFP(317-337)Online publication date: 15-Aug-2024
- Patton NRahmani KMissula MBiswas JDillig I(2024)Programming-by-Demonstration for Long-Horizon Robot TasksProceedings of the ACM on Programming Languages10.1145/36328608:POPL(512-545)Online publication date: 5-Jan-2024
- Show More Cited By