PBE-Based Selective Abstraction and Refinement for Efficient Property Falsification of Embedded Software

Comprehensive verification/falsification of embedded software is challenging and often impossible mainly due to the typical characteristics of embedded software, such as the use of global variables, reactive behaviors, and its (soft or hard) real-time requirements, to name but a few. Abstraction is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the ACM on software engineering Ročník 1; číslo FSE; s. 293 - 315
Hlavní autoři: Kim, Yoel, Choi, Yunja
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 12.07.2024
Témata:
ISSN:2994-970X, 2994-970X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Comprehensive verification/falsification of embedded software is challenging and often impossible mainly due to the typical characteristics of embedded software, such as the use of global variables, reactive behaviors, and its (soft or hard) real-time requirements, to name but a few. Abstraction is one of the major solutions to this problem, but existing proven abstraction techniques are not effective in this domain as they are uniformly applied to the entire program and often require a large number of refinements to find true alarms. This work proposes a domain-specific solution for efficient property falsification based on the observation that embedded software typically consists of a number of user-defined auxiliary functions, many of which may be loosely coupled with the main control logic. Our approach selectively abstracts auxiliary functions using function summaries synthesized by Programming-By-Example (PBE), which reduces falsification complexity as well as the number of refinements. The drawbacks of using PBE-based function summaries, which are neither sound nor complete, for abstraction are counteracted by symbolic alarm filtering and novel PBE-based refinements for function summaries. We demonstrate that the proposed approach has comparable performance to the state-of-the-art model checkers on SV-COMP benchmark programs and outperforms them on a set of typical embedded software in terms of both falsification efficiency and scalability.
AbstractList Comprehensive verification/falsification of embedded software is challenging and often impossible mainly due to the typical characteristics of embedded software, such as the use of global variables, reactive behaviors, and its (soft or hard) real-time requirements, to name but a few. Abstraction is one of the major solutions to this problem, but existing proven abstraction techniques are not effective in this domain as they are uniformly applied to the entire program and often require a large number of refinements to find true alarms. This work proposes a domain-specific solution for efficient property falsification based on the observation that embedded software typically consists of a number of user-defined auxiliary functions, many of which may be loosely coupled with the main control logic. Our approach selectively abstracts auxiliary functions using function summaries synthesized by Programming-By-Example (PBE), which reduces falsification complexity as well as the number of refinements. The drawbacks of using PBE-based function summaries, which are neither sound nor complete, for abstraction are counteracted by symbolic alarm filtering and novel PBE-based refinements for function summaries. We demonstrate that the proposed approach has comparable performance to the state-of-the-art model checkers on SV-COMP benchmark programs and outperforms them on a set of typical embedded software in terms of both falsification efficiency and scalability.
ArticleNumber 14
Author Choi, Yunja
Kim, Yoel
Author_xml – sequence: 1
  givenname: Yoel
  orcidid: 0009-0005-6689-5171
  surname: Kim
  fullname: Kim, Yoel
  email: kimyoel2305@gmail.com
  organization: Kyungpook National University, Daegu, South Korea
– sequence: 2
  givenname: Yunja
  orcidid: 0000-0002-6300-1364
  surname: Choi
  fullname: Choi, Yunja
  email: yuchoi76@knu.ac.kr
  organization: Kyungpook National University, Daegu, South Korea
BookMark eNpNkDFPwzAQhS1UJEqp2Jm8MQXsxI7rsa1SQKpEBR3YIsc-C6PGruwI1H9PQgtiunfvvnvDu0QjHzwgdE3JHaWM3xclKwQjZ2icS8kyKcjb6J--QNOUPgghvUOpIGP0vllU2UIlMPgVdqA79wl43qQuql4Hj5U3-AWs89CC77ANEVfWOu2GbRPDHmJ3wCu1S6531c9PsLhqGzBmSA22-1IRrtC57SGYnuYEbVfVdvmYrZ8fnpbzdaZmjGRcMsalsLoomoYToBZyy5TUvJS5IDkUhpakJzm3TApNlZkxNaOlYEA5mGKCbo-xOoaUIth6H12r4qGmpB4qqk8V9eTNkVS6_YN-j9_CnGI1
Cites_doi 10.4230/LIPIcs.ECOOP.2020.2
10.1145/2814270.2814310
10.1007/978-3-540-70545-1_14
10.1145/3510003.3510064
10.1109/TSE.2017.2694423
10.1007/10722167_15
10.1145/3180155.3180253
10.1109/TSE.2020.2989171
10.1109/FMCAD.2013.6679385
10.1145/2393596.2393664
10.1007/978-3-540-24730-2_15
10.1007/978-3-662-54577-5_18
10.1007/978-3-030-03421-4_11
10.1007/978-3-642-22110-1_16
10.1145/3180155.3180231
10.1145/2426890.2426900
10.1145/1275497.1275502
10.1007/978-3-030-99527-0_20
10.1109/ASE.2019.00059
10.6084/m9.figshare.24798264.v4
10.1145/3106237.3106309
10.2307/2963594
10.1109/LICS.1989.39190
10.1007/s10009-012-0249-7
10.1109/FMCAD.2008.ECP.20
10.1007/s10703-008-0049-6
10.1109/FMCAD.2009.5351141
10.1145/3434335
10.1145/3238147.3238223
10.1145/1926385.1926423
10.1007/978-3-662-54580-5_12
10.1145/378795.378846
10.1109/TITS.2017.2778077
10.1109/ASE.2019.00060
10.1007/s00165-017-0436-0
10.1145/3385412.3386027
10.1007/s10009-007-0044-z
10.1145/3324884.3418927
10.1145/1190215.1190226
10.1109/TITS.2021.3065940
10.1007/s10515-013-0132-0
10.1007/978-3-642-34188-5_15
10.1007/978-3-030-99524-9_31
10.1007/11817963_14
10.1145/3338906.3338934
ContentType Journal Article
Copyright Owner/Author
Copyright_xml – notice: Owner/Author
DBID AAYXX
CITATION
DOI 10.1145/3643740
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef

DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2994-970X
EndPage 315
ExternalDocumentID 10_1145_3643740
3643740
GrantInformation_xml – fundername: the Korea government (MSIT)
  grantid: NRF-2021R1A5A102194
  funderid: https://doi.org/10.13039/
GroupedDBID AAKMM
ACM
AEJOY
AKRVB
ALMA_UNASSIGNED_HOLDINGS
LHSKQ
M~E
AAYXX
CITATION
ROL
ID FETCH-LOGICAL-a840-5944597fc33bb50e1fe2f4a9c5692702e3d16084055f497c1ad84a81674e15ed3
ISSN 2994-970X
IngestDate Sat Nov 29 07:50:29 EST 2025
Mon Jul 14 20:49:06 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue FSE
Keywords property falsification
function summary refinement
selective abstraction
Language English
License This work is licensed under a Creative Commons Attribution-NonCommercial International 4.0 License.
https://creativecommons.org/licenses/by-nc/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a840-5944597fc33bb50e1fe2f4a9c5692702e3d16084055f497c1ad84a81674e15ed3
ORCID 0000-0002-6300-1364
0009-0005-6689-5171
OpenAccessLink https://dl.acm.org/doi/10.1145/3643740
PageCount 23
ParticipantIDs crossref_primary_10_1145_3643740
acm_primary_3643740
PublicationCentury 2000
PublicationDate 20240712
2024-07-12
PublicationDateYYYYMMDD 2024-07-12
PublicationDate_xml – month: 07
  year: 2024
  text: 20240712
  day: 12
