StarExec: A cross-community infrastructure for logic solving
We introduce StarExec, a public web-based service built to facilitate the experimental
evaluation of logic solvers, broadly understood as automated tools based on formal …
evaluation of logic solvers, broadly understood as automated tools based on formal …
Computer-aided methods for social choice theory
The Four Color Theorem is a famous early example of a mathematical result that was proven
with the help of computers. Recent advances in artificial intelligence, particularly in …
with the help of computers. Recent advances in artificial intelligence, particularly in …
[PDF][PDF] PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms
PySMT: a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms Page 1 PySMT:
a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms Marco Gario and …
a Solver-Agnostic Library for Fast Prototyping of SMT-Based Algorithms Marco Gario and …
TOOLympics 2019: An overview of competitions in formal methods
Abstract Evaluation of scientific contributions can be done in many different ways. For the
various research communities working on the verification of systems (software, hardware, or …
various research communities working on the verification of systems (software, hardware, or …
Counterexample-guided quantifier instantiation for synthesis in SMT
We introduce the first program synthesis engine implemented inside an SMT solver. We
present an approach that extracts solution functions from unsatisfiability proofs of the …
present an approach that extracts solution functions from unsatisfiability proofs of the …
[HTML][HTML] Design and results of the fifth answer set programming competition
Abstract Answer Set Programming (ASP) is a well-established paradigm of declarative
programming that has been developed in the field of logic programming and non-monotonic …
programming that has been developed in the field of logic programming and non-monotonic …
Platform-independent benchmarks for task and motion planning
We present the first platform-independent evaluation method for task and motion planning
(TAMP). Previously point, various problems have been used to test individual planners for …
(TAMP). Previously point, various problems have been used to test individual planners for …
First international competition on runtime verification: rules, benchmarks, tools, and final results of CRV 2014
The first international Competition on Runtime Verification (CRV) was held in September
2014, in Toronto, Canada, as a satellite event of the 14th international conference on …
2014, in Toronto, Canada, as a satellite event of the 14th international conference on …
The SMT competition 2015–2018
Abstract The International Satisfiability Modulo Theories Competition is an annual
competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the …
competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the …
Decomposing software verification into off-the-shelf components: an application to CEGAR
Techniques for software verification are typically realized as cohesive units of software with
tightly coupled components. This makes it difficult to re-use components, and the potential …
tightly coupled components. This makes it difficult to re-use components, and the potential …