Diabelli: A Heterogeneous Proof System

Urbas, Matej; Jamnik, Mateja

doi:10.1007/978-3-642-31365-3_44

Cited by 12 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is also possible to import sentential formulae into Speedith by translating them into spider diagrams. This pluggable feature of Speedith was exploited via the MixR framework [32] where Speedith was integrated with a sentential theorem prover Isabelle to result in the Diabelli [31] heterogeneous reasoning system (i.e., a mixture of diagrammatic and sentential inference steps make the statements and the proof of a theorem) -for more information, see [32].…”

Section: Architecture and Implementationmentioning

confidence: 99%

Speedith: A Reasoner for Spider Diagrams

Urbas

Jamnik

2015

J of Log Lang and Inf

Self Cite

View full text Add to dashboard Cite

In this paper, we introduce Speedith which is an interactive diagrammatic theorem prover for the well-known language of spider diagrams. Speedith provides a way to input spider diagrams, transform them via the diagrammatic inference rules, and prove diagrammatic theorems. Speedith's inference rules are sound and complete, extending previous research by including all the classical logic connectives. In addition to being a stand-alone proof system, Speedith is also designed as a program that plugs into existing general purpose theorem provers. This allows for other systems to access diagrammatic reasoning via Speedith, as well as a formal verification of diagrammatic proof steps within standard sentential proof assistants. We describe the general structure of Speedith, the diagrammatic language, the automatic mechanism that draws the diagrams when inference rules are applied on them, and how formal diagrammatic proofs are constructed.

show abstract

Section: Architecture and Implementationmentioning

confidence: 99%

Speedith: A Reasoner for Spider Diagrams

Urbas

Jamnik

2015

J of Log Lang and Inf

Self Cite

View full text Add to dashboard Cite

show abstract

“…Diabelli [21] is a heterogeneous proof system, allowing one to perform theorem proving with both diagrammatic and sentential formulae, and proof steps. It is shipped as a standalone tool combining Isabelle and Speedith.…”

Section: Related Platformsmentioning

confidence: 99%

CosyVerif: An Open Source Extensible Verification Environment

André

Lembachar

Petrucci³

et al. 2013

2013 18th International Conference on Engineering of Complex Computer Systems

View full text Add to dashboard Cite

Abstract-CosyVerif aims at gathering within a common framework various existing tools for specification and verification. It has been designed in order to 1) support different formalisms with the ability to easily create new ones, 2) provide a graphical user interface for every formalism, 3) include verification tools called via the graphical interface or via an API as a Web service, and 4) offer the possibility for a developer to integrate his/her own tool without much effort, also allowing it to interact with the other tools. Several tools have already been integrated for the formal verification of (extensions of) Petri nets and timed automata.

show abstract

“…Diabelli [23] is a heterogeneous proof system, allowing one to perform theorem proving with both diagrammatic and sentential formulae, and proof steps. It is shipped as a standalone tool combining Isabelle and Speedith.…”

Section: Related Platformsmentioning

confidence: 99%

A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems

André¹,

Barbot

Démoulins

et al. 2013

Formal Methods and Software Engineering

View full text Add to dashboard Cite

International audienceOver the past two decades, numerous verification tools have been successfully used for verifying complex concurrent systems, modelled using various formalisms. However, it is still hard to coordinate these tools since they rely on such a large number of formalisms. Having a proper syntactical mechanism to interrelate them through variability would increase the capability of effective integrated formal methods. In this paper, we propose a modular approach for defining new formalisms by reusing existing ones and adding new features and/or constraints. Our approach relies on standard XML technologies; their use provides the capability of rapidly and automatically obtaining tools for representing and validating models. It thus enables fast iterations in developing and testing complex formalisms. As a case study, we applied our modular definition approach on families of Petri nets and timed automata

show abstract

Diabelli: A Heterogeneous Proof System

Cited by 12 publications

References 2 publications

Speedith: A Reasoner for Spider Diagrams

Speedith: A Reasoner for Spider Diagrams

CosyVerif: An Open Source Extensible Verification Environment

A Modular Approach for Reusing Formalisms in Verification Tools of Concurrent Systems

Contact Info

Product

Resources

About