A calculus of mobile processes, I
Information and Computation
Set-based analysis of ML programs
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Systematic realisation of control flow analyses for CML
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Infinitary control flow analysis: a collecting semantics for closure analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric shape analysis via 3-valued logic
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Concurrent programming in ML
A simple applicative language: mini-ML
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Shape analysis for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
A Theory of Objects
Principles of Program Analysis
Principles of Program Analysis
The Definition of Standard ML
Flow Logic for Imperative Objects
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Toolkit for Constructing Type- and Constraint-Based Program Analyses
TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Flow Logics for Constraint Based Analysis
CC '98 Proceedings of the 7th International Conference on Compiler Construction
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Static validation of security protocols
Journal of Computer Security
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
Heuristics for Safety and Security Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Detecting and Preventing Type flaws: a Control Flow Analysis with Tags
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof optimization for partial redundancy elimination
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A Static Analysis for Beta-Binders
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational Analysis of Correlation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Bidirectional data-flow analyses, type-systematically
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
A Control Flow Analysis for Beta-binders with and without static compartments
Theoretical Computer Science
Control-flow analysis of function calls and returns by abstract interpretation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Securing Statically-verified Communications Protocols Against Timing Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid logical analyses of the ambient calculus
Information and Computation
From Flow Logic to static type systems for coordination languages
Science of Computer Programming
Hybrid logical analyses of the ambient calculus
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Locality-based security policies
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
From flow logic to static type systems for coordination languages
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Detecting and preventing type flaws at static time
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Modal abstractions of concurrent behavior
ACM Transactions on Computational Logic (TOCL)
Automated analysis of infinite scenarios
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Flow sensitive-insensitive pointer analysis based memory safety for multithreaded programs
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
Control-flow analysis of function calls and returns by abstract interpretation
Information and Computation
Analyzing security protocols in hierarchical networks
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Model checking Is static analysis of modal logic
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Control Flow Analysis of Generalised Boolean Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking as static analysis: revisited
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
Flow logic is an approach to static analysis that separates the specification of when an analysis estimate is acceptable for a program from the actual computation of the analysis information. It allows one not only to combine a variety of programming paradigms but also to link up with state-of-the-art developments in classical approaches to static analysis, in particular data flow analysis, constraint-based analysis and abstract interpretation. This paper gives a tutorial on flow logic and explains the underlying methodology; the multi-paradigmatic approach is illustrated by a number of examples including fimctional, imperative, object-oriented and concurrent constructs.