20 results for “Multi-source reachability”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
A near-optimal deterministic algorithm is presented to solve the multi-source reachability problem in near-linear time for dense graphs.
The paper presents a polynomial-time O(√n)-approximation algorithm for the undirected three-terminal reachability-preserving minimum edge cut problem.
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.
This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.
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.
This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.
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…
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…
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…
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.
A novel intersection type system for a λ-calculus with algebraic effects and handlers is introduced.
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.
This paper compares the computational complexity of two problems related to orienting mixed graphs to satisfy a maximum number of pairs of vertices.
This paper presents an automated verification technique for safety properties of affine distributed protocols with an unbounded number of actors.
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…
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…