h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)

;

In
Automated reasoning : 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8-10, 2022, proceedings / Jasmin Blanchette, Laura Kovács, Dirk Pattinson (eds.), Seiten/Artikel-Nr: 712-722

Konferenz/Event:11. International Joint Conference on Automated Reasoning , Haifa , Israel , IJCAR 2022 , 2022-08-08 - 2022-08-10

ImpressumCham : Springer

Umfang712-722

ISBN3-031-10768-3, 978-3-031-10768-9, 978-3-031-10769-6, 978-3-031-10770-2

ReiheLecture notes in computer science ; 13385

Online
DOI: 10.1007/978-3-031-10769-6_41

DOI: 10.18154/RWTH-2022-08509
URL: https://publications.rwth-aachen.de/record/852977/files/852977.pdf

Einrichtungen

  1. Lehr- und Forschungsgebiet Informatik 2 (Programmiersprachen und Verifikation) (121420)
  2. Fachgruppe Informatik (120000)

Projekte

  1. GI 274/6-2 - Automatische Terminierungs- und Komplexitätsanalyse imperativer Programme (235950644) (235950644)

OpenAccess:
Download fulltext PDF

Dokumenttyp
Contribution to a book/Contribution to a conference proceedings

Format
online, print

Sprache
English

Anmerkung
Peer reviewed article

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85135782749
WOS Core Collection: WOS:000876376400041

Interne Identnummern
RWTH-2022-08509
Datensatz-ID: 852977

Beteiligte Länder
Germany

 GO

Creative Commons Attribution CC BY 4.0 ; OpenAccess ; NationallizenzNationallizenz ; SCOPUS
QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Publication server / Open Access
Faculty of Computer Science (Fac.9)
Public records
Publications database
120000
121420
 Record created 2022-08-30, last modified 2026-03-06
Similar records


OpenAccess:
Download fulltext PDF
Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)