PublicationDecade 2020
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationTitle Proceedings of the ACM on software engineering
PublicationTitleAbbrev ACM PACMSE
PublicationYear 2024
Publisher ACM
Publisher_xml – name: ACM
References Elevator controller. 2020. Elevator Controller Program. https://github.com/Sandbergo/elevator-controller
Oleksandr Polozov and Sumit Gulwani. 2015. Flashmeta: A framework for inductive program synthesis. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA ’15). ACM, New York, NY, USA. 107–126. https://doi.org/10.1145/2814270.2814310 10.1145/2814270.2814310
Xuan-Bach D Le, Duc-Hiep Chu, David Lo, Claire Le Goues, and Willem Visser. 2017. S3: syntax-and semantic-guided repair synthesis via programming by examples. In Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering (ESEC/FSE ’17). ACM, New York, NY, USA. 593–604. https://doi.org/10.1145/3106237.3106309 10.1145/3106237.3106309
Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, and Matthew B. Dwyer. 2007. A new foundation for control dependence and slicing for modern program structures. ACM Transactions on Programming Languages and Systems, 29, 5 (2007), 43 pages. https://doi.org/10.1145/1275497.1275502 10.1145/1275497.1275502
Shafiul Azam Chowdhury, Soumik Mohian, Sidharth Mehra, Siddhant Gawsane, Taylor T. Johnson, and Christoph Csallner. 2018. Automatically Finding Bugs in a Commercial Cyber-Physical System Development Tool Chain With SLforge. In Proceedings of the 40th International Conference on Software Engineering (ICSE ’18). ACM, New York, NY, USA. 981–992. https://doi.org/10.1145/3180155.3180231 10.1145/3180155.3180231
Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. 2000. Counterexample-Guided Abstraction Refinement. In International Conference on Computer Aided Verification, E. Allen Emerson and Aravinda Prasad Sistla (Eds.) (CAV ’00). Springer, Berlin, Heidelberg. 154–169. https://doi.org/10.1007/10722167_15 10.1007/10722167_15
Per Bjesse. 2008. Word-Level Sequential Memory Abstraction for Model Checking. In Formal Methods in Computer-Aided Design (FMCAD ’08). IEEE, Portland, OR, USA. 1–9. https://doi.org/10.1109/FMCAD.2008.ECP.20 10.1109/FMCAD.2008.ECP.20
David C Black and Jack Donovan. 2004. SystemC: From the ground up. Springer, New York, NY, USA.
Thomas Ball, Rupak Majumdar, Todd Millstein, and Sriram K. Rajamani. 2001. Automatic predicate abstraction of C programs. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI ’01). ACM, New York, NY, USA. 203–213. isbn:1581134142 https://doi.org/10.1145/378795.378846 10.1145/378795.378846
Woosuk Lee. 2021. Combining the top-down propagation and bottom-up enumeration for inductive program synthesis. Proceedings of the ACM on Programming Languages, 5, POPL (2021), 1–28. https://doi.org/10.1145/3434335 10.1145/3434335
Rajeev Alur, Rastislav Bodik, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, and Abhishek Udupa. 2013. Syntax-guided synthesis. In Formal Methods in Computer-Aided Design (FMCAD ’13). IEEE, Portland, OR, USA. 1–8. https://doi.org/10.1109/FMCAD.2013.6679385 10.1109/FMCAD.2013.6679385
Brobot. 2016. Garbage Colletor Robot Program. https://github.com/stvhwrd/Brobot
Dirk Beyer, Thomas A Henzinger, M Erkan Keremoglu, and Philipp Wendler. 2012. Conditional model checking: A technique to pass information between verifiers. In Proceedings of the 20th International Symposium on the Foundations of Software Engineering (FSE ’12). ACM, New York, NY, USA. Article 57, 11 pages. https://doi.org/10.1145/2393596.2393664 10.1145/2393596.2393664
Dirk Beyer, Jan Haltermann, Thomas Lemberger, and Heike Wehrheim. 2022. Decomposing Software Verification into Off-the-Shelf Components: An Application to CEGAR. In Proceedings of the 44th International Conference on Software Engineering (ICSE ’22). ACM, New York, NY, USA. 536–548. https://doi.org/10.1145/3510003.3510064 10.1145/3510003.3510064
William Craig. 1957. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. The Journal of Symbolic Logic, 22, 3 (1957), 269–285.
Object follower. 2013. Object-Following Automotive Multitasking Program. https://github.com/addud/object-follower
Ryosuke Sato, Hiroshi Unno, and Naoki Kobayashi. 2013. Towards a Scalable Software Model Checker for Higher-Order Programs. In Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation (PEPM ’13). ACM, New York, NY, USA. 53–62. isbn:9781450318426 https://doi.org/10.1145/2426890.2426900 10.1145/2426890.2426900
Hila Peleg and Nadia Polikarpova. 2020. Perfect is the enemy of good: Best-effort program synthesis. In 34th European Conference on Object-Oriented Programming (ECOOP ’20), Robert Hirschfeld and Tobias Pape (Eds.) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 166). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany. 2:1–2:30. isbn:978-3-95977-154-2 issn:1868-8969 https://doi.org/10.4230/LIPIcs.ECOOP.2020.2 10.4230/LIPIcs.ECOOP.2020.2
Lars Ole Andersen. 1994. Program analysis and specialization for the C programming language. Ph. D. Dissertation. University of Copenhagen.
Thomas Ball and Sriram K Rajamani. 2002. Generating abstract explanations of spurious counterexamples in C programs. Technical Report MSR-TR-2002-09, Microsoft Research.
Mihaela Gheorghiu Bobaru, Corina S Păsăreanu, and Dimitra Giannakopoulou. 2008. Automated assume-guarantee reasoning by abstraction refinement. In International Conference on Computer Aided Verification (CAV ’08). Springer, Berlin, Heidelberg. 135–148. https://doi.org/10.1007/978-3-540-70545-1_14 10.1007/978-3-540-70545-1_14
Yoel Kim and Yunja Choi. 2023. Reproduction Package (Docker Image) for the FSE 2024 Article ‘PBE-based Abstraction and Refinement for Efficient Property Falsification of Embedded Software’. figshare. https://doi.org/10.6084/m9.figshare.24798264.v4 10.6084/m9.figshare.24798264.v4
Yu Wang, Fengjuan Gao, Linzhang Wang, Tingting Yu, Jianhua Zhao, and Xuandong Li. 2022. Automatic Detection, Validation, and Repair of Race Conditions in Interrupt-Driven Embedded Software. IEEE Transactions on Software Engineering, 48, 1 (2022), 346–363. https://doi.org/10.1109/TSE.2020.2989171 10.1109/TSE.2020.2989171
VPlusLab. 2023. CROWN 2.0. https://www.vpluslab.kr/crown2
Frama-C. 2023. Framework for Modular Analysis of C programs. https://frama-c.com
Edmund Clarke, Daniel Kroening, and Flavio Lerda. 2004. A Tool for Checking ANSI-C Programs. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Kurt Jensen and Andreas Podelski (Eds.) (TACAS ’04). Springer, Berlin, Heidelberg. 168–176. https://doi.org/10.1007/978-3-540-24730-2_15 10.1007/978-3-540-24730-2_15
Daniel Conrad Halbert. 1984. Programming by example. Ph. D. Dissertation. University of California, Berkeley.
Rajeev Alur, Arjun Radhakrishna, and Abhishek Udupa. 2017. Scaling Enumerative Program Synthesis via Divide and Conquer. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Axel Legay and Tiziana Margaria (Eds.) (TACAS ’17). Springer, Berlin, Heidelberg. 319–336. https://doi.org/10.1007/978-3-662-54577-5_18 10.1007/978-3-662-54577-5_18
Edmund M Clarke, David E Long, and Kenneth L McMillan. 1989. Compositional model checking. In Proceedings of the Fourth IEEE Symposium on Logic in Computer Science. IEEE, Pacific Grove, CA, USA. 19 pages. https://doi.org/10.1109/LICS.1989.39190 10.1109/LICS.1989.39190
Rajeev Alur, Dana Fisman, Saswat Padhi, Andrew Reynolds, Rishabh Singh, and Abhishek Udupa. 2019. The 6th Syntax-Guided Synthesis Competition (SyGuS-Comp). https://sygus-org.github.io/comp/2019
Dongwoo Kim and Yunja Choi. 2019. Model checking embedded control software using OS-in-the-loop CEGAR. In Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering (ASE ’19). IEEE, San Diego, California. 565–576. https://doi.org/10.1109/ASE.2019.00059 10.1109/ASE.2019.00059
Sumit Gulwani. 2011. Automating String Processing in Spreadsheets Using Input-Output Examples. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’11). ACM, New York, NY, USA. 317–330. isbn:9781450304900 https://doi.org/10.1145/1926385.1926423 10.1145/1926385.1926423
Adrian Baruta Kyle Foss, Ivo Couckuyt and Corentin Mossoux. 2022. Automated Software Defect Detection and Identification in Vehicular Embedded Systems. IEEE Transactions on Intelligent Transportation Systems, 23, 7 (2022), 6963–6973. https://doi.org/10.1109/TITS.2021.3065940 10.1109/TITS.2021.3065940
Karam Abd Elkader, Orna Grumberg, Corina S Păsăreanu, and Sharon Shoham. 2018. Automated circular assume-guarantee reasoning. Formal Aspects of Computing, 30, 5 (2018), 571–595. https://doi.org/10.1007/s00165-017-0436-0 10.1007/s00165-017-0436-0
Dirk Beyer, Thomas A Henzinger, Ranjit Jhala, and Rupak Majumdar. 2007. The software model checker Blast: Applications to software engineering. International Journal on Software Tools for Technology Transfer, 9 (2007), 505–525. https://doi.org/10.1007/s10009-007-0044-z 10.1007/s10009-007-0044-z
Dirk Beyer and M. Erkan Keremoglu. 2011. CPAchecker: A Tool for Configurable Software Verification. In International Conference on Computer Aided Verification, Ganesh Gopalakrishnan and Shaz Qadeer (Eds.) (CAV ’11). Springer, Berlin, Heidelberg. 184–190. https://doi.org/10.1007/978-3-642-22110-1_16 10.1007/978-3-642-22110-1_16
Liangze Yin, Wei Dong, Wanwei Liu, and Ji Wang. 2018. Scheduling constraint based abstraction refinement for weak memory models. In Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering (ASE ’18). ACM, New York, NY, USA. 645–655. https://doi.org/10.1145/3238147.3238223 10.1145/3238147.3238223
Yunho Kim, Yunja Choi, and Moonzoo Kim. 2018. Precise concolic unit testing of C programs using extended units and symbolic alarm filtering. In Proceedings of the 40th
Halbert Daniel Conrad (e_1_2_1_35_1)
Andersen Lars Ole (e_1_2_1_6_1)
e_1_2_1_20_1
e_1_2_1_41_1
e_1_2_1_24_1
e_1_2_1_45_1
e_1_2_1_22_1
e_1_2_1_43_1
e_1_2_1_28_1
e_1_2_1_49_1
Alur Rajeev (e_1_2_1_4_1)
e_1_2_1_26_1
e_1_2_1_47_1
e_1_2_1_31_1
e_1_2_1_54_1
e_1_2_1_8_1
e_1_2_1_56_1
e_1_2_1_12_1
e_1_2_1_50_1
e_1_2_1_10_1
e_1_2_1_33_1
e_1_2_1_52_1
e_1_2_1_2_1
e_1_2_1_16_1
e_1_2_1_39_1
e_1_2_1_14_1
e_1_2_1_37_1
e_1_2_1_18_1
e_1_2_1_42_1
e_1_2_1_40_1
e_1_2_1_23_1
e_1_2_1_46_1
e_1_2_1_21_1
e_1_2_1_44_1
e_1_2_1_27_1
e_1_2_1_25_1
e_1_2_1_48_1
e_1_2_1_29_1
e_1_2_1_7_1
e_1_2_1_30_1
e_1_2_1_55_1
e_1_2_1_5_1
e_1_2_1_3_1
e_1_2_1_13_1
e_1_2_1_34_1
e_1_2_1_51_1
e_1_2_1_1_1
e_1_2_1_11_1
e_1_2_1_32_1
e_1_2_1_53_1
e_1_2_1_17_1
e_1_2_1_38_1
Black David C (e_1_2_1_19_1)
e_1_2_1_15_1
e_1_2_1_36_1
References_xml – reference: Dirk Beyer and Sudeep Kanav. 2022. CoVeriTeam: On-Demand Composition of Cooperative Verification Systems. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dana Fisman and Grigore Rosu (Eds.) (TACAS ’22). Springer, Cham. 561–579. https://doi.org/10.1007/978-3-030-99524-9_31 10.1007/978-3-030-99524-9_31
– reference: Frama-C. 2023. Framework for Modular Analysis of C programs. https://frama-c.com/
– reference: Dirk Beyer and Matthias Dangl. 2018. Strategy Selection for Software Verification Based on Boolean Features. In Leveraging Applications of Formal Methods, Verification and Validation. Verification, Tiziana Margaria and Bernhard Steffen (Eds.). Springer, Cham. 144–159. https://doi.org/10.1007/978-3-030-03421-4_11 10.1007/978-3-030-03421-4_11
– reference: Yoel Kim and Yunja Choi. 2023. Reproduction Package (Docker Image) for the FSE 2024 Article ‘PBE-based Abstraction and Refinement for Efficient Property Falsification of Embedded Software’. figshare. https://doi.org/10.6084/m9.figshare.24798264.v4 10.6084/m9.figshare.24798264.v4
– reference: Shafiul Azam Chowdhury, Soumik Mohian, Sidharth Mehra, Siddhant Gawsane, Taylor T. Johnson, and Christoph Csallner. 2018. Automatically Finding Bugs in a Commercial Cyber-Physical System Development Tool Chain With SLforge. In Proceedings of the 40th International Conference on Software Engineering (ICSE ’18). ACM, New York, NY, USA. 981–992. https://doi.org/10.1145/3180155.3180231 10.1145/3180155.3180231
– reference: Oleksandr Polozov and Sumit Gulwani. 2015. Flashmeta: A framework for inductive program synthesis. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA ’15). ACM, New York, NY, USA. 107–126. https://doi.org/10.1145/2814270.2814310 10.1145/2814270.2814310
– reference: Venkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, John Hatcliff, and Matthew B. Dwyer. 2007. A new foundation for control dependence and slicing for modern program structures. ACM Transactions on Programming Languages and Systems, 29, 5 (2007), 43 pages. https://doi.org/10.1145/1275497.1275502 10.1145/1275497.1275502
– reference: Object follower. 2013. Object-Following Automotive Multitasking Program. https://github.com/addud/object-follower/
– reference: Yu Wang, Fengjuan Gao, Linzhang Wang, Tingting Yu, Jianhua Zhao, and Xuandong Li. 2022. Automatic Detection, Validation, and Repair of Race Conditions in Interrupt-Driven Embedded Software. IEEE Transactions on Software Engineering, 48, 1 (2022), 346–363. https://doi.org/10.1109/TSE.2020.2989171 10.1109/TSE.2020.2989171
– reference: Dirk Beyer. 2022. Progress on Software Verification: SV-COMP 2022. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dana Fisman and Grigore Rosu (Eds.) (TACAS ’22). Springer, Cham. 375–402. https://doi.org/10.1007/978-3-030-99527-0_20 10.1007/978-3-030-99527-0_20
– reference: Yunho Kim, Yunja Choi, and Moonzoo Kim. 2018. Precise concolic unit testing of C programs using extended units and symbolic alarm filtering. In Proceedings of the 40th International Conference on Software Engineering (ICSE ’18). ACM, New York, NY, USA. 315–326. https://doi.org/10.1145/3180155.3180253 10.1145/3180155.3180253
– reference: Dirk Beyer, Thomas A Henzinger, Ranjit Jhala, and Rupak Majumdar. 2007. The software model checker Blast: Applications to software engineering. International Journal on Software Tools for Technology Transfer, 9 (2007), 505–525. https://doi.org/10.1007/s10009-007-0044-z 10.1007/s10009-007-0044-z
– reference: VPlusLab. 2023. CROWN 2.0. https://www.vpluslab.kr/crown2/
– reference: Ryosuke Sato, Hiroshi Unno, and Naoki Kobayashi. 2013. Towards a Scalable Software Model Checker for Higher-Order Programs. In Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation (PEPM ’13). ACM, New York, NY, USA. 53–62. isbn:9781450318426 https://doi.org/10.1145/2426890.2426900 10.1145/2426890.2426900
– reference: Frédéric Recoules, Sébastien Bardin, Richard Bonichon, Laurent Mounier, and Marie-Laure Potet. 2019. Get Rid of Inline Assembly through Verification-Oriented Lifting. In Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering (ASE ’19). IEEE, San Diego, CA, USA. 577–589. https://doi.org/10.1109/ASE.2019.00060 10.1109/ASE.2019.00060
– reference: Xuan-Bach D Le, Duc-Hiep Chu, David Lo, Claire Le Goues, and Willem Visser. 2017. S3: syntax-and semantic-guided repair synthesis via programming by examples. In Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering (ESEC/FSE ’17). ACM, New York, NY, USA. 593–604. https://doi.org/10.1145/3106237.3106309 10.1145/3106237.3106309
– reference: Karam Abd Elkader, Orna Grumberg, Corina S Păsăreanu, and Sharon Shoham. 2018. Automated circular assume-guarantee reasoning. Formal Aspects of Computing, 30, 5 (2018), 571–595. https://doi.org/10.1007/s00165-017-0436-0 10.1007/s00165-017-0436-0
– reference: Armando Solar-Lezama. 2013. Program sketching. International Journal on Software Tools for Technology Transfer, 15 (2013), 475–495. https://doi.org/10.1007/s10009-012-0249-7 10.1007/s10009-012-0249-7
– reference: Corina S Păsăreanu, Dimitra Giannakopoulou, Mihaela Gheorghiu Bobaru, Jamieson M Cobleigh, and Howard Barringer. 2008. Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods in System Design, 32 (2008), 175–205. https://doi.org/10.1007/s10703-008-0049-6 10.1007/s10703-008-0049-6
– reference: Daniel Conrad Halbert. 1984. Programming by example. Ph. D. Dissertation. University of California, Berkeley.
– reference: Rajeev Alur, Arjun Radhakrishna, and Abhishek Udupa. 2017. Scaling Enumerative Program Synthesis via Divide and Conquer. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Axel Legay and Tiziana Margaria (Eds.) (TACAS ’17). Springer, Berlin, Heidelberg. 319–336. https://doi.org/10.1007/978-3-662-54577-5_18 10.1007/978-3-662-54577-5_18
– reference: Thomas Ball, Rupak Majumdar, Todd Millstein, and Sriram K. Rajamani. 2001. Automatic predicate abstraction of C programs. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI ’01). ACM, New York, NY, USA. 203–213. isbn:1581134142 https://doi.org/10.1145/378795.378846 10.1145/378795.378846
– reference: Ondrej Sery, Grigory Fedyukovich, and Natasha Sharygina. 2011. Interpolation-based function summaries in bounded model checking. In 7th International Haifa Verification Conference, Kerstin Eder, João Lourenço, and Onn Shehory (Eds.) (HVC ’11). Springer, Berlin, Heidelberg. 160–175. https://doi.org/10.1007/978-3-642-34188-5_15 10.1007/978-3-642-34188-5_15
– reference: Angelo Brillout, Daniel Kroening, and Thomas Wahl. 2009. Mixed abstractions for floating-point arithmetic. In Formal Methods in Computer-Aided Design (FMCAD ’09). IEEE, Austin, TX, USA. 69–76. https://doi.org/10.1109/FMCAD.2009.5351141 10.1109/FMCAD.2009.5351141
– reference: Alessandro Armando, Massimo Benerecetti, and Jacopo Mantovani. 2014. Counterexample-guided abstraction refinement for linear programs with arrays. Automated Software Engineering, 21 (2014), 225–285. https://doi.org/10.1007/s10515-013-0132-0 10.1007/s10515-013-0132-0
– reference: David C Black and Jack Donovan. 2004. SystemC: From the ground up. Springer, New York, NY, USA.
– reference: Per Bjesse. 2008. Word-Level Sequential Memory Abstraction for Model Checking. In Formal Methods in Computer-Aided Design (FMCAD ’08). IEEE, Portland, OR, USA. 1–9. https://doi.org/10.1109/FMCAD.2008.ECP.20 10.1109/FMCAD.2008.ECP.20
– reference: Mihaela Gheorghiu Bobaru, Corina S Păsăreanu, and Dimitra Giannakopoulou. 2008. Automated assume-guarantee reasoning by abstraction refinement. In International Conference on Computer Aided Verification (CAV ’08). Springer, Berlin, Heidelberg. 135–148. https://doi.org/10.1007/978-3-540-70545-1_14 10.1007/978-3-540-70545-1_14
– reference: Thomas Ball and Sriram K Rajamani. 2002. Generating abstract explanations of spurious counterexamples in C programs. Technical Report MSR-TR-2002-09, Microsoft Research.
– reference: Woosuk Lee. 2021. Combining the top-down propagation and bottom-up enumeration for inductive program synthesis. Proceedings of the ACM on Programming Languages, 5, POPL (2021), 1–28. https://doi.org/10.1145/3434335 10.1145/3434335
– reference: Brobot. 2016. Garbage Colletor Robot Program. https://github.com/stvhwrd/Brobot/
– reference: William Craig. 1957. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. The Journal of Symbolic Logic, 22, 3 (1957), 269–285.
– reference: Liangze Yin, Wei Dong, Wanwei Liu, and Ji Wang. 2018. Scheduling constraint based abstraction refinement for weak memory models. In Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering (ASE ’18). ACM, New York, NY, USA. 645–655. https://doi.org/10.1145/3238147.3238223 10.1145/3238147.3238223
– reference: Dirk Beyer and M. Erkan Keremoglu. 2011. CPAchecker: A Tool for Configurable Software Verification. In International Conference on Computer Aided Verification, Ganesh Gopalakrishnan and Shaz Qadeer (Eds.) (CAV ’11). Springer, Berlin, Heidelberg. 184–190. https://doi.org/10.1007/978-3-642-22110-1_16 10.1007/978-3-642-22110-1_16
– reference: Kangjing Huang, Xiaokang Qiu, Peiyuan Shen, and Yanjun Wang. 2020. Reconciling Enumerative and Deductive Program Synthesis. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI ’20). ACM, New York, NY, USA. 1159–1174. isbn:9781450376136 https://doi.org/10.1145/3385412.3386027 10.1145/3385412.3386027
– reference: Sumit Gulwani. 2011. Automating String Processing in Spreadsheets Using Input-Output Examples. In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’11). ACM, New York, NY, USA. 317–330. isbn:9781450304900 https://doi.org/10.1145/1926385.1926423 10.1145/1926385.1926423
– reference: Yunho Kim, Shin Hong, and Moonzoo Kim. 2019. Target-driven compositional concolic testing with function summary refinement for effective bug detection. In Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE ’19). ACM, New York, NY, USA. 16–26. https://doi.org/10.1145/3338906.3338934 10.1145/3338906.3338934
– reference: Edmund M Clarke, David E Long, and Kenneth L McMillan. 1989. Compositional model checking. In Proceedings of the Fourth IEEE Symposium on Logic in Computer Science. IEEE, Pacific Grove, CA, USA. 19 pages. https://doi.org/10.1109/LICS.1989.39190 10.1109/LICS.1989.39190
– reference: Hila Peleg and Nadia Polikarpova. 2020. Perfect is the enemy of good: Best-effort program synthesis. In 34th European Conference on Object-Oriented Programming (ECOOP ’20), Robert Hirschfeld and Tobias Pape (Eds.) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 166). Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany. 2:1–2:30. isbn:978-3-95977-154-2 issn:1868-8969 https://doi.org/10.4230/LIPIcs.ECOOP.2020.2 10.4230/LIPIcs.ECOOP.2020.2
– reference: Kenneth L. McMillan. 2006. Lazy abstraction with interpolants. In International Conference on Computer Aided Verification, Thomas Ball and Robert B. Jones (Eds.) (CAV ’06). Springer, Berlin, Heidelberg. 123–136. isbn:978-3-540-37411-4 https://doi.org/10.1007/11817963_14 10.1007/11817963_14
– reference: Dongwoo Kim and Yunja Choi. 2019. Model checking embedded control software using OS-in-the-loop CEGAR. In Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering (ASE ’19). IEEE, San Diego, California. 565–576. https://doi.org/10.1109/ASE.2019.00059 10.1109/ASE.2019.00059
– reference: Cinzia Bernardeschi, Andrea Domenici, and Paolo Masci. 2018. A PVS-Simulink Integrated Environment for Model-Based Analysis of Cyber-Physical Systems. IEEE Transactions on Software Engineering, 44, 6 (2018), 512–533. https://doi.org/10.1109/TSE.2017.2694423 10.1109/TSE.2017.2694423
– reference: Leonardo Alt, Sepideh Asadi, Hana Chockler, Karine Even Mendoza, Grigory Fedyukovich, Antti EJ Hyvärinen, and Natasha Sharygina. 2017. HiFrog: SMT-based function summarization for software verification. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Axel Legay and Tiziana Margaria (Eds.) (TACAS ’17). Springer, Berlin, Heidelberg. 207–213. https://doi.org/10.1007/978-3-662-54580-5_12 10.1007/978-3-662-54580-5_12
– reference: David Bühler. 2017. EVA, an evolved value analysis for Frama-C: structuring an abstract interpreter through value and state abstractions. Ph. D. Dissertation. University of Rennes 1.
– reference: Dirk Beyer, Thomas A Henzinger, M Erkan Keremoglu, and Philipp Wendler. 2012. Conditional model checking: A technique to pass information between verifiers. In Proceedings of the 20th International Symposium on the Foundations of Software Engineering (FSE ’12). ACM, New York, NY, USA. Article 57, 11 pages. https://doi.org/10.1145/2393596.2393664 10.1145/2393596.2393664
– reference: Lars Ole Andersen. 1994. Program analysis and specialization for the C programming language. Ph. D. Dissertation. University of Copenhagen.
– reference: Dirk Beyer, Jan Haltermann, Thomas Lemberger, and Heike Wehrheim. 2022. Decomposing Software Verification into Off-the-Shelf Components: An Application to CEGAR. In Proceedings of the 44th International Conference on Software Engineering (ICSE ’22). ACM, New York, NY, USA. 536–548. https://doi.org/10.1145/3510003.3510064 10.1145/3510003.3510064
– reference: Mattia Fazzini, Alessandra Gorla, and Alessandro Orso. 2020. A framework for automated test mocking of mobile apps. In Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering (ASE ’20). ACM, New York, NY, USA. 1204–1208. https://doi.org/10.1145/3324884.3418927 10.1145/3324884.3418927
– reference: Yu Jiang, Han Liu, Houbing Song, Hui Kong, Rui Wang, Yong Guan, and Lui Sha. 2018. Safety-Assured Model-Driven Design of the Multifunction Vehicle Bus Controller. IEEE Transactions on Intelligent Transportation Systems, 19, 10 (2018), 3320–3333. https://doi.org/10.1109/TITS.2017.2778077 10.1109/TITS.2017.2778077
– reference: Elevator controller. 2020. Elevator Controller Program. https://github.com/Sandbergo/elevator-controller/
– reference: Rajeev Alur, Rastislav Bodik, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama, Emina Torlak, and Abhishek Udupa. 2013. Syntax-guided synthesis. In Formal Methods in Computer-Aided Design (FMCAD ’13). IEEE, Portland, OR, USA. 1–8. https://doi.org/10.1109/FMCAD.2013.6679385 10.1109/FMCAD.2013.6679385
– reference: Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. 2000. Counterexample-Guided Abstraction Refinement. In International Conference on Computer Aided Verification, E. Allen Emerson and Aravinda Prasad Sistla (Eds.) (CAV ’00). Springer, Berlin, Heidelberg. 154–169. https://doi.org/10.1007/10722167_15 10.1007/10722167_15
– reference: Edmund Clarke, Daniel Kroening, and Flavio Lerda. 2004. A Tool for Checking ANSI-C Programs. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Kurt Jensen and Andreas Podelski (Eds.) (TACAS ’04). Springer, Berlin, Heidelberg. 168–176. https://doi.org/10.1007/978-3-540-24730-2_15 10.1007/978-3-540-24730-2_15
– reference: Adrian Baruta Kyle Foss, Ivo Couckuyt and Corentin Mossoux. 2022. Automated Software Defect Detection and Identification in Vehicular Embedded Systems. IEEE Transactions on Intelligent Transportation Systems, 23, 7 (2022), 6963–6973. https://doi.org/10.1109/TITS.2021.3065940 10.1109/TITS.2021.3065940
– reference: Rajeev Alur, Dana Fisman, Saswat Padhi, Andrew Reynolds, Rishabh Singh, and Abhishek Udupa. 2019. The 6th Syntax-Guided Synthesis Competition (SyGuS-Comp). https://sygus-org.github.io/comp/2019/
– reference: Patrice Godefroid. 2007. Compositional dynamic test generation. In Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL ’07, Vol. 42). ACM, New York, NY, USA. 47–54. issn:0362-1340 https://doi.org/10.1145/1190215.1190226 10.1145/1190215.1190226
– ident: e_1_2_1_21_1
– ident: e_1_2_1_47_1
  doi: 10.4230/LIPIcs.ECOOP.2020.2
