A CTL-based logic for program abstractions

Authors:
Martin Lange;Markus Latte
Affiliations:
Dept. of Elect. Eng. and Computer Science, University of Kassel, Germany;Dept. of Computer Science, Ludwig-Maximilians-University Munich, Germany
Venue:
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Year:
2010

Citing 14
Cited 2

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
&ohgr;-languages

Handbook of formal languages, vol. 3
Pushdown processes: games and model-checking

Information and Computation - Special issue on FLOC '96
Action versus State based Logics for Transition Systems

Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Propositional dynamic logic with recursive programs

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

Extended computation tree logic

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Branching-time logics with path relativisation

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define an action-based extension of the branching-time temporal logic CTL which allows path quantifiers to be restricted by formal languages. The main purpose of this logic is its use in abstract interpretation. A reduction from a concrete system to an abstract one may contain spurious traces which can render the verification of the abstract system useless with respect to the concrete one. We pick up the suggestion to verify a modified property on the abstract system instead of the one that the concrete system is supposed to have. The logic introduced here enables a systematic modification of such properties. We present some ways of such a modification which aim at implicitly excluding spurious traces in the verification of abstracted systems.