Conference paper
Tutorials and Technical Briefings at ISEC 2025
Atul Kumar
ISEC 2025
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.
Atul Kumar
ISEC 2025
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Ran Iwamoto, Kyoko Ohara
ICLC 2023
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008