{"id":"https://openalex.org/W2136333450","doi":"https://doi.org/10.1007/978-3-540-30579-8_1","title":"Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming","display_name":"Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2136333450","doi":"https://doi.org/10.1007/978-3-540-30579-8_1","mag":"2136333450"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30579-8_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30579-8_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007730604","display_name":"Patrick Cousot","orcid":"https://orcid.org/0000-0003-0101-9953"},"institutions":[{"id":"https://openalex.org/I29607241","display_name":"\u00c9cole Normale Sup\u00e9rieure - PSL","ror":"https://ror.org/05a0dhs15","country_code":"FR","type":"other","lineage":["https://openalex.org/I2746051580","https://openalex.org/I29607241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Patrick Cousot","raw_affiliation_strings":["\u00c9cole Normale Sup\u00e9rieure, 45 rue d\u2019Ulm, 75230 cedex 05, Paris, France","\u00c9cole Normale Sup\u00e9rieure, 45 rue d'Ulm, 75230 cedex 05, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Normale Sup\u00e9rieure, 45 rue d\u2019Ulm, 75230 cedex 05, Paris, France","institution_ids":["https://openalex.org/I29607241"]},{"raw_affiliation_string":"\u00c9cole Normale Sup\u00e9rieure, 45 rue d'Ulm, 75230 cedex 05, Paris, France","institution_ids":["https://openalex.org/I29607241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007730604"],"corresponding_institution_ids":["https://openalex.org/I29607241"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":43.6174,"has_fulltext":false,"cited_by_count":205,"citation_normalized_percentile":{"value":0.9977221,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7792298197746277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4979376792907715},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.45277196168899536},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.41636183857917786},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41541823744773865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4032602310180664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3866422176361084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3756888210773468},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32426488399505615},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2971135377883911},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.20570805668830872}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7792298197746277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4979376792907715},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.45277196168899536},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.41636183857917786},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41541823744773865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4032602310180664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3866422176361084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3756888210773468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32426488399505615},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2971135377883911},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.20570805668830872},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-30579-8_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30579-8_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.8737","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.8737","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.di.ens.fr/~cousot/publications.www/CousotVMCAI05-LNCS3385-pp1-24-bw.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W109993195","https://openalex.org/W151011738","https://openalex.org/W639861265","https://openalex.org/W1480600454","https://openalex.org/W1505135855","https://openalex.org/W1530375435","https://openalex.org/W1556566737","https://openalex.org/W1579433101","https://openalex.org/W1585404558","https://openalex.org/W1806104592","https://openalex.org/W1964730816","https://openalex.org/W1967073510","https://openalex.org/W1967184028","https://openalex.org/W1967441757","https://openalex.org/W1999613943","https://openalex.org/W1999913571","https://openalex.org/W2007074311","https://openalex.org/W2014764321","https://openalex.org/W2031373197","https://openalex.org/W2043100293","https://openalex.org/W2045427092","https://openalex.org/W2066462730","https://openalex.org/W2081810835","https://openalex.org/W2084875723","https://openalex.org/W2132661148","https://openalex.org/W2143075842","https://openalex.org/W2151759383","https://openalex.org/W2620343612","https://openalex.org/W2623163562","https://openalex.org/W2987907651","https://openalex.org/W3144358832","https://openalex.org/W3146075203","https://openalex.org/W3210839039","https://openalex.org/W4206734868","https://openalex.org/W4251912342","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2233303476","https://openalex.org/W2054908450","https://openalex.org/W2043677016","https://openalex.org/W1997135619","https://openalex.org/W2952885210","https://openalex.org/W4301799555","https://openalex.org/W2962890125","https://openalex.org/W2147838503","https://openalex.org/W2971786244","https://openalex.org/W2747249330"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":18}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}