Bounded relational analysis of free data types

Authors:
Andriy Dunets;Gerhard Schellhorn;Wolfgang Reif
Affiliations:
Lehrstuhl für Softwaretechnik und Programmiersprachen, Institut für Informatik, Universität Augsburg, Augsburg, Germany;Lehrstuhl für Softwaretechnik und Programmiersprachen, Institut für Informatik, Universität Augsburg, Augsburg, Germany;Lehrstuhl für Softwaretechnik und Programmiersprachen, Institut für Informatik, Universität Augsburg, Augsburg, Germany
Venue:
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Year:
2008

Citing 12
Cited 5

Automating first-order relational logic

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Dynamic Logic

Dynamic Logic
Inductive Definitions: Automation and Application

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
KIV 3.0 for Provably Correct Systems

FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Flaw Detection in Formal Specifications

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Relational analysis of algebraic datatypes

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Automation for interactive proof: first prototype

Information and Computation - Special issue: Combining logical systems
Mondex, an electronic purse: specification and refinement checks with the Alloy model-finding method

Formal Aspects of Computing
Towards a Small Model Theorem for Data Independent Systems in Alloy

Electronic Notes in Theoretical Computer Science (ENTCS)
Kodkod: a relational model finder

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Geometric resolution: a proof procedure based on finite model search

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Expressiveness + automation + soundness: towards combining SMT solvers and interactive proof assistants

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Automating Algebraic Specifications of Non-freely Generated Data Types

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Automated Flaw Detection in Algebraic Specifications

Journal of Automated Reasoning
Relational analysis of (Co)inductive predicates, (Co)algebraic datatypes, and (Co)recursive functions

TAP'10 Proceedings of the 4th international conference on Tests and proofs
Nitpick: a counterexample generator for higher-order logic based on a relational model finder

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Relational analysis of (co)inductive predicates, (co)algebraic datatypes, and (co)recursive functions

Software Quality Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of freely generated data types. The presented approach aims at improving KIV's performance on first-order theories. In theorem proving practice a significant amount of time is spent on unsuccessful proof attempts. An automatic method that exhibits counter examples for unprovable theorems would offer an extremely valuable support for a proof engineer by saving his time and effort. In practice, such counterexamples tend to be small, so usually there is no need to search for big instances. The paper defines a translation from KIV's recursive definitions to Alloy, discusses its correctness and gives some examples.