{"id":"https://openalex.org/W2092247065","doi":"https://doi.org/10.1093/comjnl/bxv001","title":"How to Optimize the Use of SAT and SMT Solvers for Test Generation of Boolean Expressions","display_name":"How to Optimize the Use of SAT and SMT Solvers for Test Generation of Boolean Expressions","publication_year":2015,"publication_date":"2015-01-21","ids":{"openalex":"https://openalex.org/W2092247065","doi":"https://doi.org/10.1093/comjnl/bxv001","mag":"2092247065"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxv001","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxv001","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","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/A5021486887","display_name":"Paolo Arcaini","orcid":"https://orcid.org/0000-0002-6253-4062"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Paolo Arcaini","raw_affiliation_strings":["Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","1Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]},{"raw_affiliation_string":"1Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089822604","display_name":"Angelo Gargantini","orcid":"https://orcid.org/0000-0002-4035-0131"},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Angelo Gargantini","raw_affiliation_strings":["1Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy"],"affiliations":[{"raw_affiliation_string":"1Dipartimento di Ingegneria, Universit\u00e0 degli Studi di Bergamo, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008671444","display_name":"Elvinia Riccobene","orcid":"https://orcid.org/0000-0002-1400-1026"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Elvinia Riccobene","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Milano, Italy","2Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Milano, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Milano, Italy","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"2Dipartimento di Informatica, Universit\u00e0 degli Studi di Milano, Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021486887"],"corresponding_institution_ids":["https://openalex.org/I11039511"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":2.7785,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90189727,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"58","issue":"11","first_page":"2900","last_page":"2920"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":1.0,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9990000128746033,"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/T10533","display_name":"Teaching and Learning Programming","score":0.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.6851836442947388},{"id":"https://openalex.org/keywords/test","display_name":"Test (biology)","score":0.5530018210411072},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4345993399620056},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.42774826288223267},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3973821997642517},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3695739209651947},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33791837096214294},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31984877586364746},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.24120530486106873},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22677543759346008}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6851836442947388},{"id":"https://openalex.org/C2777267654","wikidata":"https://www.wikidata.org/wiki/Q3519023","display_name":"Test (biology)","level":2,"score":0.5530018210411072},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4345993399620056},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.42774826288223267},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3973821997642517},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3695739209651947},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33791837096214294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31984877586364746},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.24120530486106873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22677543759346008},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1093/comjnl/bxv001","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxv001","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.702.2028","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.702.2028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.unibg.it/gargantini/research/papers/boolExpTGcomputerJournal2014.pdf","raw_type":"text"},{"id":"pmh:oai:aisberg.unibg.it:10446/50051","is_oa":false,"landing_page_url":"http://hdl.handle.net/10446/50051","pdf_url":null,"source":{"id":"https://openalex.org/S4377196347","display_name":"Aisberg (University of Bergamo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11039511","host_organization_name":"University of Bergamo","host_organization_lineage":["https://openalex.org/I11039511"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W92576581","https://openalex.org/W116345983","https://openalex.org/W588128257","https://openalex.org/W1551588008","https://openalex.org/W1567306564","https://openalex.org/W1710734607","https://openalex.org/W1850275321","https://openalex.org/W1971233427","https://openalex.org/W1987382793","https://openalex.org/W1987811078","https://openalex.org/W1998393968","https://openalex.org/W2000478763","https://openalex.org/W2002476964","https://openalex.org/W2009489720","https://openalex.org/W2042033151","https://openalex.org/W2061097805","https://openalex.org/W2080498731","https://openalex.org/W2084333881","https://openalex.org/W2090456105","https://openalex.org/W2094697148","https://openalex.org/W2096449544","https://openalex.org/W2100425664","https://openalex.org/W2103082747","https://openalex.org/W2110149712","https://openalex.org/W2110311336","https://openalex.org/W2112173236","https://openalex.org/W2112865039","https://openalex.org/W2113201637","https://openalex.org/W2132897303","https://openalex.org/W2133527541","https://openalex.org/W2135584970","https://openalex.org/W2143361941","https://openalex.org/W2156077234","https://openalex.org/W2157054705","https://openalex.org/W2159970141","https://openalex.org/W2162200351","https://openalex.org/W2162284942"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W4285605366","https://openalex.org/W2118943303","https://openalex.org/W3150741540","https://openalex.org/W4253759203","https://openalex.org/W2085380335","https://openalex.org/W2249253838","https://openalex.org/W4381894531","https://openalex.org/W2408080066","https://openalex.org/W3124721760"],"abstract_inverted_index":{"In":[0,88],"the":[1,7,39,46,48,55,97],"context":[2],"of":[3,9,50,73,100],"automatic":[4],"test":[5,27,52,59,77,101],"generation,":[6],"use":[8],"propositional":[10,113],"satisfiability":[11],"(SAT)":[12],"and":[13,54,69,106,112],"Satisfiability":[14],"Modulo":[15],"Theories":[16],"(SMT)":[17],"solvers":[18,64],"is":[19],"becoming":[20],"an":[21],"attractive":[22],"alternative":[23],"to":[24,41,95,119],"traditional":[25],"algorithmic":[26],"generation":[28,49,60,78,102],"methods,":[29],"especially":[30,131],"when":[31,132],"testing":[32,129],"Boolean":[33,104,135],"expressions.":[34],"The":[35],"main":[36],"advantages":[37],"are":[38],"capability":[40],"deal":[42],"with":[43,134],"constraints":[44],"over":[45],"inputs,":[47],"compact":[51],"suites":[53],"support":[56],"for":[57,103,128],"fault-detecting":[58],"methods.":[61],"However,":[62],"these":[63],"normally":[65],"require":[66],"more":[67],"time":[68],"a":[70],"greater":[71],"amount":[72],"memory":[74],"than":[75],"classical":[76],"algorithms,":[79],"making":[80],"their":[81],"applicability":[82],"not":[83],"always":[84],"feasible":[85],"in":[86],"practice.":[87],"this":[89],"paper,":[90],"we":[91,107],"propose":[92],"several":[93,109],"ways":[94],"optimize":[96],"SAT/SMT-based":[98,121],"process":[99],"expressions":[105],"compare":[108],"solving":[110],"tools":[111],"transformation":[114],"rules.":[115],"These":[116],"optimizations":[117],"promise":[118],"make":[120],"techniques":[122],"as":[123,125,137],"efficient":[124],"standard":[126],"methods":[127],"purposes,":[130],"dealing":[133],"expressions,":[136],"proved":[138],"by":[139],"our":[140],"experiments.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}