Zobrazeno 1 - 10
of 94
pro vyhledávání: '"SERGEY, ILYA"'
Design of an efficient thread-safe concurrent data structure is a balancing act between its implementation complexity and performance. Lock-based concurrent data structures, which are relatively easy to derive from their sequential counterparts and t
Externí odkaz:
http://arxiv.org/abs/2408.13779
Synthetic Separation Logic (SSL) is a formalism that powers SuSLik, the state-of-the-art approach for the deductive synthesis of provably-correct programs in C-like languages that manipulate Heap-based linked data structures. Despite its expressivity
Externí odkaz:
http://arxiv.org/abs/2407.09143
Arrays are a fundamental abstraction to represent collections of data. It is often possible to exploit structural properties of the data stored in an array (e.g., repetition or sparsity) to develop a specialised representation optimised for space eff
Externí odkaz:
http://arxiv.org/abs/2404.06477
We present the design and implementation of the Small Scale Reflection proof methodology and tactic language (a.k.a. SSR) for the Lean 4 proof assistant. Like its Coq predecessor SSReflect, our Lean 4 implementation, dubbed LeanSSR, provides powerful
Externí odkaz:
http://arxiv.org/abs/2403.12733
Grey-box fuzzing is the lightweight approach of choice for finding bugs in sequential programs. It provides a balance between efficiency and effectiveness by conducting a biased random search over the domain of program inputs using a feedback functio
Externí odkaz:
http://arxiv.org/abs/2305.02601
Autor:
Costea, Andreea, Tiwari, Abhishek, Chianasta, Sigmund, R, Kishore, Roychoudhury, Abhik, Sergey, Ilya
Implementing bug-free concurrent programs is a challenging task in modern software development. State-of-the-art static analyses find hundreds of concurrency bugs in production code, scaling to large codebases. Yet, fixing these bugs in constantly ch
Externí odkaz:
http://arxiv.org/abs/2108.02490
Autor:
Nagaraj, Vaivaswatha, Johannsen, Jacob, Trunov, Anton, Pîrlea, George, Kumar, Amrit, Sergey, Ilya
Scilla is a higher-order polymorphic typed intermediate level language for implementing smart contracts. In this talk, we describe a Scilla compiler targeting LLVM, with a focus on mapping Scilla types, values, and its functional language constructs
Externí odkaz:
http://arxiv.org/abs/2008.05555
Autor:
Gopinathan, Kiran, Sergey, Ilya
Approximate Membership Query structures (AMQs) rely on randomisation for time- and space-efficiency, while introducing a possibility of false positive and false negative answers. Correctness proofs of such structures involve subtle reasoning about bo
Externí odkaz:
http://arxiv.org/abs/2004.13312
Publikováno v:
Foundations and Trends in Programming Languages, Vol. 5, No. 2-3 (Sept. 2019), pp. 102-281
Development of formal proofs of correctness of programs can increase actual and perceived reliability and facilitate better understanding of program specifications and their underlying assumptions. Tools supporting such development have been availabl
Externí odkaz:
http://arxiv.org/abs/2003.06458