Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation
DOI10.1007/978-3-642-17511-4_3zbMATH Open1253.68218OpenAlexW1516229504MaRDI QIDQ3066089FDOQ3066089
Authors: Gourinath Banda, John P. Gallagher
Publication date: 7 January 2011
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://rucforsk.ruc.dk/ws/files/31511034/lpar16.pdf
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (9)
- A CTL-based logic for program abstractions
- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation
- Title not available (Why is that?)
- An abstract interpretation toolkit for \(\mu\)CRL
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Program specialization for verifying infinite state systems: an experimental evaluation
- Title not available (Why is that?)
Uses Software
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)