More Like this

1. Few-shot Shape Recognition by Learning Deep Shape-aware Features

   https://doi.org/10.1109/WACV57701.2024.00186  

   Shi, Wenlong; Lu, Changsheng; Shao, Ming; Zhang, Yinjie; Xia, Siyu; Koniusz, Piotr (January 2024, 2024 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV))
2. Ductile Shape-Memory Polymer Composite with Enhanced Shape Recovery Ability

   https://doi.org/10.1021/acsami.0c18413  

   Peng, Kaiyuan; Zhao, Yao; Shahab, Shima; Mirzaeifar, Reza (December 2020, ACS Applied Materials & Interfaces)

   null (Ed.)
3. Polycube Shape Space

   https://doi.org/10.1111/cgf.13839  

   Zhao, Hui; Li, Xuan; Wang, Wencheng; Wang, Xiaoling; Wang, Shaodong; Lei, Na; Gu, Xiangfeng (October 2019, Computer Graphics Forum)
4. Shape-recovering liquids

   https://doi.org/10.1038/s41567-025-02865-1  

   Raykh, Anthony; Paulsen, Joseph D; McGlasson, Alex; Joshi, Chaitanya; Atherton, Timothy J; Kandula, Hima Nagamanasa; Hoagland, David A; Russell, Thomas P (April 2025, Nature Physics)
5. Arithmetizing Shape Analysis

   https://doi.org/10.1007/978-3-031-98668-0_3  

   Wolff, Sebastian; Gupta, Ekanshdeep; Esen, Zafer; Hojjat, Hossein; Rümmer, Philipp; Wies, Thomas (July 2025, Springer Nature Switzerland)

   Abstract Memory safety is a fundamental correctness property of software. For programs that manipulate linked, heap-allocated data structures, ensuring memory safety requires analyzing their possible shapes. Despite significant advances in shape analysis, existing techniques rely on hand-crafted domains tailored to specific data structures, making them difficult to generalize and extend. This paper presents a novel approach that reduces memory-safety proofs to the verification of heap-less imperative programs, enabling the use of off-the-shelf software verification tools. We achieve this reduction through two complementary program instrumentation techniques: space invariants, which enable symbolic reasoning about unbounded heaps, and flow abstraction, which encodes global heap properties as local flow equations. The approach effectively verifies memory safety across a broad range of programs, including concurrent lists and trees that lie beyond the reach of existing shape analysis tools. 

   more » « less