32 citations · 78 across the 16 of their papers we have counts for
17 papers
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
Nadia Labai, Tomer Kotek, Magdalena Ortiz +1
We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is im…
On the automated verification of web applications with embedded SQL
Shachar Itzhaky, Tomer Kotek, Noam Rinetzky +4
A large number of web applications is based on a relational database together with a program, typically a script, that enables the user to interact with the database through embedd…
A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms
Igor Konnov, Marijana Lazic, Helmut Veith +1
Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process…
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs
Moritz Sinn, Florian Zuleger, Helmut Veith
Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form x' <= y + c, and describe that the value of…
Monadic second order finite satisfiability and unbounded tree-width
Tomer Kotek, Helmut Veith, Florian Zuleger
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the…
Local Linearizability
Andreas Haas, Thomas A. Henzinger, Andreas Holzer +6
The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition du…