Searcharxiv⌕ Search

arXiv subjects

Mihai Nicola

Publications and source records attributed to Mihai Nicola.

2 recordsLinked to original sources

Predicting Bot Vulnerability from Posting Trajectories: Censored Functional Regression under Informative Sampling

In this manuscript, we propose a novel framework for Scalar-on Censored Informative-design Functional Regression or SoCIFR. This setting is increasingly common in modern longitudinal and digital data applications but remains underdeveloped in functional data literature. We first discuss estimation and prediction in SoCIFR and extend the methodology to accommodate a matched case-control design. The proposed methodology is further generalized to handle multiple functional predictors, allowing for both censored and uncensored trajectories, observed under informative or non-informative sampling designs. Through simulation studies, we assess the performance of the proposed methods under various data-generating scenarios. We apply the methods to the motivating application for predicting user susceptibility to automated ("bot") interactions at increasing future time horizons based on social media behavioral trajectories observed over fixed time windows.

stat.ME↗

Abstract Interpretation of Temporal Safety Effects of Higher Order Programs

This paper describes a new abstract interpretation-based approach to verify temporal safety properties of recursive, higher-order programs. While prior works have provided theoretical impact and some automation, they have had limited scalability. We begin with a new automata-based "abstract effect domain" for summarizing context-sensitive dependent effects, capable of abstracting relations between the program environment and the automaton control state. Our analysis includes a new transformer for abstracting event prefixes to automatically computed context-sensitive effect summaries, and is instantiated in a type-and-effect system grounded in abstract interpretation. Since the analysis is parametric on the automaton, we next instantiate it to a broader class of history/register (or "accumulator") automata, beyond finite state automata to express some context-free properties, input-dependency, event summation, resource usage, cost, equal event magnitude, etc. We implemented a prototype evDrift that computes dependent effect summaries (and validates assertions) for OCaml-like recursive higher-order programs. As a basis of comparison, we describe reductions to assertion checking for higher-order but effect-free programs, and demonstrate that our approach outperforms prior tools Drift, RCaml/Spacer, MoCHi, and ReTHFL. Overall, across a set of 23 benchmarks, Drift verified 12 benchmarks, RCaml/Spacer verified 6, MoCHi verified 11, ReTHFL verified 18, and evDrift verified 21; evDrift also achieved a 6.3x, 5.3x, 16.8x, and 6.4x speedup over Drift, RCaml/Spacer, MoCHi, and ReTHFL, respectively, on those benchmarks that both tools could solve.

cs.PL↗