26 papers
This paper presents a complete classification of the distributed computational complexity for local optimization problems in directed cycles within both deterministic and randomized LOCAL models, identifying four distinct complexity classes and providing an efficient meta-algorithm to automatically determine the complexity and synthesize optimal distributed algorithms for any given problem.
This paper proposes a risk-aware autonomous driving framework that extends linear temporal logic specifications to incorporate event timing and severity, formulating a linear programming problem to synthesize policies that balance collision risks and traffic rule violations, as validated in the Carla simulator.
This paper investigates Ramsey-like theorems for infinite trees and related combinatorial tools, applying these findings to address the expansion problem for tree algebras.
This paper proves Clark Kimberling's conjectures regarding his 2017 binary sequence by utilizing the Walnut theorem-prover to establish its connection to the infinite Tribonacci word and to determine its subword complexity and critical exponent.
This paper presents the formal modelling, verification using Uppaal, and testing of the Contract Automata Runtime Environment (CARE) as a network of stochastic timed automata to enhance the dependability of this open-source distributed application.
The paper introduces SpotIt, a novel evaluation pipeline that employs formal bounded equivalence verification to actively search for database instances distinguishing generated SQL queries from ground-truths, thereby addressing the limitations of optimistic test-based methods and revealing hidden discrepancies in current Text-to-SQL performance assessments.