Document Search Results

from until

Sorting

Found 2 Documents (Results 1–2)

Newest Citations Relevance

Proving almost-sure innermost termination of probabilistic term rewriting using dependency pairs. (English) Zbl 07838496

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, 344-364 (2023).

MSC: 03B35 68V15

Cite Review PDF

Full Text: DOI arXiv

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

Filter Results by …

Author

Year of Publication

2023 (1)
2021 (1)

Main Field

68-XX (2)
03-XX (1)
90-XX (1)

all top 3

Software

KoAT (2)
AProVE (1)
Apron (1)
NaTT (1)
Nagoya Termination Tool (1)
OCaml (1)
RAML (1)
TPDB (1)
TcT (1)
Tyrolean (1)
z3 (1)