Verifying annotated program families using symbolic game semantics
DOI10.1016/J.TCS.2017.09.029zbMATH Open1380.68121OpenAlexW2762612122MaRDI QIDQ1680558FDOQ1680558
Authors: Aleksandar Dimovski 
Publication date: 16 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.09.029
Recommendations
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- The regular-language semantics of second-order idealized ALGOL
- Compositional Predicate Abstraction from Game Semantics
- Program verification using symbolic game semantics
- Static Analysis
- CONCUR 2005 – Concurrency Theory
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Foundations of Software Science and Computational Structures
- An error-tolerant type system for variational lambda calculus
- Variability encoding: from compile-time to load-time variability
- Game semantic analysis of equivalence in IMJ
- Finding suitable variability abstractions for family-based analysis
- Title not available (Why is that?)
- Variability-specific abstraction refinement for family-based model checking
- From transition systems to variability models and from lifted model checking back to \textsf{UPPAAL}
Cited In (3)
Uses Software
This page was built for publication: Verifying annotated program families using symbolic game semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680558)
