19 citations · 19 across the 4 of their papers we have counts for
4 papers
On Systematic Testing for Execution-Time Analysis
Daniel Bundala, Sanjit A. Seshia
Given a program and a time deadline, does the program finish before the deadline when executed on a given platform? With the requirement to produce a test case when such a violatio…
Optimal-Depth Sorting Networks
Daniel Bundala, Michael Codish, Luís Cruz-Filipe +2
We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of "The Art of Computer Programming", sorting networ…
On the Complexity of Temporal-Logic Path Checking
Daniel Bundala, Joël Ouaknine
Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this ta…
Optimal Sorting Networks
Daniel Bundala, Jakub Závodný
This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n <= 16…