The combination of static and dynamic software analysis, such as data flow analysis (Dfa) and model checking, provides benefits for both disciplines. On the one hand, the information extracted by Dfas about program data may be utilized by model checkers to optimize the state space representation. On the other hand, the expressiveness of logic formulas allows us to consider model checkers as generic data flow analyzers. Following this second approach, we propose in this paper an algorithm to calculate Dfas using on-the-fly resolution of boolean equation systems (Bess). The overall framework includes the abstraction of the input program into an implicit labeled transition system (Lts), independent of the program specification language. Moreov...
AbstractModel-checking is a successful technique for automatically verifying concurrent finite-state...
Data flow analysis (DFA) is an important verification technique that computes the effect of data val...
A short version of this report was published at SPIN'2008.Equivalence checking is a classical verifi...
AbstractThe combination of static and dynamic software analysis, such as data flow analysis (Dfa) an...
Boolean Equation Systems (BESs) provide a useful framework for modeling various verification problem...
Boolean Equation Systems are a useful formalism for modeling various verification problems of finite...
AbstractOn-the-fly verification consists in analysing the correctness of a finite-state concurrent s...
International audienceAcceleration methods are commonly used for speeding up the convergence of loop...
Acceleration methods are commonly used for speeding up the convergence of loops in reachability anal...
Given a boolean equation system E and one of its bound variables X init , we propose a local algori...
We present a method for fighting the state space explosion of parameterised Boolean equation systems...
This paper describes FLAVERS, a finite-state verification approach that analyzes whether concurrent ...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Part of the Computer Sciences Commons This Article is brought to you for free and open access by the...
AbstractModel-checking is a successful technique for automatically verifying concurrent finite-state...
Data flow analysis (DFA) is an important verification technique that computes the effect of data val...
A short version of this report was published at SPIN'2008.Equivalence checking is a classical verifi...
AbstractThe combination of static and dynamic software analysis, such as data flow analysis (Dfa) an...
Boolean Equation Systems (BESs) provide a useful framework for modeling various verification problem...
Boolean Equation Systems are a useful formalism for modeling various verification problems of finite...
AbstractOn-the-fly verification consists in analysing the correctness of a finite-state concurrent s...
International audienceAcceleration methods are commonly used for speeding up the convergence of loop...
Acceleration methods are commonly used for speeding up the convergence of loops in reachability anal...
Given a boolean equation system E and one of its bound variables X init , we propose a local algori...
We present a method for fighting the state space explosion of parameterised Boolean equation systems...
This paper describes FLAVERS, a finite-state verification approach that analyzes whether concurrent ...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Model-checking is a successful technique for automatically verifying concurrent finite-state systems...
Part of the Computer Sciences Commons This Article is brought to you for free and open access by the...
AbstractModel-checking is a successful technique for automatically verifying concurrent finite-state...
Data flow analysis (DFA) is an important verification technique that computes the effect of data val...
A short version of this report was published at SPIN'2008.Equivalence checking is a classical verifi...