Filters








1,470 Hits in 10.2 sec

Evaluating the use of a general-purpose benchmark suite for domain-specific SMT-solving

Andrew Healy, Rosemary Monahan, James F. Power
2016 Proceedings of the 31st Annual ACM Symposium on Applied Computing - SAC '16  
We show that workload-based clustering of benchmark programs increases the specificity of features tested by the suite compared to the inherent hierarchy of a general-purpose suite.  ...  Taking deductive software verification as a specific application domain for SMT-solvers, we present an approach to quantifying the difference between generalpurpose and domain-specific benchmark suites  ...  CONCLUSION This paper has presented a systematic quantitative method for the task-driven analysis and evaluation of a generalpurpose benchmark suite for domain-specific purposes.  ... 
doi:10.1145/2851613.2851975 dblp:conf/sac/HealyMP16 fatcat:4gz6tcujizg7tnyomxicbw4yge

Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers [chapter]

Jeevana Priya Inala, Rohit Singh, Armando Solar-Lezama
2016 Lecture Notes in Computer Science  
We can automatically generate variants of the solver tailored to different domains of problems represented in the bit-vector benchmark suite from the SMT competition 2015.  ...  Current SMT solvers are designed to be general purpose solvers that are suited to a wide range of problems.  ...  Different parts of Domains and Benchmarks We generate a total of 7 domain-specific solvers and a general solver which is obtained by using the entire QF_BV benchmark suite for pattern finding and synthesis  ... 
doi:10.1007/978-3-319-40970-2_19 fatcat:hllk3vwzfjd35mgkfnrrqzzdla

Just fuzz it: solving floating-point constraints using coverage-guided fuzzing

Daniel Liew, Cristian Cadar, Alastair F. Donaldson, J. Ryan Stinnett
2019 Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering - ESEC/FSE 2019  
We investigate the use of coverage-guided fuzzing as a means of proving satisfiability of SMT formulas over finite variable domains, with specific application to floating-point constraints.  ...  A coverage-guided fuzzer can then be used to search for an input that reaches the location, yielding a satisfying assignment.  ...  This research was generously sponsored by the UK EPSRC through grants EP/N007166/1, EP/P010040/1 and EP/R006865/1.  ... 
doi:10.1145/3338906.3338921 dblp:conf/sigsoft/LiewCDS19 fatcat:iplxqx3a5rgjhbkrentkbglv6m

Counterexample guided inductive optimization based on satisfiability modulo theories

Rodrigo F. Araújo, Higo F. Albuquerque, Iury V. de Bessa, Lucas C. Cordeiro, João E. Chaves Filho
2018 Science of Computer Programming  
The present algorithms are evaluated using a large set of benchmarks typically employed for evaluating optimization techniques.  ...  Experimental results show the efficiency and effectiveness of the proposed algorithms, which find the optimal solution in all evaluated benchmarks, while traditional techniques are usually trapped by local  ...  for the Improvement of Higher Education Personnel (CAPES).  ... 
doi:10.1016/j.scico.2017.10.004 fatcat:6ogg5lwxargzrlg3hpmhxtqhqm

Counterexample Guided Inductive Optimization [article]

Rodrigo F. Araujo, Higo F. Albuquerque, Iury V. de Bessa, Lucas C. Cordeiro, Joao Edgar C. Filho
2017 arXiv   pre-print
The present algorithms are evaluated using a large set of benchmarks typically employed for evaluating optimization techniques.  ...  Experimental results show the efficiency and effectiveness of the proposed algorithms, which find the optimal solution in all evaluated benchmarks, while traditional techniques are usually trapped by local  ...  For the experiment with the generalized algorithm, all benchmarks are employed; for the simplified algorithm, 15 functions are selected from the benchmark suite.  ... 
arXiv:1704.03738v1 fatcat:v5i4vxl6qnbmhbqtcmvefys6ne

An efficient constraint based framework forhandling floating point SMT problems [article]

Heytem Zitoun, Claude Michel, Laurent Michel, Michel Rueher
2020 arXiv   pre-print
The evaluation was conducted over 214 benchmarks (The Griggio suite) which is a standard within SMTLIB.  ...  This paper introduces the 2019 version of , a novel Constraint Programming framework for floating point verification problems expressed with the SMT language of SMTLIB.  ...  The evaluation was conducted over 214 benchmarks (The Griggio suite) which is a standard within SMTLIB.  ... 
arXiv:2002.12441v1 fatcat:adfddhkp5reqnl4uutmgbm73ve

OptCE: A Counterexample-Guided Inductive Optimization Solver [chapter]

Higo F. Albuquerque, Rodrigo F. Araújo, Iury V. Bessa, Lucas C. Cordeiro, Eddie B. de Lima Filho
2017 Lecture Notes in Computer Science  
Experimental results show that OptCE can effectively find optimal solutions for all evaluated benchmarks, while traditional techniques are usually trapped by local minima.  ...  This paper presents optimization through counterexamples (OptCE), which is a verification tool developed for optimizing target functions.  ...  Higo Albuquerque was also supported by a CAPES studentship.  ... 
doi:10.1007/978-3-319-70848-5_9 fatcat:sedr7oktbja5dm7kyibq32krqu

Predicting SMT Solver Performance for Software Verification

