A generalization of the differential approach to recursive query evaluation
Journal of Logic Programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Data flow analysis is model checking of abstract interpretations
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Validating firewalls using flow logics
Theoretical Computer Science
Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems
Nordic Journal of Computing
Symbolic Finite Differencing - Part I
ESOP '90 Proceedings of the 3rd European Symposium on Programming
Action versus State based Logics for Transition Systems
Proceedings of the LITP Spring School on Theoretical Computer Science: Semantics of Systems of Concurrent Processes
Data Flow Analysis as Model Checking
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Nordic Journal of Computing
Flow logic: a multi-paradigmatic approach to static analysis
The essence of computation
A Universal Top-Down Fixpoint Algorithm
A Universal Top-Down Fixpoint Algorithm
Static validation of security protocols
Journal of Computer Security
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
CSF '09 Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium
Data-Flow analysis as model checking within the jABC
CC'06 Proceedings of the 15th international conference on Compiler Construction
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
Model checking as static analysis: revisited
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
Flow Logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it to deal with modal logics and prove that it can give an exact characterisation of the semantics of formulae in a modal logic. This shows that model checking can be performed by means of state-of-the-art approaches to static analysis and allow us to conclude that the problems of model checking and static analysis are reducible to each other. In terms of computational complexity we show that model checking by means of static analysis gives the same complexity bounds as are known for traditional approaches to model checking.