Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (Q2802436): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2161089445 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1410.5089 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:27, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs |
scientific article |
Statements
Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (English)
0 references
26 April 2016
0 references
termination
0 references
non-termination
0 references
lexicographic ranking functions
0 references
bit-vector ranking functions
0 references
floating-point ranking functions
0 references
