Diekert, Volker; Potapov, Igor; Semukhin, Pavel Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices. (English) Zbl 07957552 SIAM J. Comput. 53, No. 6, 1663-1708 (2024). MSC: 68Q45 68W30 65F30 × Cite Format Result Cite Review PDF Full Text: DOI
Würdemann, Nick; Chatain, Thomas; Haar, Stefan; Panneke, Lukas Taking complete finite prefixes to high level, symbolically. (English) Zbl 07929411 Fundam. Inform. 192, No. 3-4, 313-361 (2024). MSC: 68-XX × Cite Format Result Cite Review PDF Full Text: DOI
Brieger, Marvin; Mitsch, Stefan; Platzer, André Uniform substitution for dynamic logic with communicating hybrid programs. (English) Zbl 07838482 Pientka, Brigitte (ed.) et al., Automated deduction – CADE 29. 29th international conference on automated deduction, Rome, Italy, July 1–4, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14132, 96-115 (2023). MSC: 03B35 68V15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Carroll, Sean M. Completely discretized, finite quantum mechanics. (English) Zbl 1541.81002 Found. Phys. 53, No. 6, Paper No. 90, 13 p. (2023). MSC: 81P05 46C05 31C20 03D05 51F25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Würdemann, Nick; Chatain, Thomas; Haar, Stefan Taking complete finite prefixes to high level, symbolically. (English) Zbl 1541.68263 Gomes, Luis (ed.) et al., Application and theory of Petri nets and concurrency. 44th international conference, Petri NETS 2023, Lisbon, Portugal, June 25–30, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13929, 123-144 (2023). MSC: 68Q85 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zapryagaev, A. A. On interpretations of Presburger arithmetic in Büchi arithmetics. (English. Russian original) Zbl 1542.03055 Dokl. Math. 107, No. 2, 89-92 (2023); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 510, 3-7 (2023). Reviewer: Roger Villemaire (Montréal) MSC: 03C62 03F30 03D05 × Cite Format Result Cite Review PDF Full Text: DOI
Habermehl, Peter; Kuske, Dietrich On Presburger arithmetic extended with non-unary counting quantifiers. (English) Zbl 07731932 Log. Methods Comput. Sci. 19, No. 3, Paper No. 4, 32 p. (2023). MSC: 03B70 68-XX × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bednarczyk, Bartosz; Demri, Stéphane; Fervari, Raul; Mansutti, Alessio On composing finite forests with modal logics. (English) Zbl 07672671 ACM Trans. Comput. Log. 24, No. 2, Article No. 12, 46 p. (2023). MSC: 03B70 68-XX × Cite Format Result Cite Review PDF Full Text: DOI
Konnov, Igor; Lazić, Marijana; Stoilkovska, Ilina; Widder, Josef Survey on parameterized verification with threshold automata and the Byzantine Model Checker. (English) Zbl 07667095 Log. Methods Comput. Sci. 19, No. 1, Paper No. 5, 25 p. (2023). MSC: 68Q60 68M14 68M15 68Q45 68W15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Chistikov, Dmitry; Haase, Christoph; Mansutti, Alessio Quantifier elimination for counting extensions of Presburger arithmetic. (English) Zbl 1547.03355 Bouyer, Patricia (ed.) et al., Foundations of software science and computation structures. 25th international conference, FOSSACS 2022, held as part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, April 2–7, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13242, 225-243 (2022). MSC: 03F30 03C10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Felli, Paolo; Montali, Marco; Winkler, Sarah CTL* model checking for data-aware dynamic systems with arithmetic. (English) Zbl 07628180 Blanchette, Jasmin (ed.) et al., Automated reasoning. 11th international joint conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13385, 36-56 (2022). MSC: 68V15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Galeotti, Lorenzo; Löwe, Benedikt Order types of models of fragments of Peano arithmetic. (English) Zbl 1504.03019 Bull. Symb. Log. 28, No. 2, 182-206 (2022). Reviewer: Roman Kossak (New York) MSC: 03C62 03H15 03C64 06A05 08A99 × Cite Format Result Cite Review PDF Full Text: DOI
Evetts, Alex; Levine, Alex Equations in virtually abelian groups: languages and growth. (English) Zbl 07525088 Int. J. Algebra Comput. 32, No. 3, 411-442 (2022). MSC: 03D05 20F10 20F65 20K35 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Nguyen, Danny; Pak, Igor Short Presburger arithmetic is hard. (English) Zbl 1542.68077 SIAM J. Comput. 51, No. 2, STOC17-1-STOC17-30 (2022). MSC: 68Q25 03F30 68Q17 90C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fu, Yuxi A thesis for interaction. (English) Zbl 1532.68044 Theor. Comput. Sci. 897, 114-134 (2022). MSC: 68Q85 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Baier, Christel; Coenen, Norine; Finkbeiner, Bernd; Funke, Florian; Jantsch, Simon; Siber, Julian Causality-based game solving. (English) Zbl 1493.68203 Silva, Alexandra (ed.) et al., Computer aided verification. 33rd international conference, CAV 2021, virtual event, July 20–23, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12759, 894-917 (2021). MSC: 68Q60 03B70 91A05 91A80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cluckers, Raf; Halupczok, Immanuel A \(p\)-adic variant of Kontsevich-Zagier integral operation rules and of Hrushovski-Kazhdan style motivic integration. (English) Zbl 1485.11163 J. Reine Angew. Math. 779, 105-121 (2021). Reviewer: Anatoly N. Kochubei (Kyïv) MSC: 11S80 03C40 12L12 14E18 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Haase, Christoph; Różycki, Jakub On the expressiveness of Büchi arithmetic. (English) Zbl 07410431 Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 310-323 (2021). MSC: 68Nxx 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Hieronymi, Philipp; Nguyen, Danny; Pak, Igor Presburger arithmetic with algebraic scalar multiplications. (English) Zbl 1547.03356 Log. Methods Comput. Sci. 17, No. 3, Paper No. 4, 34 p. (2021). MSC: 03F30 03B25 68Q17 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Blondin, Michael; Haase, Christoph; Mazowiecki, Filip; Raskin, Mikhail Affine extensions of integer vector addition systems with states. (English) Zbl 1547.68485 Log. Methods Comput. Sci. 17, No. 3, Paper No. 1, 26 p. (2021). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Bès, Alexis; Choffrut, Christian Theories of real addition with and without a predicate for integers. (English) Zbl 1535.03054 Log. Methods Comput. Sci. 17, No. 2, Paper No. 18, 27 p. (2021). MSC: 03B25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ghilardi, Silvio; Pagani, Elena Higher-order quantifier elimination, counter simulations and fault-tolerant systems. (English) Zbl 1543.68210 J. Autom. Reasoning 65, No. 3, 425-460 (2021). MSC: 68Q60 03B16 03C10 68M14 68M15 × Cite Format Result Cite Review PDF Full Text: DOI
Clemente, Lorenzo; Lasota, Sławomir Reachability relations of timed pushdown automata. (English) Zbl 1484.68079 J. Comput. Syst. Sci. 117, 202-241 (2021). Reviewer: Roger Villemaire (Montréal) MSC: 68Q45 03B70 03D05 03F30 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Beier, Simon; Holzer, Markus Decidability of right one-way jumping finite automata. (English) Zbl 1458.68087 Int. J. Found. Comput. Sci. 31, No. 6, 805-825 (2020). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Bednarczyk, Bartosz; Demri, Stéphane; Fervari, Raul; Mansutti, Alessio Modal logics with composition on finite forests: expressivity and complexity. (English) Zbl 1498.03049 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 167-180 (2020). MSC: 03B45 × Cite Format Result Cite Review PDF Full Text: DOI
Bès, Alexis; Choffrut, Christian \(\langle\mathbb{R},+,<,1\rangle\) is decidable in \(\langle \mathbb{R},+,<,\mathbb{Z}\rangle\). (English) Zbl 1484.03016 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 128-140 (2020). MSC: 03B25 × Cite Format Result Cite Review PDF Full Text: DOI
Blondin, Michael; Finkel, Alain; Goubault-Larrecq, Jean Forward analysis for WSTS. III: Karp-Miller trees. (English) Zbl 1491.68117 Log. Methods Comput. Sci. 16, No. 2, Paper No. 13, 33 p. (2020). MSC: 68Q85 68Q60 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Bromberger, Martin; Sturm, Thomas; Weidenbach, Christoph A complete and terminating approach to linear integer solving. (English) Zbl 1432.68597 J. Symb. Comput. 100, 102-136 (2020). MSC: 68W30 68Q60 68R07 68V15 90C10 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Amrane, Amazigh; Bedon, Nicolas Logic and rational languages of scattered and countable series-parallel posets. (English) Zbl 1453.03037 Theor. Comput. Sci. 809, 538-562 (2020). Reviewer: Roger Villemaire (Montréal) MSC: 03D05 03B25 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Clemente, Lorenzo; Hofman, Piotr; Totzke, Patrick Timed basic parallel processes. (English) Zbl 07649923 Fokkink, Wan (ed.) et al., 30th international conference on concurrency theory, CONCUR 2019, Amsterdam, the Netherlands, August 27–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 140, Article 15, 16 p. (2019). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Linker, Sven; Sevegnani, Michele Target counting with Presburger constraints and its application in sensor networks. (English) Zbl 1472.68015 Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. 475, No. 2231, Article ID 20190278, 24 p. (2019). MSC: 68M18 60C05 68R05 × Cite Format Result Cite Review PDF Full Text: DOI
Evetts, Alex Rational growth in virtually abelian groups. (English) Zbl 1515.20217 Ill. J. Math. 63, No. 4, 513-549 (2019). MSC: 20F65 20E45 05E16 20F05 20F69 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Euclid Link
Duchin, Moon; Shapiro, Michael The Heisenberg group is pan-rational. (English) Zbl 1504.20043 Adv. Math. 346, 219-263 (2019). MSC: 20F65 20F18 20F69 20F05 × Cite Format Result Cite Review PDF Full Text: DOI
Demri, Stéphane Reasoning about reversal-bounded counter machines. (English) Zbl 1544.03031 Golińska-Pilarek, Joanna (ed.) et al., Ewa Orłowska on relational methods in logic and computer science. Cham: Springer. Outst. Contrib. Log. 17, 441-479 (2018). MSC: 03D05 03B44 03F30 68Q04 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Bodirsky, Manuel; Martin, Barnaby; Mamino, Marcello; Mottet, Antoine The complexity of disjunctive linear Diophantine constraints. (English) Zbl 1512.68112 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 33, 16 p. (2018). MSC: 68Q25 03B70 03F30 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Clemente, Lorenzo; Lasota, Slawomir Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms. (English) Zbl 1499.68169 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 118, 14 p. (2018). MSC: 68Q45 03C10 03F30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Milchior, Arthur Spectra and satisfiability for logics with successor and a unary function. (English) Zbl 1521.03115 Math. Log. Q. 64, No. 4-5, 286-311 (2018). MSC: 03D05 03D35 03C13 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Mostowski, Marcin Foundations and philosophy of mathematics in Warsaw, the school of Andrzej Mostowski and philosophy. (English) Zbl 1406.03015 Garrido, Ángel (ed.) et al., The Lvov-Warsaw school. Past and present. Cham: Birkhäuser (ISBN 978-3-319-65429-4/hbk; 978-3-319-65430-0/ebook). Studies in Universal Logic, 555-565 (2018). MSC: 03-03 03E25 03C80 03F30 03A05 01A60 01A70 × Cite Format Result Cite Review PDF Full Text: DOI
Feferman, Solomon Tarski’s influence on computer science. (English) Zbl 1425.03003 Garrido, Ángel (ed.) et al., The Lvov-Warsaw school. Past and present. Cham: Birkhäuser. Stud. Univers. Log., 391-404 (2018). Reviewer: Davide Crippa (Paris) MSC: 03-03 68-03 01A70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Lechner, Antonia; Mayr, Richard; Ouaknine, Joël; Pouly, Amaury; Worrell, James Model checking flat Freeze LTL on one-counter automata. (English) Zbl 1405.68187 Log. Methods Comput. Sci. 14, No. 4, Paper No. 20, 21 p. (2018). MSC: 68Q60 03B25 03B44 03D05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Sofronie-Stokkermans, Viorica On interpolation and symbol elimination in theory extensions. (English) Zbl 1476.03043 Log. Methods Comput. Sci. 14, No. 3, Paper No. 23, 41 p. (2018). MSC: 03C40 03C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Blanqui, Frédéric Size-based termination of higher-order rewriting. (English) Zbl 1476.68048 J. Funct. Program. 28, Paper No. e11, 75 p. (2018). MSC: 68N18 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Barrett, Clark; Tinelli, Cesare Satisfiability modulo theories. (English) Zbl 1392.68379 Clarke, Edmund M. (ed.) et al., Handbook of model checking. Cham: Springer (ISBN 978-3-319-10574-1/hbk; 978-3-319-10575-8/ebook). 305-343 (2018). MSC: 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud Equivalence between model-checking flat counter systems and Presburger arithmetic. (English) Zbl 1393.68100 Theor. Comput. Sci. 735, 2-23 (2018). MSC: 68Q60 03B44 03F30 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Conant, Gabriel There are no intermediate structures between the group of integers and Presburger arithmetic. (English) Zbl 1447.03006 J. Symb. Log. 83, No. 1, 187-207 (2018). MSC: 03C64 03C07 03C45 03C62 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Decker, Normann; Habermehl, Peter; Leucker, Martin; Sangnier, Arnaud; Thoma, Daniel Model-checking counting temporal logics on flat structures. (English) Zbl 1442.68105 Meyer, Roland (ed.) et al., 28th international conference on concurrency theory. CONCUR 2017, Berlin, Germany, September 5–8, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 85, Article 29, 17 p. (2017). MSC: 68Q60 03B44 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Alberti, F.; Ghilardi, S.; Pagani, E. Cardinality constraints for arrays (decidability results and applications). (English) Zbl 1377.68125 Form. Methods Syst. Des. 51, No. 3, 545-574 (2017). MSC: 68Q60 03B70 68Q25 68W15 × Cite Format Result Cite Review PDF Full Text: DOI
Glaßer, Christian; Jonsson, Peter; Martin, Barnaby Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1380.68221 Theor. Comput. Sci. 703, 18-36 (2017). MSC: 68Q25 03F30 × Cite Format Result Cite Review PDF Full Text: DOI Link
Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel Separation logic with one quantified variable. (English) Zbl 1435.68117 Theory Comput. Syst. 61, No. 2, 371-461 (2017). MSC: 68Q25 03B70 68Q17 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Nguyen, Danny; Pak, Igor Complexity of short Presburger arithmetic. (English) Zbl 1370.68139 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 812-820 (2017). MSC: 68Q25 03F30 90C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Furcy, David; Micka, Samuel; Summers, Scott M. Optimal program-size complexity for self-assembled squares at temperature 1 in 3D. (English) Zbl 1364.68196 Algorithmica 77, No. 4, 1240-1282 (2017). MSC: 68Q05 68Q10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Bride, Hadrien; Kouchnarenko, Olga; Peureux, Fabien Constraint solving for verifying modal specifications of workflow nets with data. (English) Zbl 1461.68111 Mazzara, Manuel (ed.) et al., Perspectives of system informatics. 10th international Andrei Ershov informatics conference, PSI 2015, in memory of Helmut Veith, Kazan and Innopolis, Russia, August 24–27, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9609, 75-90 (2016). MSC: 68Q60 68Q85 90B70 × Cite Format Result Cite Review PDF Full Text: DOI
Sharma, Asankhaya; Wang, Shengyi; Costea, Andreea; Hobor, Aquinas; Chin, Wei-Ngan Certified reasoning with infinity. (English) Zbl 1427.68054 Bjørner, Nikolaj (ed.) et al., FM 2015: formal methods. 20th international symposium, Oslo, Norway, June 24–26, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9109, 496-513 (2015). MSC: 68N30 03B70 68V15 × Cite Format Result Cite Review PDF Full Text: DOI
Lechner, Antonia; Ouaknine, Joel; Worrell, James On the complexity of linear arithmetic with divisibility. (English) Zbl 1401.03070 Proceedings of the 2015 30th annual ACM/IEEE symposium on logic in computer science, LICS 2015, Kyoto, Japan, July 6–10, 2015. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4799-8875-4). 667-676 (2015). MSC: 03D15 03B25 03F30 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Bromberger, Martin; Sturm, Thomas; Weidenbach, Christoph Linear integer arithmetic revisited. (English) Zbl 1432.68596 Felty, Amy P. (ed.) et al., Automated deduction – CADE-25. 25th international conference on automated deduction, Berlin, Germany, August 1–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9195, 623-637 (2015). MSC: 68W30 68Q60 68R07 68V15 90C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Mousavi, Hamoon; Shallit, Jeffrey Mechanical proofs of properties of the Tribonacci word. (English) Zbl 1350.68218 Manea, Florin (ed.) et al., Combinatorics on words. 10th international conference, WORDS 2015, Kiel, Germany, September 14–17, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-23659-9/pbk; 978-3-319-23660-5/ebook). Lecture Notes in Computer Science 9304, 170-190 (2015). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 68R15 03B25 03B35 11B85 68T15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Furcy, David; Micka, Samuel; Summers, Scott M. Optimal program-size complexity for self-assembly at temperature 1 in 3D. (English) Zbl 1364.68195 Phillips, Andrew (ed.) et al., DNA computing and molecular programming. 21st international conference, DNA 21, Boston and Cambridge, MA, USA, August 17–21, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21998-1/pbk; 978-3-319-21999-8/ebook). Lecture Notes in Computer Science 9211, 71-86 (2015). MSC: 68Q05 68Q10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bielecki, Włodzimierz; Kraska, Krzysztof; Klimek, Tomasz Using basis dependence distance vectors in the modified Floyd-Warshall algorithm. (English) Zbl 1319.05123 J. Comb. Optim. 30, No. 2, 253-275 (2015). MSC: 05C85 68R10 68N20 × Cite Format Result Cite Review PDF Full Text: DOI
Chen, Ho-Lin; Doty, David; Soloveichik, David Deterministic function computation with chemical reaction networks. (English) Zbl 1353.68081 Nat. Comput. 13, No. 4, 517-534 (2014). MSC: 68Q05 68Q10 92C40 × Cite Format Result Cite Review PDF Full Text: DOI Link
Demri, Stéphane; Dhar, Amit; Sangnier, Arnaud Equivalence between model-checking flat counter systems and Presburger arithmetic. (English) Zbl 1393.68101 Ouaknine, Joël (ed.) et al., Reachability problems. 8th international workshop, RP 2014, Oxford, UK, September 22–24, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-11438-5/pbk). Lecture Notes in Computer Science 8762, 85-97 (2014). MSC: 68Q60 03B44 03F30 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Buldt, Bernd The scope of Gödel’s first incompleteness theorem. (English) Zbl 1339.03004 Log. Univers. 8, No. 3-4, 499-552 (2014). MSC: 03A05 03F40 03-02 × Cite Format Result Cite Review PDF Full Text: DOI
Cook, Byron; Kroening, Daniel; Rümmer, Philipp; Wintersteiger, Christoph M. Ranking function synthesis for bit-vector relations. (English) Zbl 1291.68138 Form. Methods Syst. Des. 43, No. 1, 93-120 (2013). MSC: 68N30 68T20 × Cite Format Result Cite Review PDF Full Text: DOI Link
Fu, Yuxi The value-passing calculus. (English) Zbl 1390.68469 Liu, Zhiming (ed.) et al., Theories of programming and formal methods. Essays dedicated to Jifeng He on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-39697-7/pbk). Lecture Notes in Computer Science 8051, 166-195 (2013). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Fietzke, Arnaud; Weidenbach, Christoph Superposition as a decision procedure for timed automata. (English) Zbl 1262.68159 Math. Comput. Sci. 6, No. 4, 409-425 (2012). MSC: 68T15 03B25 × Cite Format Result Cite Review PDF Full Text: DOI
Choffrut, Christian; Malcher, Andreas; Mereghetti, Carlo; Palano, Beatrice First-order logics: some characterizations and closure properties. (English) Zbl 1279.68143 Acta Inf. 49, No. 4, 225-248 (2012). MSC: 68Q45 68Q19 × Cite Format Result Cite Review PDF Full Text: DOI
Solovay, Robert M.; Arthan, R. D.; Harrison, John Some new results on decidability for elementary algebra and geometry. (English) Zbl 1259.03020 Ann. Pure Appl. Logic 163, No. 12, 1765-1802 (2012). Reviewer: J. M. Plotkin (East Lansing) MSC: 03B25 03C10 03C65 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Àlvarez, Carme; Chatzigiannakis, Ioannis; Duch, Amalia; Gabarró, Joaquim; Michail, Othon; Serna, Maria; Spirakis, Paul G. Computational models for networks of tiny artifacts: a survey. (English) Zbl 1298.68039 Comput. Sci. Rev. 5, No. 1, 7-25 (2011). MSC: 68M10 68M14 68T42 68M12 68Q05 68-02 × Cite Format Result Cite Review PDF Full Text: DOI
Michail, Othon; Chatzigiannakis, Ioannis; Spirakis, Paul G. Mediated population protocols. (English) Zbl 1218.68082 Theor. Comput. Sci. 412, No. 22, 2434-2450 (2011). MSC: 68Q05 68M07 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Aupy, Guillaume; Bournez, Olivier On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\). (English) Zbl 1216.68107 Theor. Comput. Sci. 412, No. 22, 2262-2267 (2011). MSC: 68Q05 68Q10 60H10 × Cite Format Result Cite Review PDF Full Text: DOI
Kontinen, Juha; Niemistö, Hannu Extensions of MSO and the monadic counting hierarchy. (English) Zbl 1215.68105 Inf. Comput. 209, No. 1, 1-19 (2011). Reviewer: Galina Jiraskova (Košice) MSC: 68Q19 03C80 × Cite Format Result Cite Review PDF Full Text: DOI
Doty, David; Patitz, Matthew J.; Summers, Scott M. Limitations of self-assembly at temperature 1. (English) Zbl 1234.05052 Theor. Comput. Sci. 412, No. 1-2, 145-158 (2011). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05B45 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Sturm, Thomas; Zengler, Christoph Parametric quantified SAT solving. (English) Zbl 1321.68322 Watt, Stephen M. (ed.), Proceedings of the 35th international symposium on symbolic and algebraic computation, ISSAC 2010, Munich, Germany, July 25–28, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0150-3). 77-84 (2010). MSC: 68Q25 03B05 03C10 03G05 × Cite Format Result Cite Review PDF Full Text: DOI
Nipkow, Tobias Linear quantifier elimination. (English) Zbl 1207.68339 J. Autom. Reasoning 45, No. 2, 189-212 (2010). MSC: 68T15 03C10 × Cite Format Result Cite Review PDF Full Text: DOI
Brillout, Angelo; Kroening, Daniel; Rümmer, Philipp; Wahl, Thomas An interpolating sequent calculus for quantifier-free Presburger arithmetic. (English) Zbl 1291.03112 Giesl, Jürgen (ed.) et al., Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16–19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14202-4/pbk). Lecture Notes in Computer Science 6173. Lecture Notes in Artificial Intelligence, 384-399 (2010). MSC: 03F30 03B35 03C40 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Ihlemann, Carsten; Sofronie-Stokkermans, Viorica On hierarchical reasoning in combinations of theories. (English) Zbl 1291.03018 Giesl, Jürgen (ed.) et al., Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16–19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14202-4/pbk). Lecture Notes in Computer Science 6173. Lecture Notes in Artificial Intelligence, 30-45 (2010). MSC: 03B35 68T15 × Cite Format Result Cite Review PDF Full Text: DOI Link
Falke, Stephan; Kapur, Deepak Operational termination of conditional rewriting with built-in numbers and semantic data structures. (English) Zbl 1294.68096 Middeldorp, Aart (ed.), Proceedings of the 8th international workshop on reduction strategies in rewriting and programming (WRS 2008), Castle of Hagenberg, Austria, July 14, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 237, 75-90 (2009). MSC: 68Q42 68P05 × Cite Format Result Cite Review PDF Full Text: DOI
Lugiez, Denis Forward analysis of dynamic network of pushdown systems is easier without order. (English) Zbl 1260.68105 Bournez, Olivier (ed.) et al., Reachability problems. 3rd international workshop, RP 2009, Palaiseau, France, September 23–25, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04419-9/pbk). Lecture Notes in Computer Science 5797, 127-140 (2009). MSC: 68N30 68Q45 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Lasaruk, Aless; Sturm, Thomas Effective quantifier elimination for Presburger arithmetic with infinity. (English) Zbl 1260.68482 Gerdt, Vladimir P. (ed.) et al., Computer algebra in scientific computing. 11th international workshop, CASC 2009, Kobe, Japan, September 13–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04102-0/pbk). Lecture Notes in Computer Science 5743, 195-212 (2009). MSC: 68W30 03C10 03F30 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Boigelot, Bernard; Brusten, Julien; Leroux, Jérôme A generalization of Semenov’s theorem to automata over real numbers. (English) Zbl 1250.03061 Schmidt, Renate A. (ed.), Automated deduction – CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2–7, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02958-5/pbk). Lecture Notes in Computer Science 5663. Lecture Notes in Artificial Intelligence, 469-484 (2009). MSC: 03D05 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Boigelot, Bernard; Brusten, Julien A generalization of Cobham’s theorem to automata over real numbers. (English) Zbl 1172.68029 Theor. Comput. Sci. 410, No. 18, 1694-1703 (2009). MSC: 68Q45 03D05 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI Link
Boigelot, Bernard; Degbomont, Jean-François Partial projection of sets represented by finite automata, with application to state-space visualization. (English) Zbl 1234.68084 Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 200-211 (2009). MSC: 68P05 68Q45 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI Link
Angluin, Dana; Aspnes, James; Eisenstat, David Fast computation by population protocols with a leader. (English) Zbl 1267.68306 Distrib. Comput. 21, No. 3, 183-199 (2008). MSC: 68W15 × Cite Format Result Cite Review PDF Full Text: DOI
Bartlett, Mark; Bate, Iain; Kazakov, Dimitar Challenges in relational learning for real-time systems applications. (English) Zbl 1156.68518 Železný, Filip (ed.) et al., Inductive logic programming. 18th international conference, ILP 2008, Prague, Czech Republic, September 10–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85927-7/pbk). Lecture Notes in Computer Science 5194. Lecture Notes in Artificial Intelligence, 42-58 (2008). MSC: 68T05 68N17 × Cite Format Result Cite Review PDF Full Text: DOI
Chaieb, Amine; Nipkow, Tobias Proof synthesis and reflection for linear arithmetic. (English) Zbl 1171.03006 J. Autom. Reasoning 41, No. 1, 33-59 (2008). Reviewer: Viorica Sofronie-Stokkermans (Saarbrücken) MSC: 03B35 03C10 68T15 × Cite Format Result Cite Review PDF Full Text: DOI
Falke, Stephan; Kapur, Deepak Dependency pairs for rewriting with built-in numbers and semantic data structures. (English) Zbl 1145.68445 Voronkov, Andrei (ed.), Rewriting techniques and applications. 19th international conference, RTA 2008, Hagenberg, Austria, July 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-70588-8/pbk). Lecture Notes in Computer Science 5117, 94-109 (2008). MSC: 68Q42 68P10 × Cite Format Result Cite Review PDF Full Text: DOI
Barra, Mathias A characterisation of the relations definable in Presburger arithmetic. (English) Zbl 1140.03311 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 258-269 (2008). MSC: 03D20 03F30 × Cite Format Result Cite Review PDF Full Text: DOI
Caniart, Nicolas; Fleury, Emmanuel; Leroux, Jérôme; Zeitoun, Marc Accelerating interpolation-based model-checking. (English) Zbl 1134.68400 Ramakrishnan, C. R. (ed.) et al., Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29–April 6, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78799-0/pbk). Lecture Notes in Computer Science 4963, 428-442 (2008). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Angluin, Dana; Aspnes, James; Eisenstat, David; Ruppert, Eric The computational power of population protocols. (English) Zbl 1266.68043 Distrib. Comput. 20, No. 4, 279-304 (2007). MSC: 68M14 68Q99 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Bojańczyk, Mikołaj A new algorithm for testing if a regular language is locally threshold testable. (English) Zbl 1184.68307 Inf. Process. Lett. 104, No. 3, 91-94 (2007). MSC: 68Q45 68W05 × Cite Format Result Cite Review PDF Full Text: DOI
Lasaruk, Aless; Sturm, Thomas Weak quantifier elimination for the full linear theory of the integers. (English) Zbl 1154.68112 Appl. Algebra Eng. Commun. Comput. 18, No. 6, 545-574 (2007). MSC: 68W30 03C10 × Cite Format Result Cite Review PDF Full Text: DOI
Berstel, Jean; Perrin, Dominique The origins of combinatorics on words. (English) Zbl 1111.68092 Eur. J. Comb. 28, No. 3, 996-1022 (2007). MSC: 68R15 68-03 01A50 01A60 × Cite Format Result Cite Review PDF Full Text: DOI
Angluin, Dana; Aspnes, James; Eisenstat, David Stably computable predicates are semilinear. (English) Zbl 1314.68054 Proceedings of the 25th annual ACM symposium on principles of distributed computing, PODC ’06, Denver, CO, USA, July 23–26, 2006. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-59593-384-0). 292-299 (2006). MSC: 68M14 68M10 68M12 68Q05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Angluin, Dana; Aspnes, James; Diamadi, Zoë; Fischer, Michael J. Computation in networks of passively mobile finite-state sensors. (English) Zbl 1266.68042 Distrib. Comput. 18, No. 4, 235-253 (2006). MSC: 68M14 68M10 × Cite Format Result Cite Review PDF Full Text: DOI
Egidi, Lavinia; Terenziani, Paolo A mathematical framework for the semantics of symbolic languages representing periodic time. (English) Zbl 1113.68063 Ann. Math. Artif. Intell. 46, No. 3, 317-347 (2006). MSC: 68Q55 68T30 × Cite Format Result Cite Review PDF Full Text: DOI
Demri, Stéphane LTL over integer periodicity constraints. (English) Zbl 1097.68073 Theor. Comput. Sci. 360, No. 1-3, 96-123 (2006). MSC: 68Q60 03B44 03D05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Manukyan, S. N. Algebras of recursively enumerable sets and their applications to fuzzy logic. (English. Russian original) Zbl 1145.03324 J. Math. Sci., New York 130, No. 2, 4598-4606 (2005); translation from Zap. Nauchn. Semin. POMI 304, 75-98 (2003). MSC: 03D25 03B52 × Cite Format Result Cite Review PDF Full Text: DOI
Zaslavskiĭ, I. D. Formal axiomatic theories based on a three-valued logic. (English. Russian original) Zbl 1145.03014 J. Math. Sci., New York 130, No. 2, 4578-4597 (2005); translation from Zap. Nauchn. Semin. POMI 304, 19-74 (2003). MSC: 03B50 03F25 03F30 × Cite Format Result Cite Review PDF Full Text: DOI
Rond, Guillaume On the linearity of Artin functions. (Sur la linéarité de la fonction de Artin.) (French. English summary) Zbl 1109.14006 Ann. Sci. Éc. Norm. Supér. (4) 38, No. 6, 979-988 (2005). Reviewer: Marcel Morales (Saint-Martin-d’Heres) MSC: 14B12 13B10 13F25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Numdam EuDML
Laskowski, Michael C. An application of Kochen’s theorem. (English) Zbl 1057.03027 J. Symb. Log. 68, No. 4, 1181-1188 (2003). MSC: 03C60 12J10 × Cite Format Result Cite Review PDF Full Text: DOI Euclid
Martin, Eric; Sharma, Arun; Stephan, Frank Learning power and language expressiveness. (English) Zbl 1038.68098 Theor. Comput. Sci. 298, No. 2, 365-383 (2003). MSC: 68T05 68W05 × Cite Format Result Cite Review PDF Full Text: DOI