{"id":"https://openalex.org/W2953760221","doi":"https://doi.org/10.1109/synasc.2018.00054","title":"Towards Performance Evaluation Programming","display_name":"Towards Performance Evaluation Programming","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2953760221","doi":"https://doi.org/10.1109/synasc.2018.00054","mag":"2953760221"},"language":"en","primary_location":{"id":"doi:10.1109/synasc.2018.00054","doi":"https://doi.org/10.1109/synasc.2018.00054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc.2018.00054","pdf_url":null,"source":{"id":"https://openalex.org/S7407086568","display_name":"International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5010399747","display_name":"Eneia Nicolae Todoran","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Eneia Nicolae Todoran","raw_affiliation_strings":["Department of Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I158333966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010399747"],"corresponding_institution_ids":["https://openalex.org/I158333966"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9700","issue":null,"first_page":"302","last_page":"309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.020500000566244125,"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/T10533","display_name":"Teaching and Learning Programming","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/concurrent-programming-languages","display_name":"concurrent programming languages","score":0.8529999852180481},{"id":"https://openalex.org/keywords/formal-verification","display_name":"formal verification","score":0.7870000004768372},{"id":"https://openalex.org/keywords/continuous-time-markov-chains","display_name":"continuous-time Markov chains","score":0.9520000219345093},{"id":"https://openalex.org/keywords/prism","display_name":"PRISM","score":0.8299999833106995},{"id":"https://openalex.org/keywords/dependent-types","display_name":"dependent types","score":0.8270000219345093}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8292098045349121},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.690725564956665},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.65892094373703},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.6181973814964294},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49851536750793457},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.49558699131011963},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4452313184738159},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41178545355796814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3334496021270752},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13237842917442322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08577272295951843},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/synasc.2018.00054","doi":"https://doi.org/10.1109/synasc.2018.00054","is_oa":false,"landing_page_url":"https://doi.org/10.1109/synasc.2018.00054","pdf_url":null,"source":{"id":"https://openalex.org/S7407086568","display_name":"International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W125598877","https://openalex.org/W1506492451","https://openalex.org/W1516256348","https://openalex.org/W1553136405","https://openalex.org/W1862398452","https://openalex.org/W2005192022","https://openalex.org/W2007072455","https://openalex.org/W2021089599","https://openalex.org/W2023448554","https://openalex.org/W2048417351","https://openalex.org/W2062950667","https://openalex.org/W2086673120","https://openalex.org/W2095861482","https://openalex.org/W2140597298","https://openalex.org/W2267469130","https://openalex.org/W2295923951","https://openalex.org/W2460389227","https://openalex.org/W2561675236","https://openalex.org/W2624357890","https://openalex.org/W2901430321","https://openalex.org/W2912640545","https://openalex.org/W2912904668"],"related_works":["https://openalex.org/W2901430321","https://openalex.org/W4211023112","https://openalex.org/W7099514732","https://openalex.org/W3034158217","https://openalex.org/W7100684484","https://openalex.org/W4220777158","https://openalex.org/W1575902430","https://openalex.org/W2282457726","https://openalex.org/W4396817954","https://openalex.org/W47341924"],"abstract_inverted_index":{"In":[0,77,123],"recent":[1],"work":[2],"we":[3,126],"have":[4],"introduced":[5,80,134],"an":[6,83],"experimental":[7],"concurrent":[8,46,176],"programming":[9,25,30,142],"language":[10,79],"which":[11,59],"supports":[12,101],"a":[13,24,69,89,93,105],"systematic":[14,106],"approach":[15],"to":[16,114,150,164],"performance":[17,28,120,167],"analysis":[18],"and":[19,45,169],"formal":[20,36,102,170],"verification":[21,103,171],"correlated":[22],"with":[23,143],"style":[26],"called":[27],"evaluation":[29,87,121,168],"[19].":[31],"For":[32],"the":[33,38,64,78,86,112,119,128,131,152],"purpose":[34],"of":[35,40,88,130,140,154,172],"verification,":[37],"ranges":[39,153],"variables":[41],"must":[42],"be":[43],"bounded":[44],"programs":[47],"are":[48,60,72],"translated":[49],"into":[50],"corresponding":[51],"(finite":[52],"state)":[53],"Continuous":[54],"Time":[55],"Markov":[56],"Chains":[57],"(CTMCs)":[58],"analyzed":[61],"by":[62,74,137],"using":[63,138],"PRISM":[65],"tool.":[66],"Activities":[67],"in":[68,81,92,99,104,135,159],"CTMC":[70],"model":[71],"abstracted":[73],"their":[75],"rates.":[76],"[19]":[82,100,136],"activity":[84],"is":[85,162],"function":[90],"expressed":[91],"functional":[94,132,141],"sub-language.":[95],"The":[96,156],"solution":[97,157],"presented":[98,158],"manner,":[107],"but":[108],"not":[109],"automatically,":[110],"requiring":[111],"programmer":[113],"generate":[115],"certain":[116],"data":[117],"for":[118],"experiments.":[122],"this":[124,160],"paper":[125,161],"refine":[127],"design":[129],"sub-language":[133],"concepts":[139],"dependent":[144,148],"types.":[145],"We":[146],"use":[147],"types":[149],"control":[151],"variables.":[155],"devised":[163],"support":[165],"automatic":[166],"(bounded":[173],"versions":[174],"of)":[175],"programs.":[177]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-07-12T00:00:00"}