Abstract. We propose a purely implicit solution to the contextual as-sumption generation problem in assume-guarantee reasoning. Instead of improving the L ∗ algorithm — a learning algorithm for finite automata, our algorithm computes implicit representations of contextual assump-tions by the CDNF algorithm — a learning algorithm for Boolean func-tions. We report three parametrized test cases where our solution out-performs the monolithic interpolation-based Model Checking algorithm.
Abstract. A recent approach to automated assume-guarantee reason-ing (AGR) for concurrent systems re...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract. In this paper, we give an overview on some algorithms for learning automata. Starting with...
International audienceWe propose a purely implicit solution to the contextual assumption generation ...
International audienceWe compare two learning algorithms for generating contextual assumptions in au...
Assume-guarantee reasoning enables a “divide-and-conquer” approach to the verification of large syst...
Abstract The learning-based automated Assume–Guarantee reasoning paradigm has been applied in the la...
Software systems are taking on an increasingly important role in society and are being used in criti...
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed ...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract. In this paper, we suggest three optimizations to the L*-based automated Assume-Guarantee r...
Compositional verification is a promising approach to addressing the state explosion problem associa...
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the ...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract—We present a fully automated technique for com-positional verification of probabilistic sys...
Abstract. A recent approach to automated assume-guarantee reason-ing (AGR) for concurrent systems re...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract. In this paper, we give an overview on some algorithms for learning automata. Starting with...
International audienceWe propose a purely implicit solution to the contextual assumption generation ...
International audienceWe compare two learning algorithms for generating contextual assumptions in au...
Assume-guarantee reasoning enables a “divide-and-conquer” approach to the verification of large syst...
Abstract The learning-based automated Assume–Guarantee reasoning paradigm has been applied in the la...
Software systems are taking on an increasingly important role in society and are being used in criti...
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed ...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract. In this paper, we suggest three optimizations to the L*-based automated Assume-Guarantee r...
Compositional verification is a promising approach to addressing the state explosion problem associa...
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the ...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract—We present a fully automated technique for com-positional verification of probabilistic sys...
Abstract. A recent approach to automated assume-guarantee reason-ing (AGR) for concurrent systems re...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Abstract. In this paper, we give an overview on some algorithms for learning automata. Starting with...