Synthesis of interface specifications for Java classes

DOI10.1145/1040305.1040314zbMath1369.68126OpenAlexW2119467398MaRDI QIDQ5276138

Wonhong Nam, Pavol Černý, P. Madhusudan, 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

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

Related Items (24)

Modular strategies for recursive game graphs ⋮ Symbolic automata for representing big code ⋮ Compositional Reasoning ⋮ AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee ⋮ Learning regular omega languages ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Highly dependable concurrent programming using design for verification ⋮ Learning Meets Verification ⋮ Three optimizations for assume-guarantee reasoning with \(L^{*}\) ⋮ Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning ⋮ Verification of evolving software via component substitutability analysis ⋮ Automatic symbolic compositional verification by learning assumptions ⋮ Unbounded procedure summaries from bounded environments ⋮ Learning Symbolic Automata ⋮ A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees ⋮ A state-based model of sensor protocols ⋮ Compositional verification and 3-valued abstractions join forces ⋮ Automatic Synthesis of Assumptions for Compositional Model Checking ⋮ Active learning for extended finite state machines ⋮ Automata Learning with Automated Alphabet Abstraction Refinement ⋮ A novel learning algorithm for Büchi automata based on family of DFAs and classification trees ⋮ Unnamed Item ⋮ Types and trace effects for object orientation ⋮ Learning residual alternating automata

Uses Software

• Soot
• JIST

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