Deryaft: a tool for generating representation invariants of structurally complex data

Authors:
Muhammad Zubair Malik;Aman Pervaiz;Engin Uzuncaova;Sarfraz Khurshid
Affiliations:
University of Texas at Austin, Austin, TX, USA;University of Texas at Austin, Austin, TX, USA;University of Texas at Austin, Austin, TX, USA;University of Texas at Austin, Austin, TX, USA
Venue:
Proceedings of the 30th international conference on Software engineering
Year:
2008

Citing 9
Cited 1

Introduction to algorithms

Introduction to algorithms
The design and implementation of an intentional naming system

Proceedings of the seventeenth ACM symposium on Operating systems principles
Program Development in Java: Abstraction, Specification, and Object-Oriented Design

Program Development in Java: Abstraction, Specification, and Object-Oriented Design
Korat: automated testing based on Java predicates

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Lightweight Analysis of Object Interactions

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Dynamically discovering likely program invariants

Dynamically discovering likely program invariants
Assertion-based repair of complex data structures

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
An Automated Approach for Writing Alloy Specifications Using Instances

ISOLA '06 Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation
Generating representation invariants of structurally complex data

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems

Dynamic shape analysis of program heap using graph spectra (NIER track)

Proceedings of the 33rd International Conference on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deryaft is a tool for generating likely representation invariants of structurally complex data. Given a small set of concrete structures, Deryaft analyzes their key characteristics to formulate local and global properties that the structures exhibit. For effective formulation of structural invariants, Deryaft focuses on graph properties, including reachability, and views the program heap as an edge-labeled graph. Deryaft outputs a Java predicate that represents the invariants; the predicate takes an input structure and returns true if and only if it satisfies the invariants.