Synthesis of interface specifications for Java classes

DOI10.1145/1040305.1040314MaRDI QIDQ5276138zbMATH OpenOpenAlexFDO

Authors Pavol Černý, Parthasarathy Madhusudan, Wonhong Nam, Rajeev Alur

Publication date 14 July 2017

Published in Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://repository.upenn.edu/cgi/viewcontent.cgi?article=1167&context=cis_papers

zbMATH Keywords

synthesismodel checkingabstractiongamessoftware componentslearning regular languagesbehavioral interfaces

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• CONCUR 2005 – Concurrency Theory
• Publication:3043820
• Automated Technology for Verification and Analysis
• Synchronous and Bidirectional Component Interfaces
• Scientific article; zbMATH DE number 1912049

Cited in

(29)

• Learning residual alternating automata
• scientific article; zbMATH DE number 5189971 (Why is no real title available?)
• A state-based model of sensor protocols
• Learning Meets Verification
• Automatic symbolic compositional verification by learning assumptions
• Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
• Unbounded procedure summaries from bounded environments
• Automatic Synthesis of Assumptions for Compositional Model Checking
• scientific article; zbMATH DE number 1912049 (Why is no real title available?)
• Symbolic automata for representing big code
• Families of DFAs as acceptors of \(\omega\)-regular languages
• Verification of evolving software via component substitutability analysis
• Highly dependable concurrent programming using design for verification
• Modular strategies for recursive game graphs
• Active learning for extended finite state machines
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• CONCUR 2005 – Concurrency Theory
• Learning regular omega languages
• Compositional verification and 3-valued abstractions join forces
• Learning symbolic automata
• Types and trace effects for object orientation
• Verification, Model Checking, and Abstract Interpretation
• AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee
• Representing Java classes in a typed intermediate language
• Three optimizations for assume-guarantee reasoning with \(L^{*}\)
• Inferring regular languages and \(\omega\)-languages
• Automata learning with automated alphabet abstraction refinement
• Compositional reasoning

Describes a project that uses

Uses Software

• JIST
• Soot

This page was built for publication: Synthesis of interface specifications for Java classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276138)