Pages that link to "Item:Q1378382"
From MaRDI portal
The following pages link to A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters (Q1378382):
Displaying 5 items.
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Transformations of logic programs on infinite lists (Q3585155) (← links)
- Reachability in Parameterized Systems: All Flavors of Threshold Automata (Q5009433) (← links)
- (Q5020652) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)