Specification Inference Using Context-Free Language Reachability

DOI10.1145/2676726.2676977zbMath1345.68094OpenAlexW2132481916MaRDI QIDQ2819840

Osbert Bastani, Saswat Anand, Alex Aiken

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.734.4204

zbMATH Keywords

verificationprogram analysisspecification inference

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Bootstrapping library-based synthesis ⋮ Path querying with conjunctive grammars by matrix multiplication ⋮ Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization

This page was built for publication: Specification Inference Using Context-Free Language Reachability