Formalizing and Reasoning about Quality

DOI10.1007/978-3-642-39212-2_3zbMath1335.68130OpenAlexW1605697145MaRDI QIDQ5327419

Udi Boker, Shaull Almagor, Orna Kupferman

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39212-2_3

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (9)

Synthesis with rational environments ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ Stochastization of Weighted Automata ⋮ Inherent Vacuity in Lattice Automata ⋮ Specifiable robustness in reactive synthesis ⋮ On High-Quality Synthesis ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Bidirectional nested weighted automata

This page was built for publication: Formalizing and Reasoning about Quality