Andrew Healy, Rosemary Monahan, James F. Power
2017 Electronic Proceedings in Theoretical Computer Science  
The Why3 IDE and verification system facilitates the use of a wide range of Satisfiability Modulo Theories (SMT) solvers through a driver-based architecture.  ...  It does this in a time-efficient way using existing Why3 and solver installations - without requiring low-level knowledge about SMT solver operation from the user.  ...  The benchmarks in this library come from a diverse range of contributors working in numerous problem domains [35] and are not as specific to software verification as the Why3 suite of examples.  ... 
doi:10.4204/eptcs.240.2 fatcat:5rfj2xpgzrbprh77rizz67d4re

A Real-World Benchmark Model for Testing Concurrent Real-Time Systems in the Automotive Domain [chapter]

Jan Peleska, Artur Honisch, Florian Lapschies, Helge Löding, Hermann Schmid, Peer Smuda, Elena Vorobev, Cornelia Zahlten
2011 Lecture Notes in Computer Science  
We describe the underlying methodological concepts of the tool used for automated model-based test generation, which was developed by Verified Systems International GmbH in cooperation with Daimler and  ...  A test suite is described as initial reference for future competing solutions.  ...  Given these classes for a specific model, this induces 5 test suites to realize a comprehensive test generation benchmark. Evaluation criteria for test generation benchmarks.  ... 
doi:10.1007/978-3-642-24580-0_11 fatcat:n742jjnfn5gopp6zvovlgaiqx4

Evaluation of the SUN UltraSparc T2+ Processor for Computational Science [chapter]

Martin Sandrieser, Sabri Pllana, Siegfried Benkner
2009 Lecture Notes in Computer Science  
A set of benchmarks representing typical building blocks of scientific applications and a real-world hybrid MPI/OpenMP code for ocean simulation are used for performance evaluation.  ...  The intention of this evaluation is to investigate whether the current generation of massive chip multithreading processors is capable of providing competitive performance for non-server workloads in scientific  ...  The authors are grateful to Martin Wimmer for numerous discussions and helpful comments regarding the work presented in this paper.  ... 
doi:10.1007/978-3-642-01970-8_97 fatcat:ppz7trki6reptdqig5sqfm35ey

Induction for SMT Solvers [chapter]

Andrew Reynolds, Viktor Kuncak
2015 Lecture Notes in Computer Science  
We present a set of techniques that introduce inductive reasoning into SMT solving algorithms that is sound with respect to the interpretation of structures in SMT-LIB standard.  ...  In addition its overall effectiveness, it has an advantage of accepting SMT-LIB input and being integrated with other SMT solving techniques of CVC4.  ...  Acknowledgments We thank Ravichandhran Madhavan for an initial version of the Leon benchmarks and Cesare Tinelli for discussions about SMT-LIB semantics.  ... 
doi:10.1007/978-3-662-46081-8_5 fatcat:kd4apjhcijhb5lklpkmukazx44

GoRRiLA and Hard Reality [chapter]

Konstantin Korovin, Andrei Voronkov
2012 Lecture Notes in Computer Science  
Using GoRRiLA one can generate problems containing only a few variables, which however are difficult for all state-of-the-art solvers we tried.  ...  We call a theory problem a conjunction of theory literals and a theory solver any system that solves theory problems.  ...  Indeed, almost all problems in the standard SMT benchmark library SMT-LIB are problems with a non-trivial boolean structure and cannot be used for evaluating dedicated theory solvers.  ... 
doi:10.1007/978-3-642-29709-0_21 fatcat:tn6odrawb5cbtored6zp6rkw54

SMT-Based Bounded Model Checking for Embedded ANSI-C Software

Lucas Cordeiro, Bernd Fischer, Joao Marques-Silva
2012 IEEE Transactions on Software Engineering  
These limitations can be reduced by encoding word-level information in theories richer than propositional logic and using SMT solvers for the generated verification conditions.  ...  We have integrated the CVC3, Boolector, and Z3 solvers with the CBMC front-end and evaluated them using both standard software model checking benchmarks and typical embedded software applications from  ...  Colley for reviewing a draft version of this paper.  ... 
doi:10.1109/tse.2011.59 fatcat:3dxesi3xmndhzeurq5nvo3d2oe

SMT-Based Bounded Model Checking for Embedded ANSI-C Software

Lucas Cordeiro, Bernd Fischer, Joao Marques-Silva
2009 2009 IEEE/ACM International Conference on Automated Software Engineering  
These limitations can be reduced by encoding word-level information in theories richer than propositional logic and using SMT solvers for the generated verification conditions.  ...  We have integrated the CVC3, Boolector, and Z3 solvers with the CBMC front-end and evaluated them using both standard software model checking benchmarks and typical embedded software applications from  ...  Colley for reviewing a draft version of this paper.  ... 
doi:10.1109/ase.2009.63 dblp:conf/kbse/CordeiroFM09 fatcat:hyzlwhwnqbhyzafuefujrv4miq

A Survey on String Constraint Solving [article]

Roberto Amadini
2021 arXiv   pre-print
String solving approaches have become popular over the last years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and  ...  This paper reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the last decades to solve string constraints.  ...  A nice framework for the SCS benchmarks generation and evaluation is String- Fuzz [35] , a modular SMT-LIB problem instance transformer and generator for string solvers.  ... 
arXiv:2002.02376v8 fatcat:why6oeufmrbozbl22jlf7yivea
« Previous Showing results 1 — 15 out of 1,470 results