{"id":"https://openalex.org/W2094697148","doi":"https://doi.org/10.1109/ase.2011.6100079","title":"Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions","display_name":"Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2094697148","doi":"https://doi.org/10.1109/ase.2011.6100079","mag":"2094697148"},"language":"en","primary_location":{"id":"doi:10.1109/ase.2011.6100079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ase.2011.6100079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2434/209146","any_repository_has_fulltext":true},"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/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":true,"raw_author_name":"Paolo Arcaini","raw_affiliation_strings":["Dipartimento di Tecnologie dell'Informazione, Universit\u00e0 degli Studi di Milano, Italy","Dip. di Tecnologie dell'Informazione - Universit\u00e0 degli Studi di Milano, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Tecnologie dell'Informazione, Universit\u00e0 degli Studi di Milano, Italy","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"Dip. di Tecnologie dell'Informazione - Universit\u00e0 degli Studi di Milano, Italy#TAB#","institution_ids":["https://openalex.org/I189158943"]}]},{"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":["Dipartimento di Ing. dell'Informazione e Metodi Matematici, Universit\u00e0 di Bergamo, Italy","Dip. di Ing. dell'Informazione e Metodi Matematici, Universit\u00e0 di Bergamo, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Ing. dell'Informazione e Metodi Matematici, Universit\u00e0 di Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]},{"raw_affiliation_string":"Dip. di Ing. dell'Informazione e Metodi Matematici, Universit\u00e0 di 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 Tecnologie dell'Informazione, Universit\u00e0 degli Studi di Milano, Italy","Dip. di Tecnologie dell'Informazione - Universit\u00e0 degli Studi di Milano, Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Tecnologie dell'Informazione, Universit\u00e0 degli Studi di Milano, Italy","institution_ids":["https://openalex.org/I189158943"]},{"raw_affiliation_string":"Dip. di Tecnologie dell'Informazione - Universit\u00e0 degli Studi di Milano, Italy#TAB#","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/I189158943"],"apc_list":null,"apc_paid":null,"fwci":1.2143,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.81620112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"388","last_page":"391"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7680801153182983},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6270377039909363},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5776384472846985},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.48792096972465515},{"id":"https://openalex.org/keywords/automatic-test-pattern-generation","display_name":"Automatic test pattern generation","score":0.4859668016433716},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.44864872097969055},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4467935860157013},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4371241331100464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.428041011095047},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4160580635070801},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3906349837779999},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3686251938343048},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.1567634642124176}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7680801153182983},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6270377039909363},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5776384472846985},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.48792096972465515},{"id":"https://openalex.org/C17626397","wikidata":"https://www.wikidata.org/wiki/Q837455","display_name":"Automatic test pattern generation","level":3,"score":0.4859668016433716},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.44864872097969055},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4467935860157013},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4371241331100464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.428041011095047},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4160580635070801},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3906349837779999},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3686251938343048},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.1567634642124176},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/ase.2011.6100079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ase.2011.6100079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)","raw_type":"proceedings-article"},{"id":"pmh:oai:air.unimi.it:2434/209146","is_oa":true,"landing_page_url":"http://hdl.handle.net/2434/209146","pdf_url":"http://hdl.handle.net/2434/209146","source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.222.8025","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.8025","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/ase11_SATSMT.pdf","raw_type":"text"},{"id":"pmh:oai:aisberg.unibg.it:10446/25719","is_oa":false,"landing_page_url":"http://hdl.handle.net/10446/25719","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/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:air.unimi.it:2434/209146","is_oa":true,"landing_page_url":"http://hdl.handle.net/2434/209146","pdf_url":"http://hdl.handle.net/2434/209146","source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2094697148.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W92576581","https://openalex.org/W1480909796","https://openalex.org/W1987811078","https://openalex.org/W2000478763","https://openalex.org/W2061097805","https://openalex.org/W2090456105","https://openalex.org/W2100425664","https://openalex.org/W2109964207","https://openalex.org/W2110149712","https://openalex.org/W2143361941","https://openalex.org/W2162200351","https://openalex.org/W6814269298"],"related_works":["https://openalex.org/W2332241156","https://openalex.org/W4240446120","https://openalex.org/W3173322326","https://openalex.org/W2144163060","https://openalex.org/W2283984028","https://openalex.org/W2810353660","https://openalex.org/W4253759203","https://openalex.org/W131632282","https://openalex.org/W4293588885","https://openalex.org/W2796388654"],"abstract_inverted_index":{"Recent":[0],"advances":[1],"in":[2],"propositional":[3,105],"satisfiability":[4],"(SAT)":[5],"and":[6,16,57,71,98,104],"Satisfiability":[7],"Modulo":[8],"Theories":[9],"(SMT)":[10],"solvers":[11,34,66,103],"are":[12,44],"increasingly":[13],"rendering":[14],"SAT":[15],"SMT-based":[17],"automatic":[18],"test":[19,27,55,61,78,96],"generation":[20,28,62,79,97],"an":[21],"attractive":[22],"alternative":[23],"to":[24,46,91,111],"traditional":[25],"algorithmic":[26],"methods.":[29,63],"The":[30],"use":[31],"of":[32,74,95],"SAT/SMT":[33,102],"is":[35],"particularly":[36],"appealing":[37],"when":[38,124],"testing":[39,121],"Boolean":[40,127],"expressions:":[41],"These":[42,108],"tools":[43],"able":[45],"deal":[47],"with":[48,126],"constraints":[49],"over":[50],"the":[51,93],"models,":[52],"generate":[53],"compact":[54],"suites,":[56],"they":[58],"support":[59],"fault-based":[60],"However,":[64],"these":[65],"normally":[67],"require":[68],"more":[69],"time":[70],"greater":[72],"amount":[73],"memory":[75],"than":[76],"classical":[77],"algorithms,":[80],"limiting":[81],"their":[82],"applicability.":[83],"In":[84],"this":[85],"paper":[86],"we":[87,99],"propose":[88],"several":[89,101],"ways":[90],"optimize":[92],"process":[94],"compare":[100],"transformation":[106],"rules.":[107],"optimizations":[109],"promise":[110],"make":[112],"SAT/SMT-based":[113],"techniques":[114],"as":[115,117,129],"efficient":[116],"standard":[118],"methods":[119],"for":[120],"purposes,":[122],"especially":[123],"dealing":[125],"expressions,":[128],"proved":[130],"by":[131],"our":[132],"experiments.":[133]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}