Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
From MaRDI portal
Publication:3066089
Recommendations
Cited in
(12)- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation
- An abstract interpretation toolkit for \(\mu\)CRL
- Verifying increasingly expressive temporal logics for infinite-state systems
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- Program specialization for verifying infinite state systems: an experimental evaluation
- Efficient CTL verification via Horn constraints solving
- scientific article; zbMATH DE number 2086974 (Why is no real title available?)
- scientific article; zbMATH DE number 1504838 (Why is no real title available?)
- A CTL-based logic for program abstractions
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- Abstract interpretation with infinitesimals. Towards scalability in nonstandard static analysis
- Temporal abstract interpretation
This page was built for publication: Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066089)