32 citations · 78 across the 16 of their papers we have counts for
Showing 2015 · cs.PLShow all
2 papers · 2 filters
cs.PL2015★ 2 cited
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…
cs.PL2015★ 4 cited
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…