Add to ORKGInternational audienceWe propose a purely implicit solution to the contextual assumption 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 assumptions by the CDNF algorithm — a learning algorithm for Boolean functions. We report three parametrized test cases where our solution outperforms the monolithic interpolation-based Model Checking algorithm
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Compositional reasoning aims to improve scalability of veri- fication tools by reducing the original...
Abstract. A recent approach to automated assume-guarantee reason-ing (AGR) for concurrent systems re...
International audienceWe propose a purely implicit solution to the contextual assumption generation ...
Abstract. We propose a purely implicit solution to the contextual as-sumption generation problem in ...
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. In this paper, we suggest three optimizations to the L*-based automated Assume-Guarantee r...
Abstract The learning-based automated Assume–Guarantee reasoning paradigm has been applied in the la...
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed ...
Software systems are taking on an increasingly important role in society and are being used in criti...
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...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Compositional reasoning aims to improve scalability of veri- fication tools by reducing the original...
Abstract. A recent approach to automated assume-guarantee reason-ing (AGR) for concurrent systems re...
International audienceWe propose a purely implicit solution to the contextual assumption generation ...
Abstract. We propose a purely implicit solution to the contextual as-sumption generation problem in ...
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. In this paper, we suggest three optimizations to the L*-based automated Assume-Guarantee r...
Abstract The learning-based automated Assume–Guarantee reasoning paradigm has been applied in the la...
Finite-state verification techniques are often hampered by the stateexplosion problem. One proposed ...
Software systems are taking on an increasingly important role in society and are being used in criti...
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...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Finite-state verification techniques are often hampered by the state-explosion problem. One proposed...
Compositional reasoning aims to improve scalability of veri- fication tools by reducing the original...
Abstract. A recent approach to automated assume-guarantee reason-ing (AGR) for concurrent systems re...