Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
A method for proving and disprowng propemes of programs ts described Its mam features are Recurstvely defined procedures can be used m assemons, loop mvarlants are not necessary, absence of run time errors is proven, counterexamples to incorrect programs can be given Experience with the method's lmplementaUon is reported. © 1978, ACM. All rights reserved.
Imran Nasim, Melanie Weber
SCML 2024
L. Joskowicz, Elisha Sacks
aaai 1994
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Arnold L. Rosenberg
Journal of the ACM