Extends decision procedure for L_|.| to L_[ ] with finite integer intervals, implemented in {log} and applied to discharge invariance lemmas in an elevator algorithm case study.
(b) size( ˙Ai , m i− k i + 1− p) ∧ ˙Ai ⊆ [k i , m i ] implies that there are m i− k i + 1− p elements in [ k i , m i ]
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals
Extends decision procedure for L_|.| to L_[ ] with finite integer intervals, implemented in {log} and applied to discharge invariance lemmas in an elevator algorithm case study.