{"id":"https://openalex.org/W1521831839","doi":"https://doi.org/10.1007/3-540-54415-1_58","title":"Polynomial recursion analysis in pascal like programs","display_name":"Polynomial recursion analysis in pascal like programs","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1521831839","doi":"https://doi.org/10.1007/3-540-54415-1_58","mag":"1521831839"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-54415-1_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54415-1_58","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":"book-chapter","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/A5023824004","display_name":"Dieter Armbruster","orcid":"https://orcid.org/0000-0001-9681-9173"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dieter Armbruster","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Stuttgart, D-7000, Stuttgart 1, Germany","Universit\u00e4t Stuttgart"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Stuttgart, D-7000, Stuttgart 1, Germany","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"Universit\u00e4t Stuttgart","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023824004"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17953547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"447","last_page":"458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9998000264167786,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9991000294685364,"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/computer-science","display_name":"Computer science","score":0.832339882850647},{"id":"https://openalex.org/keywords/pascal","display_name":"Pascal (unit)","score":0.7711954116821289},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7148759365081787},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6951901316642761},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.6590608358383179},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.638508677482605},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6030340790748596},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5608798861503601},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5043267011642456},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.47605225443840027},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4480932354927063},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3428475856781006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33796724677085876},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.16449326276779175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15368804335594177},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.068322092294693}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.832339882850647},{"id":"https://openalex.org/C75608658","wikidata":"https://www.wikidata.org/wiki/Q44395","display_name":"Pascal (unit)","level":2,"score":0.7711954116821289},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7148759365081787},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6951901316642761},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.6590608358383179},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.638508677482605},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6030340790748596},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5608798861503601},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5043267011642456},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.47605225443840027},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4480932354927063},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3428475856781006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33796724677085876},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.16449326276779175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15368804335594177},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.068322092294693}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-54415-1_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54415-1_58","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1980821888","https://openalex.org/W2018426736","https://openalex.org/W2044614616","https://openalex.org/W2056853566","https://openalex.org/W2068576411"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W2099490078","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}