{"id":"https://openalex.org/W4416937008","doi":"https://doi.org/10.4230/lipics.csl.2026.45","title":"Reasoning About Quality in Hyperproperties","display_name":"Reasoning About Quality in Hyperproperties","publication_year":2025,"publication_date":"2025-11-29","ids":{"openalex":"https://openalex.org/W4416937008","doi":"https://doi.org/10.4230/lipics.csl.2026.45"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2512.00500","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.00500","pdf_url":"https://arxiv.org/pdf/2512.00500","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.00500","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120580076","display_name":"Samuel Graepler","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Graepler, Samuel","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Leipzig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Leipzig, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066787748","display_name":"Benjamin Monmege","orcid":"https://orcid.org/0000-0002-4717-9955"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monmege, Benjamin","raw_affiliation_strings":["Aix Marseille Univ, CNRS, LIS, Marseille, France"],"raw_orcid":"https://orcid.org/0000-0002-4717-9955","affiliations":[{"raw_affiliation_string":"Aix Marseille Univ, CNRS, LIS, Marseille, France","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Talbot, Jean-Marc","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Talbot, Jean-Marc","raw_affiliation_strings":["Aix Marseille Univ, CNRS, LIS, Marseille, France","Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aix Marseille Univ, CNRS, LIS, Marseille, France","institution_ids":[]},{"raw_affiliation_string":"Univ. Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120580076"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36351816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.41990000009536743,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.41990000009536743,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.18940000236034393,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.17829999327659607,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6987000107765198},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6438000202178955},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5990999937057495},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.5289999842643738},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.48010000586509705},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4797999858856201},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.41990000009536743},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7163000106811523},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6987000107765198},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6438000202178955},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5990999937057495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5388000011444092},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.5289999842643738},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.48010000586509705},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4797999858856201},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.41990000009536743},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40540000796318054},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.3467000126838684},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3402000069618225},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C192183473","wikidata":"https://www.wikidata.org/wiki/Q131133","display_name":"Determinism","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.32659998536109924},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.32600000500679016},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2512.00500","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.00500","pdf_url":"https://arxiv.org/pdf/2512.00500","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-05531778v1","is_oa":true,"landing_page_url":"https://amu.hal.science/hal-05531778","pdf_url":"https://amu.hal.science/hal-05531778/document","source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"34th EACSL Annual Conference on Computer Science Logic (CSL 2026), 2026, Paris, France. ⟨10.4230/LIPIcs.CSL.2026.45⟩","raw_type":"Conference papers"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25470","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.45","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol363-csl2026/LIPIcs.CSL.2026.45/LIPIcs.CSL.2026.45.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.48550/arxiv.2512.00500","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.00500","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.csl.2026.45","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2026.45","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.00500","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.00500","pdf_url":"https://arxiv.org/pdf/2512.00500","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7179871770","display_name":null,"funder_award_id":"ANR-23-PECL-0009 TRUSTINCloudS","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G999378941","display_name":"S\u00e9curit\u00e9 des infrastructures Cloud","funder_award_id":"ANR-23-PECL-0009","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320309911","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Hyperproperties":[0],"allow":[1],"one":[2],"to":[3,34,49],"specify":[4],"properties":[5,32,63],"of":[6,14,19,30,38,53,57,132,144],"systems":[7,68],"that":[8],"inherently":[9],"involve":[10],"not":[11,70],"single":[12],"executions":[13],"the":[15,36,47,58,103,116,125,133,141],"system,":[16],"but":[17],"several":[18],"them":[20],"at":[21],"once:":[22],"observational":[23],"determinism":[24],"and":[25,94],"non-inference":[26],"are":[27],"two":[28],"examples":[29],"such":[31,72],"used":[33],"study":[35],"security":[37,62],"systems.":[39,54],"Logics":[40],"like":[41],"HyperLTL":[42],"have":[43],"been":[44],"studied":[45],"in":[46,82,102],"past":[48],"model":[50,135,142],"check":[51],"hyperproperties":[52],"However,":[55],"most":[56],"time,":[59],"requiring":[60],"strict":[61],"is":[64,118,127],"actually":[65],"ineffective":[66],"as":[67,138,140],"do":[69],"meet":[71],"requirements.":[73],"To":[74],"overcome":[75],"this":[76],"issue,":[77],"we":[78],"introduce":[79],"qualitative":[80],"reasoning":[81],"HyperLTL,":[83],"inspired":[84],"by":[85,91,108],"a":[86,97,100,111,121],"similar":[87],"work":[88],"on":[89],"LTL":[90],"Almagor,":[92],"Boker":[93],"Kupferman":[95],"where":[96],"formula":[98],"has":[99],"value":[101],"interval":[104],"[0,":[105],"1],":[106],"obtained":[107],"considering":[109],"either":[110],"propositional":[112],"quality":[113,123],"(how":[114],"much":[115],"specification":[117,126],"satisfied),":[119],"or":[120],"temporal":[122],"(when":[124],"satisfied).":[128],"We":[129],"show":[130],"decidability":[131],"approximated":[134],"checking":[136,143],"problem,":[137],"well":[139],"large":[145],"fragments.":[146]},"counts_by_year":[],"updated_date":"2025-12-03T23:12:59.920255","created_date":"2025-12-03T00:00:00"}