Add to ORKGAbstract. We propose a method to infer invariants of tree data struc-tures for higher-order functional programs. The method uses a machine learning technique for identifying a regular tree language from samples. The proposed method is combined with a recent technique for pro-gram verification based on higher-order model checking, yielding a fully-automated verification method for higher-order, tree-processing func-tional programs. We have implemented the prototype verifier and con-ducted preliminary experiments.
In the presence of data and computational resources, machine learning can be used to synthesize soft...
Recognizable tree sets are a generalization of regular languages. We show that the class of recogniz...
Although the program verification community has developed several techniques for analyzing software ...
Abstract. We propose a new method to verify that a higher-order, tree-processing functional program ...
We study the problem of learning regular tree languages from text. We show that the framework of fu...
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of ...
International audienceThis paper defines a new type system applied to the fully automatic verificati...
Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree langu...
International audienceThis paper describes a fully automatic technique for verifying safety properti...
This thesis studies how regular tree languages can be used to automatically verify properties on hig...
International audienceThis paper describes a verification framework for Hoare-style pre-and post-con...
AbstractWe investigate regular tree languages’ exact learning from positive examples and membership ...
This paper describes a fully automatic technique for verifying properties of higher-order functional...
In the presence of data and computational resources, machine learning can be used to synthesize soft...
Recognizable tree sets are a generalization of regular languages. We show that the class of recogniz...
Although the program verification community has developed several techniques for analyzing software ...
Abstract. We propose a new method to verify that a higher-order, tree-processing functional program ...
We study the problem of learning regular tree languages from text. We show that the framework of fu...
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of ...
International audienceThis paper defines a new type system applied to the fully automatic verificati...
Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree langu...
International audienceThis paper describes a fully automatic technique for verifying safety properti...
This thesis studies how regular tree languages can be used to automatically verify properties on hig...
International audienceThis paper describes a verification framework for Hoare-style pre-and post-con...
AbstractWe investigate regular tree languages’ exact learning from positive examples and membership ...
This paper describes a fully automatic technique for verifying properties of higher-order functional...
In the presence of data and computational resources, machine learning can be used to synthesize soft...
Recognizable tree sets are a generalization of regular languages. We show that the class of recogniz...
Although the program verification community has developed several techniques for analyzing software ...