The polyranking principle
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1869448
- The dense linear ordering principle
- A prudent characterization of the ranked pairs rule
- A Generalization of Altman's Ordering Principle
- On the complexity of ranking
- The consistency argument for ranking functions
- scientific article; zbMATH DE number 4145652
- Monotonicity-based ranking on the basis of multiple partially specified reciprocal relations
- Ranking of Weighted Majority Rules
Cited in
(18)- Convergence: integrating termination and abort-freedom
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions
- Synthesizing ranking functions for loop programs via SVM
- On multiphase-linear ranking functions
- Time-bounded termination analysis for probabilistic programs with delays
- Temporal property verification as a program analysis task
- Policy iteration-based conditional termination and ranking functions
- Termination of single-path polynomial loop programs
- Detection of ranking functions of polynomial loop programs
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- Proving termination of nonlinear command sequences
- Efficient CTL verification via Horn constraints solving
- SVM-based method for detecting ranking functions in polynomial loop programs
- An abstract domain to infer ordinal-valued ranking functions
- Verification, Model Checking, and Abstract Interpretation
- Multiphase-linear ranking functions and their relation to recurrent sets
- Invariants for parameterised Boolean equation systems
This page was built for publication: The polyranking principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716758)
