{"id":"https://openalex.org/W4414147955","doi":"https://doi.org/10.1017/s147106842510015x","title":"Hiord$^{{\\kern2pt}\\sharp}$: An Approach to the Specification and Verification of Higher-Order (C)LP Programs","display_name":"Hiord$^{{\\kern2pt}\\sharp}$: An Approach to the Specification and Verification of Higher-Order (C)LP Programs","publication_year":2025,"publication_date":"2025-07-01","ids":{"openalex":"https://openalex.org/W4414147955","doi":"https://doi.org/10.1017/s147106842510015x"},"language":"en","primary_location":{"id":"doi:10.1017/s147106842510015x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842510015x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D8A921D5C8732580B46E5C1EDE909FBF/S147106842510015Xa.pdf/div-class-title-hiord-span-class-inlineformula-span-class-alternatives-img-class-inline-graphic-mathjax-alternative-mathjax-alt-graphic-mathjax-off-data-mimesubtype-png-data-type-src-staticdomain-binary-version-id-urn-cambridge-org-id-binary-20250908094028318-0846-s147106842510015x-s147106842510015x-inline1-png-span-class-mathjax-tex-wrapper-data-mathjax-type-texmath-span-class-tex-math-mathjax-tex-math-mathjax-on-kern2pt-sharp-span-span-span-span-an-approach-to-the-specification-and-verification-of-higher-order-c-lp-programs-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D8A921D5C8732580B46E5C1EDE909FBF/S147106842510015Xa.pdf/div-class-title-hiord-span-class-inlineformula-span-class-alternatives-img-class-inline-graphic-mathjax-alternative-mathjax-alt-graphic-mathjax-off-data-mimesubtype-png-data-type-src-staticdomain-binary-version-id-urn-cambridge-org-id-binary-20250908094028318-0846-s147106842510015x-s147106842510015x-inline1-png-span-class-mathjax-tex-wrapper-data-mathjax-type-texmath-span-class-tex-math-mathjax-tex-math-mathjax-on-kern2pt-sharp-span-span-span-span-an-approach-to-the-specification-and-verification-of-higher-order-c-lp-programs-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119601361","display_name":"MARCO CICCAL\u00c8","orcid":"https://orcid.org/0009-0000-8821-0587"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"MARCO CICCAL\u00c8","raw_affiliation_strings":["IMDEA Software Institute"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5107179492","display_name":"DANIEL JURJO-RIVAS","orcid":"https://orcid.org/0000-0001-6215-1080"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"DANIEL JURJO-RIVAS","raw_affiliation_strings":["IMDEA Software Institute"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008145265","display_name":"Jos\u00e9 F. Morales","orcid":"https://orcid.org/0000-0001-9782-8135"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"JOSE F. MORALES","raw_affiliation_strings":["IMDEA Software Institute"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030520172","display_name":"Pedro L\u00f3pez-Garc\u00eda","orcid":"https://orcid.org/0000-0002-1092-2071"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"PEDRO L\u00d3PEZ-GARC\u00cdA","raw_affiliation_strings":["IMDEA Software Institute","Spanish Council for Scientific Research, IMDEA Software Institute, Madrid, Spain (e-mails:"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"Spanish Council for Scientific Research, IMDEA Software Institute, Madrid, Spain (e-mails:","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073531919","display_name":"Manuel V. Hermenegildo","orcid":"https://orcid.org/0000-0002-7583-323X"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"MANUEL V. HERMENEGILDO","raw_affiliation_strings":["IMDEA Software Institute"],"affiliations":[{"raw_affiliation_string":"IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5119601361"],"corresponding_institution_ids":["https://openalex.org/I4210162154"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2395176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"4","first_page":"612","last_page":"630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11986","display_name":"Scientific Computing and Data Management","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11986","display_name":"Scientific Computing and Data Management","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9926000237464905,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/predicate","display_name":"Predicate (mathematical logic)","score":0.6704000234603882},{"id":"https://openalex.org/keywords/assertion","display_name":"Assertion","score":0.6468999981880188},{"id":"https://openalex.org/keywords/predicate-transformer-semantics","display_name":"Predicate transformer semantics","score":0.6044999957084656},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.536899983882904},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.5328999757766724},{"id":"https://openalex.org/keywords/predicate-abstraction","display_name":"Predicate abstraction","score":0.48919999599456787},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4343000054359436},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.421999990940094},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.4081999957561493},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.39750000834465027}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.866100013256073},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8123000264167786},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6704000234603882},{"id":"https://openalex.org/C40422974","wikidata":"https://www.wikidata.org/wiki/Q741248","display_name":"Assertion","level":2,"score":0.6468999981880188},{"id":"https://openalex.org/C30128091","wikidata":"https://www.wikidata.org/wiki/Q291929","display_name":"Predicate transformer semantics","level":4,"score":0.6044999957084656},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.536899983882904},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.5328999757766724},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.48919999599456787},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.39750000834465027},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.36640000343322754},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.3628000020980835},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.3573000133037567},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34619998931884766},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.31220000982284546},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.31029999256134033},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2709999978542328},{"id":"https://openalex.org/C202973057","wikidata":"https://www.wikidata.org/wiki/Q7380130","display_name":"Runtime verification","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C61423126","wikidata":"https://www.wikidata.org/wiki/Q187432","display_name":"Scripting language","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C201677973","wikidata":"https://www.wikidata.org/wiki/Q1209840","display_name":"Specification language","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s147106842510015x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842510015x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D8A921D5C8732580B46E5C1EDE909FBF/S147106842510015Xa.pdf/div-class-title-hiord-span-class-inlineformula-span-class-alternatives-img-class-inline-graphic-mathjax-alternative-mathjax-alt-graphic-mathjax-off-data-mimesubtype-png-data-type-src-staticdomain-binary-version-id-urn-cambridge-org-id-binary-20250908094028318-0846-s147106842510015x-s147106842510015x-inline1-png-span-class-mathjax-tex-wrapper-data-mathjax-type-texmath-span-class-tex-math-mathjax-tex-math-mathjax-on-kern2pt-sharp-span-span-span-span-an-approach-to-the-specification-and-verification-of-higher-order-c-lp-programs-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2507.17233","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.17233","pdf_url":"https://arxiv.org/pdf/2507.17233","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"}],"best_oa_location":{"id":"doi:10.1017/s147106842510015x","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s147106842510015x","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/D8A921D5C8732580B46E5C1EDE909FBF/S147106842510015Xa.pdf/div-class-title-hiord-span-class-inlineformula-span-class-alternatives-img-class-inline-graphic-mathjax-alternative-mathjax-alt-graphic-mathjax-off-data-mimesubtype-png-data-type-src-staticdomain-binary-version-id-urn-cambridge-org-id-binary-20250908094028318-0846-s147106842510015x-s147106842510015x-inline1-png-span-class-mathjax-tex-wrapper-data-mathjax-type-texmath-span-class-tex-math-mathjax-tex-math-mathjax-on-kern2pt-sharp-span-span-span-span-an-approach-to-the-specification-and-verification-of-higher-order-c-lp-programs-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414147955.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1532795106","https://openalex.org/W1533556407","https://openalex.org/W1965377774","https://openalex.org/W1982243747","https://openalex.org/W2075352622","https://openalex.org/W2116325485","https://openalex.org/W2142044962","https://openalex.org/W2219407530","https://openalex.org/W2592915588","https://openalex.org/W2778826798","https://openalex.org/W3208361496","https://openalex.org/W4280605585"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Abstract":[0],"Higher-order":[1,105],"constructs":[2],"enable":[3],"more":[4],"expressive":[5],"and":[6,97,130,135,197],"concise":[7],"code":[8],"by":[9,15,183],"allowing":[10],"procedures":[11],"to":[12,102,140,143,168,187],"be":[13,26],"parameterized":[14],"other":[16],"procedures.":[17],"Assertions":[18],"allow":[19],"expressing":[20],"partial":[21],"program":[22],"specifications,":[23],"which":[24,118],"can":[25,41],"verified":[27],"either":[28],"at":[29,147],"compile":[30,148],"time":[31,35],"(statically)":[32],"or":[33],"run":[34],"(dynamically).":[36],"In":[37],"higher-order":[38,44,58,77,81],"programs,":[39],"assertions":[40,59,182],"also":[42],"describe":[43],"arguments.":[45],"While":[46],"in":[47],"the":[48,86,120,128,157,161,204],"context":[49],"of":[50,57,116,132],"(constraint)":[51],"logic":[52],"programming":[53],"((C)LP),":[54],"run-time":[55],"verification":[56,65],"has":[60],"received":[61],"some":[62],"attention,":[63],"compile-time":[64],"remains":[66],"relatively":[67],"unexplored.":[68],"We":[69,126,164],"propose":[70],"a":[71,113,144,152,194],"novel":[72],"approach":[73,93],"for":[74,90,178],"statically":[75],"verifying":[76],"(C)LP":[78],"programs":[79,179],"with":[80,160,180],"assertions.":[82,163],"Although":[83],"we":[84,98,191],"use":[85],"Ciao":[87,122,205],"assertion":[88,124],"language":[89],"illustration,":[91],"our":[92],"is":[94,100],"quite":[95],"general,":[96],"believe":[99],"applicable":[101],"similar":[103],"contexts.":[104],"arguments":[106],"are":[107],"described":[108],"using":[109,172],"predicate":[110,145,158,162,185],"properties":[111,134,171,186],"\u2013":[112],"special":[114],"kind":[115],"property":[117,146,159],"exploits":[119],"(":[121],")":[123],"language.":[125],"refine":[127],"syntax":[129],"semantics":[131],"these":[133,170],"introduce":[136],"an":[137,173],"abstract":[138,174],"criterion":[139],"determine":[141],"conformance":[142],"time,":[149],"based":[150],"on":[151,193],"semantic":[153],"order":[154],"relation":[155],"comparing":[156],"then":[165],"show":[166],"how":[167],"handle":[169],"interpretation-based":[175],"static":[176],"analyzer":[177],"first-order":[181,188],"reducing":[184],"properties.":[189],"Finally,":[190],"report":[192],"prototype":[195],"implementation":[196],"evaluate":[198],"it":[199],"through":[200],"various":[201],"examples":[202],"within":[203],"system.":[206]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-09-12T00:00:00"}