Verifying OpenJDK’s Sort Method for Generic Collections
نویسندگان
چکیده
منابع مشابه
Generic tools for verifying concurrent systems
Despite the enormous strides made in automatic veriication technology over the past decade and a half, tools such as model checkers remain relatively underused in the development of software. One reason for this is that the bewildering array of speciica-tion and veriication formalisms complicates the development and adoption by users of relevant tool support. This paper proposes a remedy to thi...
متن کاملVerifying Search Results Over Web Collections
Web searching accounts for one of the most frequently performed computations over the Internet as well as one of the most important applications of outsourced computing, producing results that critically affect users’ decision-making behaviors. As such, verifying the integrity of Internet-based searches over vast amounts of web contents is essential. In this paper, we provide the first solution...
متن کاملEnhanced Generic Key-Address Mapping Sort Algorithm
Various methods, such as address-calculation sort, distribution counting sort, radix sort, and bucket sort, adopt the values being sorted to improve sorting efficiency, but require extra storage space. This work presents a specific key-address mapping sort implementation. The proposed algorithm has the advantages of linear average-time performance and no requirement for linked-list data structu...
متن کاملVerifying Generic Erlang Client-Server Implementations
The Erlang Verification Tool is an interactive theorem prover tailored to verify properties of distributed systems implemented in Erlang. It is being developed by the Swedish Institute of Computer Science in collaboration with Ericsson. In this paper we present an extension of this tool which allows to reason about the Erlang code on an architectural level. We demonstrate our approach by develo...
متن کاملVerifying a Local Generic Solver in Coq
Fixpoint engines are the core components of program analysis tools and compilers. If these tools are to be trusted, special attention should be paid also to the correctness of such solvers. In this paper we consider the local generic fixpoint solver RLD which can be applied to constraint systems x w fx,x ∈ V , over some lattice D where the right-hand sides fx are given as arbitrary functions im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2017
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-017-9426-4