– ident: e_1_2_1_48_1
  doi: 10.1145/2814270.2814310
– ident: e_1_2_1_32_1
  doi: 10.1007/978-3-540-70545-1_14
– ident: e_1_2_1_13_1
  doi: 10.1145/3510003.3510064
– ident: e_1_2_1_27_1
– ident: e_1_2_1_10_1
  doi: 10.1109/TSE.2017.2694423
– ident: e_1_2_1_24_1
  doi: 10.1007/10722167_15
– ident: e_1_2_1_40_1
  doi: 10.1145/3180155.3180253
– ident: e_1_2_1_55_1
  doi: 10.1109/TSE.2020.2989171
– ident: e_1_2_1_3_1
  doi: 10.1109/FMCAD.2013.6679385
– ident: e_1_2_1_15_1
  doi: 10.1145/2393596.2393664
– ident: e_1_2_1_25_1
  doi: 10.1007/978-3-540-24730-2_15
– ident: e_1_2_1_5_1
  doi: 10.1007/978-3-662-54577-5_18
– ident: e_1_2_1_12_1
  doi: 10.1007/978-3-030-03421-4_11
– ident: e_1_2_1_17_1
  doi: 10.1007/978-3-642-22110-1_16
– ident: e_1_2_1_23_1
  doi: 10.1145/3180155.3180231
