| 1 |
Succinct Population Protocols for Presburger Arithmetic
|
|
|
|
In: STACS 2020 - 37th International Symposium on Theoretical Aspects of Computer Science ; https://hal.archives-ouvertes.fr/hal-03065533 ; STACS 2020 - 37th International Symposium on Theoretical Aspects of Computer Science, Mar 2020, Montpellier, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2020.40⟩ (2020)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates
|
|
Voigt, Marco. - : Saarländische Universitäts- und Landesbibliothek, 2019
|
|
BASE
|
|
Show details
|
|
|
| 3 |
The Complexity of Reversal-Bounded Model-Checking
|
|
|
|
In: Frontiers of Combining Systems 8th International Symposium, FroCoS 2011, Saarbrücken, Germany, October 5-7, 2011. Proceedings ; 8th International Symposium on Frontiers of Combining Systems (FroCoS'11) ; https://hal.archives-ouvertes.fr/hal-03195045 ; 8th International Symposium on Frontiers of Combining Systems (FroCoS'11), Viorica Sofronie-Stokkermans; Cesare Tinelli, Oct 2011, Saarbruecken, Germany. pp.71-86, ⟨10.1007/978-3-642-24364-6_6⟩ ; https://www.springer.com/gp/book/9783642243639 (2011)
|
|
BASE
|
|
Show details
|
|
|
|
|
