More Like this

1. Hopper: Interpretative Fuzzing for Libraries

   Chen, Peng; Xie, Yuxuan; Lyu, Yunlong; Wang, Yuxiao; Chen, Hao (November 2023, Proceedings of the ACM Conference on Computer and Communications Security)
2. Type-level computations for Ruby libraries

   https://doi.org/10.1145/3314221.3314630  

   Kazerounian, Milod; Guria, Sankha Narayan; Vazou, Niki; Foster, Jeffrey S.; Van Horn, David (June 2019, Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation)

   Many researchers have explored ways to bring static typing to dynamic languages. However, to date, such systems are not precise enough when types depend on values, which often arises when using certain Ruby libraries. For example, the type safety of a database query in Ruby on Rails depends on the table and column names used in the query. To address this issue, we introduce CompRDL, a type system for Ruby that allows library method type signatures to include type-level computations (or comp types for short). Combined with singleton types for table and column names, comp types let us give database query methods type signatures that compute a table’s schema to yield very precise type information. Comp types for hash, array, and string libraries can also increase precision and thereby reduce the need for type casts. We formalize CompRDL and prove its type system sound. Rather than type check the bodies of library methods with comp types—those methods may include native code or be complex—CompRDL inserts run-time checks to ensure library methods abide by their computed types. We evaluated CompRDL by writing annotations with type-level computations for several Ruby core libraries and database query APIs. We then used those annotations to type check two popular Ruby libraries and four Ruby on Rails web apps. We found the annotations were relatively compact and could successfully type check 132 methods across our subject programs. Moreover, the use of type-level computations allowed us to check more expressive properties, with fewer manually inserted casts, than was possible without type-level computations. In the process, we found two type errors and a documentation error that were confirmed by the developers. Thus, we believe CompRDL is an important step forward in bringing precise static type checking to dynamic languages. 

   more » « less
3. CLAIRE: Composable Chiplet Libraries for AI Inference

   https://doi.org/10.23919/DATE64628.2025.10992960  

   Nalla, Pragnya Sudershan; Haque, Emad; Liu, Yaotian; Sapatnekar, Sachin S; Zhang, Jeff; Chakrabarti, Chaitali; Cao, Yu (March 2025, IEEE)
4. Semantic Conflict Detection for Transactional Data Structure Libraries

   https://doi.org/10.1145/3409964.3461826  

   Sheng, Yaodong; Hassan, Ahmed; Spear, Michael (July 2021, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures)

   null (Ed.)

   The Transactional Data Structure Library (TDSL) methodology improves the programmability and performance of concurrent software by making it possible for programmers to compose multiple concurrent data structure operations into coarse-grained transactions. Like transactional memory, TDSL enables arbitrarily many operations on arbitrarily many data structures to appear to other threads as a single atomic, isolated transaction. Like concurrent data structures, the individual operations on a TDSL data structure are optimized to avoid artificial contention. We introduce techniques for reducing false conflicts in TDSL implementations. Our approach allows expressing the postconditions of operations entirely via semantic properties, instead of through low-level structural properties. Our design is general enough to support lists, deques, ordered and unordered maps, and vectors. It supports richer programming interfaces than are available in existing TDSL implementations. It is also capable of precise memory management, which is necessary in low-level languages like C++. 

   more » « less
5. Scholarly Very Large Data: Challenges for Digital Libraries

   Jian Wu, C. Lee (April 2020, Large Scale Networking (LSN) Workshop on Huge Data: A Computing, Networking and Distributed Systems Perspective)

   The volume of scholarly data has been growing exponentially over the last 50 years. The total size of the open access documents is estimated to be 35 million by 2022. The total amount of data to be handled, including crawled documents, production repository, metadata, extracted content, and their replications, can be as high as 350TB. Academic digital library search engines face significant challenges in maintaining sustainable services. We discuss these challenges and propose feasible solutions to key modules in the digital library architecture including the document storage, data extraction, database and index. We use CiteSeerX as a case study. 

   more » « less