ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Multi-source reachability”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DSTheoreticalRecentJun 24, 2026

Multi-Source Reachability in Near-Optimal Time

Shimon Kogan, Merav Parter

A near-optimal deterministic algorithm is presented to solve the multi-source reachability problem in near-linear time for dense graphs.

View →
cs.CCTheoreticalRecentJun 9, 2026

A Polynomial-Time $O(\sqrt n)$-Approximation for Undirected Three-Terminal Reachability-Preserving Minimum Edge Cut

Qi Duan

The paper presents a polynomial-time O(√n)-approximation algorithm for the undirected three-terminal reachability-preserving minimum edge cut problem.

View →
cs.MAcs.LOTheoreticalRecentJun 19, 2026

Monitoring Diameters of Causal Communication Graph with Spatio-Temporal Logic

Lydia Bakiri, Jérémy Dubut, Sergio Mover

The paper introduces an extension of muTGL logic with a new operator called the space horizon to improve expressiveness for analyzing reachability and communication chains in multi-agent systems.

View →
cs.PLTheoreticalRecentJun 19, 2026

Correct and Complete Symbolic Execution for Free

Erik Voogd, Einar Broch Johnsen, Åsmund Aqissiaq Arild Kløvstad, Jurriaan Rot +1 more

This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.

View →
cs.DCcs.ROmath.COTheoreticalRecentOct 13, 2026

A Minimum Exact Disjunctive Basis for Two-Robot Solvability Profiles

Tsukasa Ninomiya, Shota Naito, Naoki Kitamura, Yuichi Sudo +1 more

The paper characterizes the solvability profiles of tasks for two autonomous mobile robots in the plane under variable disorientation, chirality, and rigid movements.

View →
cs.PLTheoreticalRecentJun 26, 2026

Prophecy-Based Automated Verification of Message-Passing Programs

Takashi Nagatomi, Musashi Katsura, Naoki Kobayashi, Yusuke Matsushita +1 more

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.

View →
cs.AIcs.MAcs.NIPositionRecentJul 24, 2026

Let AI Agents Translate Networks, Not Reason About Them

Hongyu Hè, Maria Apostolaki

This paper presents TypoNet, a system that constructs and validates a symbolic model of a production-scale WAN from network artifacts using large language models for translation and a solver for relia…

View →
cs.CCTheoreticalRecentJul 8, 2026

Fixed Points, a Predictor-Impossibility Theorem, and Applications

Tom Altman

This paper introduces an activation hierarchy and proves a Predictor-Impossibility Theorem, showing that no effective predictor family can determine all stage languages. It also establishes a slice th…

View →
cs.CCTheoreticalRecentAug 6, 2026

Predictor-Impossibility Theorem and Applications

Tom Altman

This paper introduces a hierarchy and proves a Predictor Impossibility Theorem, defining an aggregate language MIS and establishing a connection between aggregate inputs and individual stage languages…

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.LOcs.PLTheoreticalRecentJun 8, 2026

When Types Intersect and Effects Get Handled

Ugo Dal Lago, Taro Sekiyama, Stefano Catozi

A novel intersection type system for a λ-calculus with algebraic effects and handlers is introduced.

View →
cs.PLTheoreticalRecentJun 11, 2026

Probabilistic, Resource-Aware, Asynchronous, Out-of-Order Choreographies

Mako Bates, Steven Baldasty, Ernest Hyun, Christian Skalka +1 more

This paper presents AsInst, a probabilistic language for modeling asynchronous choreographies with out-of-order execution.

View →
cs.DScs.CCTheoreticalRecentOct 19, 2026

Orienting mixed graphs for reachability pairs: When the all pairs setting is easier than the general one

Florian Hörsch, Marta Piecyk, Krisztina Szilágyi

This paper compares the computational complexity of two problems related to orienting mixed graphs to satisfy a maximum number of pairs of vertices.

View →
cs.PLcs.LOTheoreticalRecentJun 22, 2026

DissProve: Automated Verification of Distributed Protocols with Affine Communication

Christian Fontenot, Gowtham Kaki, Bor-Yuh Evan Chang

This paper presents an automated verification technique for safety properties of affine distributed protocols with an unbounded number of actors.

View →
cs.CCTheoreticalRecentJun 19, 2026

On the Reachability Problem on Monoid-Labelled Undirected Graphs

Nagashri Krishnakumar, Harshil Mittal, Jayalal Sarma

The paper studies the labelled reachability problem for undirected graphs with edges labelled by elements of a monoid M, and provides finer complexity bounds and dichotomies based on the monoid and th…

View →
cs.CLRecentMay 31, 2026

Robust Asynchronous Planning via Auto-Formalization

Jiayi Zhang, Jianing Yin, Ben Zhou, Li Zhang

The paper introduces new benchmarks for complex asynchronous planning and demonstrates that general constraint satisfaction formalizers (like CP-SAT) significantly outperform direct LLM planning or tr…

View →