– ident: e_1_2_1_51_1
  doi: 10.1145/2426890.2426900
– ident: e_1_2_1_49_1
  doi: 10.1145/1275497.1275502
– ident: e_1_2_1_11_1
  doi: 10.1007/978-3-030-99527-0_20
– ident: e_1_2_1_38_1
  doi: 10.1109/ASE.2019.00059
– ident: e_1_2_1_39_1
  doi: 10.6084/m9.figshare.24798264.v4
– volume-title: SystemC: From the ground up
  ident: e_1_2_1_19_1
– ident: e_1_2_1_43_1
  doi: 10.1145/3106237.3106309
– ident: e_1_2_1_28_1
  doi: 10.2307/2963594
– ident: e_1_2_1_26_1
  doi: 10.1109/LICS.1989.39190
– ident: e_1_2_1_53_1
  doi: 10.1007/s10009-012-0249-7
– ident: e_1_2_1_18_1
  doi: 10.1109/FMCAD.2008.ECP.20
– ident: e_1_2_1_46_1
  doi: 10.1007/s10703-008-0049-6
– ident: e_1_2_1_20_1
  doi: 10.1109/FMCAD.2009.5351141
– ident: e_1_2_1_44_1
  doi: 10.1145/3434335
– ident: e_1_2_1_56_1
  doi: 10.1145/3238147.3238223
