scholarly journals GridTPT: a distributed platform for Theorem Prover Testing

10.29007/hk8w ◽  
2018 ◽  
Author(s):  
Thomas Bouton ◽  
Diego Caminha ◽  
David Déharbe ◽  
Pascal Fontaine
Keyword(s):  
Open Source ◽  
Future Development ◽  
Theorem Prover ◽  
Complex Task ◽  
Smt Solver ◽  
Requirement Specification ◽  
Open Source Tool ◽  
Theorem Provers ◽  
Distributed Platform ◽  
Implementation Resources

Programming provers is a complex task; completeness or even soundness may often be broken by apparently harmless bugs. A good testing platform can contribute in detecting problems early and helping development. This paper presents GridTPT, the distributed platform for testing the verit SMT solver. Its features are fairly standard, but it allows to easily distribute the task in a cluster.We plan to make this platform available as an open source tool for the community of developers of automated theorem provers. This presentation to PAAR'2010 will provide the opportunity to discuss the need for such a tool and the necessary features in a broader context. We would like to extract a requirement specification from this discussion, that would be useful to get dedicated implementation resources for distribution, maintenance and future development of GridTPT.

scholarly journals Rewrite rule inference using equality saturation

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-28
Author(s):  
Chandrakana Nandi ◽  
Max Willsey ◽  
Amy Zhu ◽  
Yisu Remy Wang ◽  
Brett Saiki ◽  
...  
Keyword(s):  
Open Source ◽  
Promising Technique ◽  
Rule Based ◽  
Domain Experts ◽  
Open Source Tool ◽  
Theorem Provers ◽  
Large Sets ◽  
Rewrite Rules ◽  
Rule Inference

Many compilers, synthesizers, and theorem provers rely on rewrite rules to simplify expressions or prove equivalences. Developing rewrite rules can be difficult: rules may be subtly incorrect, profitable rules are easy to miss, and rulesets must be rechecked or extended whenever semantics are tweaked. Large rulesets can also be challenging to apply: redundant rules slow down rule-based search and frustrate debugging. This paper explores how equality saturation, a promising technique that uses e-graphs to apply rewrite rules, can also be used to infer rewrite rules. E-graphs can compactly represent the exponentially large sets of enumerated terms and potential rewrite rules. We show that equality saturation efficiently shrinks both sets, leading to faster synthesis of smaller, more general rulesets. We prototyped these strategies in a tool dubbed Ruler. Compared to a similar tool built on CVC4, Ruler synthesizes 5.8× smaller rulesets 25× faster without compromising on proving power. In an end-to-end case study, we show Ruler-synthesized rules which perform as well as those crafted by domain experts, and addressed a longstanding issue in a popular open source tool.

scholarly journals Global Subsumption Revisited (Briefly)

10.29007/qcd7 ◽  
2018 ◽  
Author(s):  
Giles Reger ◽  
Martin Suda
Keyword(s):  
Initial Problem ◽  
Theorem Prover ◽  
General Idea ◽  
Practical Implementation ◽  
Global Approach ◽  
Smt Solver ◽  
First Order ◽  
Theorem Provers ◽  
Sat Solver

Global subsumption is an existing simplification technique for saturation-based first-order theorem provers. The general idea is that we can replace a clause C by its subclause D if D follows from the initial problem as D will subsume C. The effectiveness of the technique comes from a cheap, global approach for (incompletely) checking whether D is a consequence of the initial problem. The idea is to produce and maintain a set S of ground clauses that follow from the input (e.g. grounded versions of all derived clauses) and to check whether a grounding of D follows from this set. As this is now a propositional problem this check can be performed by a SAT solver, making it efficient. In this paper we review the global subsumption technique and pose a number of questions related to the practical implementation of global subsumption and possible variations of the approach. We consider, for example, which groundings to place in S, how to select the subclause(s) D to check, how to integrate this technique with the AVATAR approach and whether it makes sense to replace the SAT solver with an SMT solver. This discussion takes place within the context of the Vampire theorem prover.

scholarly journals Assessment of the regionalised demand response potential in Germany using an open source tool and dataset

2020 ◽  
pp. 100001
Author(s):  
Wilko Heitkoetter ◽  
Bruno U. Schyska ◽  
Danielle Schmidt ◽  
Wided Medjroubi ◽  
Thomas Vogt ◽  
...  
Keyword(s):  
Open Source ◽  
Demand Response ◽  
Open Source Tool

An open-source tool for visualization of climate mitigation scenarios: Mipplot

2021 ◽  
Vol 139 ◽  
pp. 105001 ◽  
Author(s):  
Yiyi Ju ◽  
Masahiro Sugiyama ◽  
Diego Silva Herran ◽  
Jiayang Wang ◽  
Akimitsu Inoue
Keyword(s):  
Open Source ◽  
Climate Mitigation ◽  
Open Source Tool ◽  
Mitigation Scenarios

MotilityJ: An Open-Source Tool for the Classification and Segmentation of Bacteria on Motility Images

2021 ◽  
pp. 104673
Author(s):  
Ángela Casado-García ◽  
Gabriela Chichón ◽  
César Domínguez ◽  
Manuel García-Domínguez ◽  
Jónathan Heras ◽  
...  
Keyword(s):  
Open Source ◽  
Open Source Tool

Retina: An open-source tool for flexible analysis of RTC traffic

2021 ◽  
pp. 108637
Author(s):  
Gianluca Perna ◽  
Dena Markudova ◽  
Martino Trevisan ◽  
Paolo Garza ◽  
Michela Meo ◽  
...  
Keyword(s):  
Open Source ◽  
Open Source Tool

Composing HARMONI: An Open-source Tool for Human and Robot Modular OpeN Interaction

2021 ◽  
Author(s):  
Micol Spitale ◽  
Chris Birmingham ◽  
R. Michael Swan ◽  
Maja J Mataric
Keyword(s):  
Open Source ◽  
Open Source Tool

scholarly journals ThManager: An Open Source Tool for Creating and Visualizing SKOS

2007 ◽  
Vol 26 (3) ◽  
pp. 39 ◽  
Author(s):  
Javier Lacasta ◽  
Javier Nogueras-Iso ◽  
Francisco Javier López-Pellicer ◽  
Pedro Rafail Muro-Medrano ◽  
Francisco Javier Zarazaga-Soria
Keyword(s):  
Information Retrieval ◽  
Open Source ◽  
Data Sharing ◽  
Digital Libraries ◽  
Knowledge Organization ◽  
Open Source Tool ◽  
Knowledge Models ◽  
Knowledge Organization Systems ◽  
Interchange Format

Knowledge organization systems denotes formally represented knowledge that is used within the context of digital libraries to improve data sharing and information retrieval. To increase their use, and to reuse them when possible, it is vital to manage them adequately and to provide them in a standard interchange format. Simple knowledge organization systems (SKOS) seem to be the most promising representation for the type of knowledge models used in digital libraries, but there is a lack of tools that are able to properly manage it. This work presents a tool that fills this gap, facilitating their use in different environments and using SKOS as an interchange format.

Sign in / Sign up

Export Citation Format

Share Document