More Like this

1. Semiparametric regression for measurement error model with heteroscedastic error

   https://doi.org/10.1016/j.jmva.2018.12.012  

   Li, Mengyan; Ma, Yanyuan; Li, Runze (May 2019, Journal of Multivariate Analysis)
2. Error-Sensor: Mining Information from HTTP Error Traffic for Malware Intelligence

   Jialong Zhang, Jiyong Jang (January 2018, International Symposium on Research in Attacks, Intrusions and Defenses)
3. Optimization of Error Pattern Embedding Steganography within Error-Correcting Code Frameworks

   Jang, Yongkyu; Zhang, Minglong; Kirchner, Andre; Jones, Bryan A; Marojevic, Vuk; Kim, Taejoon; Love, David J (October 2024, IEEE)
4. Error messages are classifiers: a process to design and evaluate error messages

   https://doi.org/10.1145/3133850.3133862  

   Wrenn, John; Krishnamurthi, Shriram (January 2017, International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software)

   This paper presents a lightweight process to guide error report authoring. We take the perspective that error reports are really classifiers of program information. They should therefore be subjected to the same measures as other classifiers (e.g., precision and recall). We formalize this perspective as a process for assessing error reports, describe our application of this process to an actual programming language, and present a preliminary study on the utility of the resulting error reports. 

   more » « less
5. Error Credits: Resourceful Reasoning about Error Bounds for Higher-Order Probabilistic Programs

   https://doi.org/10.1145/3674635  

   Aguirre, Alejandro; Haselwarter, Philipp G; de_Medeiros, Markus; Li, Kwing Hei; Gregersen, Simon Oddershede; Tassarotti, Joseph; Birkedal, Lars (August 2024, Proceedings of the ACM on Programming Languages)

   Probabilistic programs often trade accuracy for efficiency, and thus may, with a small probability, return an incorrect result. It is important to obtain precise bounds for the probability of these errors, but existing verification approaches have limitations that lead to error probability bounds that are excessively coarse, or only apply to first-order programs. In this paper we present Eris, a higher-order separation logic for proving error probability bounds for probabilistic programs written in an expressive higher-order language. Our key novelty is the introduction of error credits, a separation logic resource that tracks an upper bound on the probability that a program returns an erroneous result. By representing error bounds as a resource, we recover the benefits of separation logic, including compositionality, modularity, and dependency between errors and program terms, allowing for more precise specifications. Moreover, we enable novel reasoning principles such as expectation-preserving error composition, amortized error reasoning, and error induction. We illustrate the advantages of our approach by proving amortized error bounds on a range of examples, including collision probabilities in hash functions, which allow us to write more modular specifications for data structures that use them as clients. We also use our logic to prove correctness and almost-sure termination of rejection sampling algorithms. All of our results have been mechanized in the Coq proof assistant using the Iris separation logic framework and the Coquelicot real analysis library. 

   more » « less