Verifying annotated program families using symbolic game semantics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- An error-tolerant type system for variational lambda calculus
- CONCUR 2005 – Concurrency Theory
- Compositional Predicate Abstraction from Game Semantics
- Finding suitable variability abstractions for family-based analysis
- Foundations of Software Science and Computational Structures
- From transition systems to variability models and from lifted model checking back to \textsf{UPPAAL}
- Full abstraction for PCF
- Game semantic analysis of equivalence in IMJ
- On full abstraction for PCF: I, II and III
- Program verification using symbolic game semantics
- Static Analysis
- The regular-language semantics of second-order idealized ALGOL
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Variability encoding: from compile-time to load-time variability
- Variability-specific abstraction refinement for family-based model checking
Cited in
(3)
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)