AUTOMATED TERMINATION IN MODEL-CHECKING MODULO THEORIES (Q2841996): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Verifying programs with unreliable channels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordering by Divisibility in Abstract Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank | |||
Normal rank | |||
Latest revision as of 16:18, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | AUTOMATED TERMINATION IN MODEL-CHECKING MODULO THEORIES |
scientific article |
Statements
AUTOMATED TERMINATION IN MODEL-CHECKING MODULO THEORIES (English)
0 references
30 July 2013
0 references
infinite state model checking
0 references
well-quasi-orderings
0 references
satisfiability modulo theories
0 references
