A Framework for Ranking Vacuity Results

DOI10.1007/978-3-319-02444-8_12MaRDI QIDQ5166686zbMATH OpenOpenAlexFDO

Authors Shoham Ben-David, Orna Kupferman

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_12

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
• Interpretation of results of ranking methods with the aid of probabilistic sets
• A Common Framework for Describing Some Outranking Methods
• Simple, Robust and Optimal Ranking from Pairwise Comparisons
• Ranking with Partial Information: A Method and an Application
• Ranking Methods Based on Dominance Measures Accounting for Imprecision
• A Survey of Ranking Theory
• A Survey of Ranking Theory

Cited in

(7)

• Spanning the spectrum from safety to liveness
• On relative and probabilistic finite counterability
• Timed vacuity
• Inherent vacuity in lattice automata
• Vacuity in Testing
• Monotonicity characterizations of regular languages
• Monotonicity characterizations of regular languages

This page was built for publication: A Framework for Ranking Vacuity Results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166686)