– ident: e_1_2_1_34_1
  doi: 10.1145/1926385.1926423
– ident: e_1_2_1_2_1
  doi: 10.1007/978-3-662-54580-5_12
– ident: e_1_2_1_8_1
  doi: 10.1145/378795.378846
– ident: e_1_2_1_37_1
  doi: 10.1109/TITS.2017.2778077
– ident: e_1_2_1_50_1
  doi: 10.1109/ASE.2019.00060
– ident: e_1_2_1_1_1
  doi: 10.1007/s00165-017-0436-0
– ident: e_1_2_1_36_1
  doi: 10.1145/3385412.3386027
– ident: e_1_2_1_14_1
  doi: 10.1007/s10009-007-0044-z
– ident: e_1_2_1_54_1
– ident: e_1_2_1_31_1
– volume-title: Programming by example. Ph. D. Dissertation
  ident: e_1_2_1_35_1
– volume-title: Program analysis and specialization for the C programming language. Ph. D. Dissertation
  ident: e_1_2_1_6_1
– ident: e_1_2_1_29_1
  doi: 10.1145/3324884.3418927
– ident: e_1_2_1_33_1
  doi: 10.1145/1190215.1190226
– ident: e_1_2_1_42_1
  doi: 10.1109/TITS.2021.3065940
