Mining specifications

DOI10.1145/503272.503275zbMath1323.68361OpenAlexW2295399529MaRDI QIDQ5178894

Rastislav Bodík, James R. Larus, Glenn Ammons

Publication date: 17 March 2015

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

Full work available at URL: https://doi.org/10.1145/503272.503275

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (17)

Inferring Canonical Register Automata ⋮ Symbolic automata for representing big code ⋮ Learning to verify branching time properties ⋮ Verifying pointer safety for programs with unknown calls ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Bootstrapping library-based synthesis ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Learning register automata: from languages to program structures ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ Unbounded procedure summaries from bounded environments ⋮ Discriminating Traces with Time ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ A state-based model of sensor protocols ⋮ Model Checking Merged Program Traces ⋮ Generating models of infinite-state communication protocols using regular inference with abstraction ⋮ Chosen-Ciphertext Security from Subset Sum ⋮ Active learning for extended finite state machines

This page was built for publication: Mining specifications