Searcharxiv⌕ Search

arXiv subjects

Cristian Curaba

Publications and source records attributed to Cristian Curaba.

5 recordsLinked to original sources

Composable, Knowledge-Driven Disservice Propagation for Complex Interdependent Services with a Flow-Allocation Module Validated Against Hydraulic Simulation

Modeling cascading failure across interdependent critical infrastructure requires either a composable physical simulator per domain or a topological abstraction that discards quantity awareness. Simulators are costly, data-hungry, and require detailed calibration per domain; topological abstractions stay data-parsimonious while missing quantity-based behaviors that govern real dynamics. We present, instead, a knowledge-driven propagation architecture in which heterogeneous service dependencies are identified by categories: a general logical propagation resolves multi-dependency and redundancy structures purely from how nodes are categorized, while quantity-aware categories plug in dedicated mechanisms - here, a max-min fair-share flow module for water distribution. Both share one discrete functionality scale and a monotonic update algorithm guaranteeing convergence in finitely many rounds. We assess the flow module by comparing its results with those we get from preexisting pressure-driven simulation with WNTR (Water Network Tool for Resilience) on eight realistic networks across four failure families (clustered damage, capacity-targeted attack, source failure, tank loss). Under capacity-targeted attack and source failure a topological-reachability baseline misses 46% of the truly critical junctions, where the flow module misses 10% and 8% at an average critical-class precision of 0.73. Supplementary materials, code and results are available at: https://github.com/cascade-platform-org/CASCADE

cs.CE↗

Series and Parallel Dependency Links: Vitality for Interdependent Networks of Networks

In a network of networks, a dependency link runs from a supplier to the node it serves and binds the supplier's failure to the node's failure. Indices computed from the graph topology leave aside the service each edge carries, but in real interdependent systems that service decides how failure propagates: a pumping station requires electricity and telemetry, and losing either stops it; a district fed by either of two reservoirs survives the loss of one. Building on this observation, we label each node of the network with the service it provides. We then measure how far this qualitative input can change the node's vitality ranking: by fixing the graph topology we show that changing only the labels moves the Mean Operativity Loss from $0.023$ to $0.114$, while a ranking computed from the unlabelled graph topology is blind to the difference. The links give a node its suppliers; the labels group those suppliers into alternatives within one service and joint requirements across services. These labels should belong to the description of an interdependent system alongside the links themselves for a fidelity vitality measure

cs.CE↗

Natural Language to First-Order Logic LLM-based Autoformalization

Large Language Models (LLMs) have renewed interest in autoformalization. Yet, when First-Order Logic (FOL) is considered as the target formalism, the field still lacks a unified task formulation and a systematic survey. This paper addresses this gap: we first provide a principled definition for the FOL-autoformalization task by distinguishing Ontology Extraction from Logical Translation, showing how their conflation obscures (cross-study) evaluation; we review existing datasets, evaluation metrics, and LLM-based methods, including fine-tuning, prompting, and verification-based refinement; we identify open challenges in benchmarking, semantic evaluation, ontology-aware methods, and end-to-end applications.

cs.CL↗

Fixing FOLIO and MALLS: Verified Annotations and an LLM-assisted Framework to Focus Human Relabeling

Accurate translation from Natural Language to First-Order Logic (NL-to-FOL) underpins neurosymbolic AI systems and Natural Language Inference (NLI), making the quality of NL-to-FOL benchmarks essential---yet these datasets have never been rigorously audited. Our first contribution is to present a systematic human inspection of the validation split of \textsf{FOLIO} and a subset of \textsf{MALLS} test instances, finding that approximately 42.5\% and 42\% of entries, respectively, contain incorrect FOL formalizations (i.e., ground truth labels), with additional rates of ambiguous NL sentences (17.8\% and 51\%) and incorrect NLI labels in \textsf{FOLIO} (8.4\%). Our second contribution is to develop and release corrected ground truths for such datasets, showing that annotation errors distort model evaluation on a reference benchmark task: testing three state-of-the-art LLMs (Gemma~4 31B-it, Qwen3-30B-A3B, and GPT-4o-mini) with the corrected ground truths yields accuracy gains from +11 to +23 percentage points. Motivated by these findings, we propose an LLM-based framework to support humans in manual reviewing NL-to-FOL datasets. By directing reviewers toward the most error-prone instances, we empirically show that it is possible to achieve 90\% dataset accuracy after reviewing fewer than 20\% of instances, compared to over 76\% required by unguided review. We release all human-verified annotations and the code for our framework.

cs.CL↗

CryptoFormalEval: Integrating LLMs and Formal Verification for Automated Cryptographic Protocol Vulnerability Detection

Cryptographic protocols play a fundamental role in securing modern digital infrastructure, but they are often deployed without prior formal verification. This could lead to the adoption of distributed systems vulnerable to attack vectors. Formal verification methods, on the other hand, require complex and time-consuming techniques that lack automatization. In this paper, we introduce a benchmark to assess the ability of Large Language Models (LLMs) to autonomously identify vulnerabilities in new cryptographic protocols through interaction with Tamarin: a theorem prover for protocol verification. We created a manually validated dataset of novel, flawed, communication protocols and designed a method to automatically verify the vulnerabilities found by the AI agents. Our results about the performances of the current frontier models on the benchmark provides insights about the possibility of cybersecurity applications by integrating LLMs with symbolic reasoning systems.

cs.CR↗