{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:01:37Z","timestamp":1742403697842},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,27]],"date-time":"2010-03-27T00:00:00Z","timestamp":1269648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s11334-010-0124-1","type":"journal-article","created":{"date-parts":[[2010,3,26]],"date-time":"2010-03-26T08:41:36Z","timestamp":1269592896000},"page":"243-253","source":"Crossref","is-referenced-by-count":8,"title":["Randomized constraint solvers: a comparative study"],"prefix":"10.1007","volume":"6","author":[{"given":"Mitsuo","family":"Takaki","sequence":"first","affiliation":[]},{"given":"Diego","family":"Cavalcanti","sequence":"additional","affiliation":[]},{"given":"Rohit","family":"Gheyi","sequence":"additional","affiliation":[]},{"given":"Juliano","family":"Iyoda","sequence":"additional","affiliation":[]},{"given":"Marcelo","family":"d\u2019Amorim","sequence":"additional","affiliation":[]},{"given":"Ricardo B. C.","family":"Prud\u00eancio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,27]]},"reference":[{"key":"124_CR1","doi-asserted-by":"crossref","unstructured":"Abdelbar A, Abdelshahid S (2004) Instinct-based PSO with local search applied to satisfiability. In: IEEE International Joint Conference on Neural Networks, pp 2291\u20132295","DOI":"10.1109\/IJCNN.2004.1380982"},{"key":"124_CR2","doi-asserted-by":"crossref","unstructured":"Anand S, Pasareanu CS, Visser W (2007) JPF-SE: a symbolic execution extension to Java PathFinder. In: Tools and algorithms for the construction and analysis of systems (TACAS), pp 134\u2013138","DOI":"10.1007\/978-3-540-71209-1_12"},{"key":"124_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T, Eiben AE, Vink ME (1998) A superior evolutionary algorithm for 3-SAT. In: 7th conference on evolutionary programming. Springer, UK, pp 125\u2013136","DOI":"10.1007\/BFb0040766"},{"key":"124_CR4","unstructured":"Bauer A, Pister M, Tautschnig M (2007) Tool-support for the analysis of hybrid systems and models. In: Lauwereins R, Madsen J (eds) Design, automation and test in Europe conference and exposition (DATE). ACM, Nice, pp 924\u2013929. doi: 10.1145\/1266366.1266565"},{"key":"124_CR5","unstructured":"Beizer B (1990) Software testing techniques. International Thomson Computer Press"},{"key":"124_CR6","doi-asserted-by":"crossref","unstructured":"Benhamou F, Granvilliers L (2006) Continuous and interval constraints. In: Rossi F, van Beek P, Walsh T (eds) Handbook of constraint programming, foundations of artificial intelligence, Chap. 16. Elsevier Science Publishers, Amsterdam. URL http:\/\/www.lina.sciences.univ-nantes.fr\/Publications\/2006\/BG06","DOI":"10.1016\/S1574-6526(06)80020-9"},{"issue":"3","key":"124_CR7","first-page":"228","volume":"23","author":"DL Bird","year":"1983","unstructured":"Bird DL, Munoz CU (1983) Automatic generation of random self-checking test cases. IBM Syst J 23(3): 228\u2013245","journal-title":"IBM Syst J"},{"key":"124_CR8","doi-asserted-by":"crossref","unstructured":"Boyapati C, Khurshid S, Marinov D (2002) Korat: automated testing based on Java predicates. In: Proceedings of the international symposium on software testing and analysis (ISSTA), pp 123\u2013133. doi: 10.1145\/566172.566191","DOI":"10.1145\/566172.566191"},{"key":"124_CR9","doi-asserted-by":"crossref","unstructured":"Bozzano M, Bruttomesso R, Cimatti A, Junttila T, van Rossum P, Schulz S, Sebastiani R (2005) An incremental and layered procedure for the satisfiability of linear arithmetic logic. In: Proceedings of the international conference on tools and algorithms for the construction and analysis of systems (TACAS), pp 317\u2013333","DOI":"10.1007\/978-3-540-31980-1_21"},{"key":"124_CR10","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1002\/spe.602","volume":"34","author":"C Csallner","year":"2004","unstructured":"Csallner C, Smaragdakis Y (2004) JCrasher: an automatic robustness tester for Java. Softw Pract Exp 34: 1025\u20131050","journal-title":"Softw Pract Exp"},{"issue":"7","key":"124_CR11","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland D (1962) A machine program for theorem-proving. Communications of ACM 5(7): 394\u2013397. doi: 10.1145\/368273.368557","journal-title":"Communications of ACM"},{"key":"124_CR12","doi-asserted-by":"crossref","unstructured":"Dwyer MB, Elbaum S, Person S, Purandare R (2007) Parallel randomized state-space search. In: ICSE \u201907: Proceedings of the 29th international conference on Software Engineering. IEEE Computer Society, Washington, DC, pp 3\u201312","DOI":"10.1109\/ICSE.2007.62"},{"key":"124_CR13","doi-asserted-by":"crossref","unstructured":"Eiben A, van der Hauw J (1997) Solving 3-SAT by GAs adapting constraint weights. Evolutionary computation, pp 81\u201386. doi: 10.1109\/ICEC.1997.592273","DOI":"10.1109\/ICEC.1997.592273"},{"key":"124_CR14","doi-asserted-by":"crossref","unstructured":"Folino G, Pizzuti C, Spezzano O (1998) Combining cellular genetic algorithms and local search for solving satisfiability problems. In: IEEE conference on tools with artificial intelligence, pp 192\u2013198","DOI":"10.1109\/TAI.1998.744842"},{"key":"124_CR15","unstructured":"Forrester J, Miller B (2000) An empirical study of the robustness of windows NT applications using random testing. In: USENIX Windows Systems Symposium, pp 59\u201368"},{"key":"124_CR16","unstructured":"Franzle M, Herde C, Teige T, Ratschan S, Schubert T (2007) Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. J Satisf Boolean Model Comput 1: 209\u2013236"},{"key":"124_CR17","doi-asserted-by":"crossref","unstructured":"Ganzinger H, Hagen G, Nieuwenhuis R, Oliveras A, Tinelli C (2004) DPLL(T): fast decision procedures. In: Alur R, Peled D (eds) Computer aided verification : 16th international conference, CAV 2004. Lecture Notes in Computer Science, vol 3114. Springer, Boston, pp 175\u2013188","DOI":"10.1007\/978-3-540-27813-9_14"},{"key":"124_CR18","doi-asserted-by":"crossref","unstructured":"Godefroid P (2007) Compositional dynamic test generation. In: 34th symposium on principles of programming languages (POPL). ACM, New York, pp 47\u201354. doi: 10.1145\/1190216.1190226","DOI":"10.1145\/1190216.1190226"},{"key":"124_CR19","doi-asserted-by":"crossref","unstructured":"Godefroid P, Klarlund N, Sen K (2005) DART: directed automated random testing. In: Proceedings of the ACM SIGPLAN conference on programming language design and implementation (PLDI), vol 40. ACM Press, New York, pp 213\u2013223. doi: 10.1145\/1064978.1065036","DOI":"10.1145\/1064978.1065036"},{"key":"124_CR20","unstructured":"Goldberg DE (1989) Genetic Algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co., Inc., Boston"},{"key":"124_CR21","doi-asserted-by":"crossref","unstructured":"Harman M (2007) Automated test data generation using search based software engineering. In: AST \u201907: proceedings of the second international workshop on automation of software test, p. 2. IEEE Computer Society, Washington. doi: 10.1109\/AST.2007.4","DOI":"10.1109\/AST.2007.4"},{"key":"124_CR22","doi-asserted-by":"crossref","unstructured":"Holzmann GJ, Joshi R, Groce A (2008) Swarm verification. In: Proceedings of the international conference on automated software engineering (ASE). IEEE, pp 1\u20136","DOI":"10.1109\/ASE.2008.9"},{"key":"124_CR23","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE neural networks, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"7","key":"124_CR24","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"JC King","year":"1976","unstructured":"King JC (1976) Symbolic execution and program testing. Commun ACM 19(7): 385\u2013394","journal-title":"Commun ACM"},{"key":"124_CR25","doi-asserted-by":"crossref","unstructured":"Majumdar R, Sen K (2007) Hybrid concolic testing. In: Proceedings of the International Conference on Software Engineering (ICSE), pp. 416\u2013426. doi: 10.1109\/ICSE.2007.41","DOI":"10.1109\/ICSE.2007.41"},{"key":"124_CR26","unstructured":"Marchiori E, Rossi C (1999) A flipping genetic algorithm for hard 3-SAT problems. In: Genetic and evolutionary computation conference, vol 1. Morgan Kaufmann, Orlando, pp 393\u2013400"},{"issue":"1","key":"124_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto M, Nishimura T (1998) Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul 8(1): 3\u201330. doi: 10.1145\/272991.272995","journal-title":"ACM Trans Model Comput Simul"},{"key":"124_CR28","unstructured":"National Institute of Standards and Technology (2002) The economic impacts of inadequate infrastructure for software testing. Planning Report 02-3"},{"key":"124_CR29","doi-asserted-by":"crossref","unstructured":"Pacheco C, Ernst M (2007) Randoop: feedback-directed random testing for Java. In: Companion to the 22nd Annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, OOPSLA, pp 815\u2013816","DOI":"10.1145\/1297846.1297902"},{"key":"124_CR30","unstructured":"Pacheco C, Ernst MD (2004) Eclat documents. Online manual. http:\/\/people.csail.mit.edu\/people\/cpacheco\/eclat\/"},{"key":"124_CR31","doi-asserted-by":"crossref","unstructured":"Pacheco C, Lahiri SK, Ernst MD, Ball T (2007) Feedback-directed random test generation. In: Proceedings of the international conference on software engineering (ICSE). IEEE Computer Society, Washington, DC, pp 75\u201384. doi: 10.1109\/ICSE.2007.37","DOI":"10.1109\/ICSE.2007.37"},{"key":"124_CR32","unstructured":"Qadeer S (2004) Daisy file system. Joint CAV\/ISSTA special event on specification, verification, and testing of concurrent software"},{"key":"124_CR33","unstructured":"Ranise S, Tinelli C (2006) The SMT-LIB standard: Version 1.2. Tech. rep."},{"key":"124_CR34","doi-asserted-by":"crossref","unstructured":"Rossi C, Marchiori E, Kok JN (2000) An adaptive evolutionary algorithm for the satisfiability problem. In: Symposium on applied computing (SAC). Como, Italy, pp 463\u2013469","DOI":"10.1145\/335603.335912"},{"key":"124_CR35","unstructured":"Ru N, Jianhua Y (2008) A GA and particle swarm optimization based hybrid algorithm. In: IEEE world congress on computational intelligence. Hong Kong"},{"key":"124_CR36","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1147\/sj.411.0004","volume":"41","author":"P Santhanam","year":"2002","unstructured":"Santhanam P, Hailpern B (2002) Software debugging, testing, and verification. IBM Syst J 41: 4\u201312","journal-title":"IBM Syst J"},{"key":"124_CR37","doi-asserted-by":"crossref","unstructured":"Sen K, Agha G (2006) CUTE and jCUTE: Concolic unit testing and explicit path model-checking tools. In: CAV, pp 419\u2013423","DOI":"10.21236\/ADA484701"},{"key":"124_CR38","doi-asserted-by":"crossref","unstructured":"Tinelli C (2002) A DPLL-based calculus for ground satisfiability modulo theories. In: Proceedings of the European conference on logics in artificial intelligence. Springer, London, pp 308\u2013319","DOI":"10.1007\/3-540-45757-7_26"},{"key":"124_CR39","doi-asserted-by":"crossref","unstructured":"Windisch A, Wappler S, Wegener J (2007) Applying particle swarm optimization to software testing. In: Lipson H (ed) Genetic and evolutionary computation conference, pp 1121\u20131128","DOI":"10.1145\/1276958.1277178"},{"key":"124_CR40","doi-asserted-by":"crossref","unstructured":"Wintersteiger C, Hamadi Y, de Moura L (2009) A concurrent portfolio approach to SMT solving, pp 715\u2013720","DOI":"10.1007\/978-3-642-02658-4_60"},{"issue":"4","key":"124_CR41","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/1037125","volume":"37","author":"TJ Ypma","year":"1995","unstructured":"Ypma TJ (1995) Historical development of the Newton\u2013Raphson method. SIAM Rev 37(4): 531\u2013551","journal-title":"SIAM Rev"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-010-0124-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11334-010-0124-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-010-0124-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:47:45Z","timestamp":1559396865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11334-010-0124-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,27]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s11334-010-0124-1","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"value":"1614-5046","type":"print"},{"value":"1614-5054","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,27]]}}}