Symbolic automata for representing big code
From MaRDI portal
Publication:300407
DOI10.1007/s00236-015-0234-1zbMath1344.68128OpenAlexW2122249693MaRDI QIDQ300407
Hongseok Yang, Hila Peleg, Eran Yahav, Sharon Shoham
Publication date: 28 June 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:a594a7d2-c7c5-4a61-884b-0f44a89815b8
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)
Uses Software
Cites Work
- Unnamed Item
- Symbolic Automata for Static Specification Mining
- Abstract Semantic Differencing for Numerical Programs
- An efficient algorithm for solving word equations
- When Simulation Meets Antichains
- Typestate: A programming language concept for enhancing software reliability
- Mining specifications
- Synthesis of interface specifications for Java classes
- Tools and Algorithms for the Construction and Analysis of Systems
- Antichains: A New Algorithm for Checking Universality of Finite Automata
This page was built for publication: Symbolic automata for representing big code