Saved in:
| Main Authors: | Kahn, David M, Hoffmann, Jan, Reps, Thomas, Grosen, Jessie |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.22982 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Big-Stop Semantics: Small-Step Semantics in a Big-Step Judgment
by: Kahn, David M, et al.
Published: (2025)
by: Kahn, David M, et al.
Published: (2025)
Newtonian Program Analysis of Probabilistic Programs
by: Wang, Di, et al.
Published: (2023)
by: Wang, Di, et al.
Published: (2023)
Synthesizing Abstract Transformers for Reduced-Product Domains
by: Kalita, Pankaj Kumar, et al.
Published: (2024)
by: Kalita, Pankaj Kumar, et al.
Published: (2024)
Synthesizing Specifications
by: Park, Kanghee, et al.
Published: (2023)
by: Park, Kanghee, et al.
Published: (2023)
Software Model Checking via Summary-Guided Search (Extended Version)
by: Fang, Ruijie, et al.
Published: (2025)
by: Fang, Ruijie, et al.
Published: (2025)
Scalable Equivalence Checking and Verification of Shallow Quantum Circuits
by: Yu, Nengkun, et al.
Published: (2025)
by: Yu, Nengkun, et al.
Published: (2025)
Semantics of Sets of Programs
by: Kim, Jinwoo, et al.
Published: (2024)
by: Kim, Jinwoo, et al.
Published: (2024)
Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of Programs
by: Nagy, Shaan, et al.
Published: (2024)
by: Nagy, Shaan, et al.
Published: (2024)
Unrealizability Logic
by: Kim, Jinwoo, et al.
Published: (2022)
by: Kim, Jinwoo, et al.
Published: (2022)
SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits
by: Yu, Nengkun, et al.
Published: (2025)
by: Yu, Nengkun, et al.
Published: (2025)
The SemGuS Toolkit
by: Johnson, Keith J. C., et al.
Published: (2024)
by: Johnson, Keith J. C., et al.
Published: (2024)
Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics
by: Johnson, Keith J. C., et al.
Published: (2024)
by: Johnson, Keith J. C., et al.
Published: (2024)
Verifying Solutions to Semantics-Guided Synthesis Problems
by: Murphy, Charlie, et al.
Published: (2024)
by: Murphy, Charlie, et al.
Published: (2024)
Polynomial Bounds of CFLOBDDs against BDDs
by: Zhi, Xusheng, et al.
Published: (2024)
by: Zhi, Xusheng, et al.
Published: (2024)
Synthesizing Formal Semantics from Executable Interpreters
by: Liu, Jiangyi, et al.
Published: (2024)
by: Liu, Jiangyi, et al.
Published: (2024)
Proceedings 16th International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software
by: Derakhshan, Farzaneh, et al.
Published: (2025)
by: Derakhshan, Farzaneh, et al.
Published: (2025)
Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)
by: Fränzle, Martin, et al.
Published: (2024)
Do CFLOBDDs Actually Make Use of Linear Structure?
by: Sistla, Meghana Aparna, et al.
Published: (2026)
by: Sistla, Meghana Aparna, et al.
Published: (2026)
Handling Exceptions and Effects with Automatic Resource Analysis
by: Chu, Ethan, et al.
Published: (2026)
by: Chu, Ethan, et al.
Published: (2026)
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials
by: Lian, Qihao, et al.
Published: (2025)
by: Lian, Qihao, et al.
Published: (2025)
LFPL: Revisited and Mechanized
by: Glover, Nathaniel, et al.
Published: (2026)
by: Glover, Nathaniel, et al.
Published: (2026)
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
by: Accattoli, Beniamino
Published: (2022)
by: Accattoli, Beniamino
Published: (2022)
Time for Timed Monitorability
by: Grosen, Thomas M., et al.
Published: (2025)
by: Grosen, Thomas M., et al.
Published: (2025)
Sixth International Workshop on Languages for Modelling Variability (MODEVAR 2024)
by: Galasso-Carbonnel, Jessie, et al.
Published: (2023)
by: Galasso-Carbonnel, Jessie, et al.
Published: (2023)
Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics
by: Pham, Long, et al.
Published: (2023)
by: Pham, Long, et al.
Published: (2023)
Destination Calculus: A Linear λ-Calculus for Purely Functional Memory Writes
by: Bagrel, Thomas, et al.
Published: (2025)
by: Bagrel, Thomas, et al.
Published: (2025)
Fusing Gathers with Integer Linear Programming
by: van Balen, David, et al.
Published: (2024)
by: van Balen, David, et al.
Published: (2024)
MappedTrace: Tracing Pointer Remotely with Compiler-generated Maps
by: Ma, Zhiyao, et al.
Published: (2025)
by: Ma, Zhiyao, et al.
Published: (2025)
Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)
by: Cimatti, Alessandro, et al.
Published: (2024)
Weighted Context-Free-Language Ordered Binary Decision Diagrams
by: Sistla, Meghana, et al.
Published: (2023)
by: Sistla, Meghana, et al.
Published: (2023)
Monitoring Timed Properties (Revisited)
by: Grosen, Thomas Møller, et al.
Published: (2022)
by: Grosen, Thomas Møller, et al.
Published: (2022)
An Iris for Expected Cost Analysis
by: Lohse, Janine, et al.
Published: (2024)
by: Lohse, Janine, et al.
Published: (2024)
Towards Efficient Hash Maps in Functional Array Languages
by: Due, William Henrich, et al.
Published: (2025)
by: Due, William Henrich, et al.
Published: (2025)
CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
by: Sistla, Meghana, et al.
Published: (2022)
by: Sistla, Meghana, et al.
Published: (2022)
An Order Theory Framework of Recurrence Equations for Static Cost Analysis $-$ Dynamic Inference of Non-Linear Inequality Invariants
by: Rustenholz, Louis, et al.
Published: (2024)
by: Rustenholz, Louis, et al.
Published: (2024)
Linear Constraints
by: Spiwack, Arnaud, et al.
Published: (2026)
by: Spiwack, Arnaud, et al.
Published: (2026)
Synthesizing Backward Error Bounds, Backward
by: Zielinski, Laura, et al.
Published: (2026)
by: Zielinski, Laura, et al.
Published: (2026)
Soundly Handling Linearity
by: Tang, Wenhao, et al.
Published: (2023)
by: Tang, Wenhao, et al.
Published: (2023)
Efficient Neural Network Verification via Order Leading Exploration of Branch-and-Bound Trees
by: Zhang, Guanqin, et al.
Published: (2025)
by: Zhang, Guanqin, et al.
Published: (2025)
Automated Expected Cost Analysis for Quantum Programs
by: Moser, Georg, et al.
Published: (2026)
by: Moser, Georg, et al.
Published: (2026)
Similar Items
-
Big-Stop Semantics: Small-Step Semantics in a Big-Step Judgment
by: Kahn, David M, et al.
Published: (2025) -
Newtonian Program Analysis of Probabilistic Programs
by: Wang, Di, et al.
Published: (2023) -
Synthesizing Abstract Transformers for Reduced-Product Domains
by: Kalita, Pankaj Kumar, et al.
Published: (2024) -
Synthesizing Specifications
by: Park, Kanghee, et al.
Published: (2023) -
Software Model Checking via Summary-Guided Search (Extended Version)
by: Fang, Ruijie, et al.
Published: (2025)