×

Found 33 Documents (Results 1–33)

Newest Citations Relevance
Guo, Liye; Vale, Deivid

Analyzing innermost runtime complexity through tuple interpretations. (English) Zbl 07810644

Nantes-Sobrinho, Daniele (ed.) et al., Proceedings of the 17th international workshop on logical and semantic frameworks with applications, LSFA, Belo Horizonte, Brazil, September 23–24, 2022. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 376, 34-48 (2023).
MSC:  68Q42
Cite Review PDF
Full Text: DOI arXiv
Liu, Yuandong Cyrus; Pang, Chengbin; Dietsch, Daniel; Koskinen, Eric; Le, Ton-Chanh; Portokalidis, Georgios; Xu, Jun

Proving LTL properties of bitvector programs and decompiled binaries. (English) Zbl 1520.68076

Oh, Hakjoo (ed.), Programming languages and systems. 19th Asian symposium, APLAS 2021, Chicago, IL, USA, October 17–18, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13008, 285-304 (2021).
MSC:  68Q60
Cite Review PDF
Full Text: DOI arXiv
Moosbrugger, Marcel; Bartocci, Ezio; Katoen, Joost-Pieter; Kovács, Laura

Automated termination analysis of polynomial probabilistic programs. (English) Zbl 1473.68053

Yoshida, Nobuko (ed.), Programming languages and systems. 30th European symposium on programming, ESOP 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. 12648, 491-518 (2021).
MSC:  68N30 68N19 68Q87
Cite Review PDF
Full Text: DOI arXiv
OA License
Meyer, Fabian; Hark, Marcel; Giesl, Jürgen

Inferring expected runtimes of probabilistic integer programs using expected sizes. (English) Zbl 1467.68066

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 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. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12651, 250-269 (2021).
MSC:  68Q25 90C10 90C15
Cite Review PDF
Full Text: DOI arXiv
OA License
Guéneau, Armaël; Jourdan, Jacques-Henri; Charguéraud, Arthur; Pottier, François

Formal proof and analysis of an incremental cycle detection algorithm. (English) Zbl 07649967

Harrison, John (ed.) et al., 10th international conference on interactive theorem proving, ITP 2019, September 9–12, 2019, Portland, OR, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 141, Article 18, 20 p. (2019).
MSC:  68Q60
Cite Review PDF
Full Text: DOI
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes

Sparse tiling through overlap closures for termination of string rewriting. (English) Zbl 1528.68163

Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 21, 21 p. (2019).
MSC:  68Q42 68Q45
Cite Review PDF
Full Text: DOI arXiv
Ben-Amram, Amir M.; Hamilton, Geoff W.

Tight worst-case bounds for polynomial loop programs. (English) Zbl 1524.68075

Bojańczyk, Mikołaj (ed.) et al., Foundations of software science and computation structures. 22nd international conference, FOSSACS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11425, 80-97 (2019).
MSC:  68N30 68Q25
Cite Review PDF
Full Text: DOI
OA License
Brázdil, Tomáš; Chatterjee, Krishnendu; Kučera, Antonín; Novotný, Petr; Velan, Dominik; Zuleger, Florian

Efficient algorithms for asymptotic bounds on termination time in VASS. (English) Zbl 1497.68328

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 185-194 (2018).
MSC:  68Q85 68W40
Cite Review PDF
Full Text: DOI arXiv
Nishida, Naoki; Winkler, Sarah

Loop detection by logically constrained term rewriting. (English) Zbl 1403.68107

Piskac, Ruzica (ed.) et al., Verified software. Theories, tools, and experiments. 10th international conference, VSTTE 2018, Oxford, UK, July 18–19, 2018. Revised selected papers. Cham: Springer (ISBN 978-3-030-03591-4/pbk; 978-3-030-03592-1/ebook). Lecture Notes in Computer Science 11294, 309-321 (2018).
MSC:  68Q42 68N30
Cite Review PDF
Full Text: DOI
Borralleras, Cristina; Brockschmidt, Marc; Larraz, Daniel; Oliveras, Albert; Rodríguez-Carbonell, Enric; Rubio, Albert

Proving termination through conditional termination. (English) Zbl 1452.68046

Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 99-117 (2017).
MSC:  68N30
Cite Review PDF
Full Text: DOI Link
Gong, Junqing; Chen, Jie; Dong, Xiaolei; Cao, Zhenfu; Tang, Shaohua

Extended nested dual system groups, revisited. (English) Zbl 1388.94057

Cheng, Chen-Mou (ed.) et al., Public-key cryptography – PKC 2016. 19th IACR international conference on practice and theory in public-key cryptography, Taipei, Taiwan, March 6–9, 2016. Proceedings. Part I. Berlin: Springer (ISBN 978-3-662-49383-0/pbk; 978-3-662-49384-7/ebook). Lecture Notes in Computer Science 9614, 133-163 (2016).
MSC:  94A60
Cite Review PDF
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software