– ident: e_1_2_1_7_1
  doi: 10.1007/s10515-013-0132-0
– ident: e_1_2_1_22_1
– ident: e_1_2_1_52_1
  doi: 10.1007/978-3-642-34188-5_15
– ident: e_1_2_1_30_1
– volume-title: The 6th Syntax-Guided Synthesis Competition (SyGuS-Comp). https://sygus-org.github.io/comp/2019/
  ident: e_1_2_1_4_1
– ident: e_1_2_1_16_1
  doi: 10.1007/978-3-030-99524-9_31
– ident: e_1_2_1_45_1
  doi: 10.1007/11817963_14
– ident: e_1_2_1_41_1
  doi: 10.1145/3338906.3338934
SSID ssj0002991170
Score 2.261273
Snippet Comprehensive verification/falsification of embedded software is challenging and often impossible mainly due to the typical characteristics of embedded...
SourceID crossref
acm
SourceType Index Database
Publisher
StartPage 293
SubjectTerms Embedded software
Model checking
Programming by example
Software and its engineering
SubjectTermsDisplay Software and its engineering -- Embedded software
Software and its engineering -- Model checking
Software and its engineering -- Programming by example
Title PBE-Based Selective Abstraction and Refinement for Efficient Property Falsification of Embedded Software
URI https://dl.acm.org/doi/10.1145/3643740
Volume 1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2994-970X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002991170
  issn: 2994-970X
  databaseCode: M~E
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07b9swECbcNEOXNI8WSdsUHLoVQiWRNMXRMWR0SWAgHpwpoCgSadHIgZ0XUKC_vXeSSMlJgDRDF8GmSIHgfTgej9_dEfKlsGXGrCsjYySPuE7LqNBcRC6WUtnCpKWJ62IT8uQkm8_VdDD47WNhbn_Jqsru79XVfxU1tIGwMXT2BeIOH4UG-A1ChyeIHZ7_JPjpUR4dwd4EhmRd4wapQaMCPRptVfA6ItGBdVnzAJBmmNd5JPDfFH3zSzDMJzBPZBEFizK_hAUv8auguO_0co1CNA3b4MqTDkbjY7yIWLW9v9ou8WF371-D8WxhA81jfLGo6QVnN9VP3fdIpBxdnUnPSZliumEl43mzxzzR5jVvD2CT07yvR5uyie2WzJqIz8fanmNiDIZ3j03Op_V82g_2ucA-bGKxxXk78BV5nUqhkA94_Kdz0MGMsSoPFif0c2-CrnHst3Ys2jTmsmfT9IyT2TbZak8VdNSgYYcMbLVL3vqKHbRV4HvkIoCDBnDQHjgogIN24KAADhrAQT046Bo46MJRDw7qwfGOzCb5bPw9amttRBqO-JFQnMPR0hnGikLENnE2dVwrI4YKIxYtK5NhDD2FcFxJk-gy4zrDEBabCFuy92SjWlR2n9ChtQxswASGM-6k0nDIjZ20KTemSIr0gOzCkp1fNclUvBAOCPVLGF49kNOH57t8JG86QH4iG9fLG3tINs3t9Y_V8nMt37_vZ3DU
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=PBE-Based+Selective+Abstraction+and+Refinement+for+Efficient+Property+Falsification+of+Embedded+Software&rft.jtitle=Proceedings+of+the+ACM+on+software+engineering&rft.au=Kim%2C+Yoel&rft.au=Choi%2C+Yunja&rft.date=2024-07-12&rft.issn=2994-970X&rft.eissn=2994-970X&rft.volume=1&rft.issue=FSE&rft.spage=293&rft.epage=315&rft_id=info:doi/10.1145%2F3643740&rft.externalDBID=n%2Fa&rft.externalDocID=10_1145_3643740
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2994-970X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2994-970X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2994-970X&client=summon