The Experts below are selected from a list of 7008 Experts worldwide ranked by ideXlab platform
Natasha Sharygina - One of the best experts on this subject based on the ideXlab platform.
-
a proof sensitive approach for small Propositional interpolants
Verified Software: Theories Tools Experiments, 2015Co-Authors: Grigory Fedyukovich, Antti E J Hyvarinen, Natasha SharyginaAbstract:The labeled interpolation system LIS is a framework for Craig interpolation widely used in Propositional-satisfiability-based model checking. Most LIS-based algorithms construct the interpolant from a proof of unsatisfiability and a fixed labeling determined by which part of the Propositional Formula is being over-approximated. While this results in interpolants with fixed strength, it limits the possibility of generating interpolants of small size. This is problematic since the interpolant size is a determining factor in achieving good overa performance in model checking. This paper analyses theoretically how labeling functions can be used to construct small interpolants. In addition to developing the new labeling mechanism guaranteeing small interpolants, we also present its versions managing the strength of the interpolants. We implement the labeling functions in our tool PeRIPLO and study the behavior of the resulting algorithms experimentally by integrating the tool to a variety of model checking applications. Our results suggest that the new proof-sensitive interpolation algorithm performs consistently better than any of the standard interpolation algorithms based on LIS.
-
VSTTE - A Proof-Sensitive Approach for Small Propositional Interpolants
Lecture Notes in Computer Science, 2015Co-Authors: Grigory Fedyukovich, Antti E J Hyvarinen, Natasha SharyginaAbstract:The labeled interpolation system LIS is a framework for Craig interpolation widely used in Propositional-satisfiability-based model checking. Most LIS-based algorithms construct the interpolant from a proof of unsatisfiability and a fixed labeling determined by which part of the Propositional Formula is being over-approximated. While this results in interpolants with fixed strength, it limits the possibility of generating interpolants of small size. This is problematic since the interpolant size is a determining factor in achieving good overa performance in model checking. This paper analyses theoretically how labeling functions can be used to construct small interpolants. In addition to developing the new labeling mechanism guaranteeing small interpolants, we also present its versions managing the strength of the interpolants. We implement the labeling functions in our tool PeRIPLO and study the behavior of the resulting algorithms experimentally by integrating the tool to a variety of model checking applications. Our results suggest that the new proof-sensitive interpolation algorithm performs consistently better than any of the standard interpolation algorithms based on LIS.
Nicolas Peltier - One of the best experts on this subject based on the ideXlab platform.
-
Decidability and Undecidability Results for Propositional Schemata
Journal of Artificial Intelligence Research, 2011Co-Authors: Vincent Aravantinos, Ricardo Caferra, Nicolas PeltierAbstract:We define a logic of Propositional Formula schemata adding to the syntax of Propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown to be undecidable for this new logic, but we introduce a very general class of schemata, called bound-linear, for which this problem becomes decidable. This result is obtained by reduction to a particular class of schemata called regular, for which we provide a sound and complete terminating proof procedure. This schemata calculus allows one to capture proof patterns corresponding to a large class of problems specified in Propositional logic. We also show that the satisfiability problem becomes again undecidable for slight extensions of this class, thus demonstrating that bound-linear schemata represent a good compromise between expressivity and decidability.
Grigory Fedyukovich - One of the best experts on this subject based on the ideXlab platform.
-
a proof sensitive approach for small Propositional interpolants
Verified Software: Theories Tools Experiments, 2015Co-Authors: Grigory Fedyukovich, Antti E J Hyvarinen, Natasha SharyginaAbstract:The labeled interpolation system LIS is a framework for Craig interpolation widely used in Propositional-satisfiability-based model checking. Most LIS-based algorithms construct the interpolant from a proof of unsatisfiability and a fixed labeling determined by which part of the Propositional Formula is being over-approximated. While this results in interpolants with fixed strength, it limits the possibility of generating interpolants of small size. This is problematic since the interpolant size is a determining factor in achieving good overa performance in model checking. This paper analyses theoretically how labeling functions can be used to construct small interpolants. In addition to developing the new labeling mechanism guaranteeing small interpolants, we also present its versions managing the strength of the interpolants. We implement the labeling functions in our tool PeRIPLO and study the behavior of the resulting algorithms experimentally by integrating the tool to a variety of model checking applications. Our results suggest that the new proof-sensitive interpolation algorithm performs consistently better than any of the standard interpolation algorithms based on LIS.
-
VSTTE - A Proof-Sensitive Approach for Small Propositional Interpolants
Lecture Notes in Computer Science, 2015Co-Authors: Grigory Fedyukovich, Antti E J Hyvarinen, Natasha SharyginaAbstract:The labeled interpolation system LIS is a framework for Craig interpolation widely used in Propositional-satisfiability-based model checking. Most LIS-based algorithms construct the interpolant from a proof of unsatisfiability and a fixed labeling determined by which part of the Propositional Formula is being over-approximated. While this results in interpolants with fixed strength, it limits the possibility of generating interpolants of small size. This is problematic since the interpolant size is a determining factor in achieving good overa performance in model checking. This paper analyses theoretically how labeling functions can be used to construct small interpolants. In addition to developing the new labeling mechanism guaranteeing small interpolants, we also present its versions managing the strength of the interpolants. We implement the labeling functions in our tool PeRIPLO and study the behavior of the resulting algorithms experimentally by integrating the tool to a variety of model checking applications. Our results suggest that the new proof-sensitive interpolation algorithm performs consistently better than any of the standard interpolation algorithms based on LIS.
W. Winsborough - One of the best experts on this subject based on the ideXlab platform.
-
Prop revisited: Propositional Formula as abstract domain for groundness analysis
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 1991Co-Authors: A. Cortesi, G. File, W. WinsboroughAbstract:The abstract domain Prop for analyzing variable groundness in logic programs is considered. This domain consists of (equivalence classes of) Propositional Formulas whose Propositional variables correspond to program variables with truth assignments indicating which program variables are ground. Some ambiguity remains about precisely which Formula should be included in Prop so that all interesting sets of program execution states (substitutions) have a unique representation. This ambiguity is clarified by characterizing, both semantically and syntactically, the appropriate definition of Prop. The use of Propositional Formulas for representing properties of substitutions of a different type than groundness, such as freeness and independence of variables, is discussed.
-
LICS - Prop revisited: Propositional Formula as abstract domain for groundness analysis
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 1Co-Authors: A. Cortesi, G. File, W. WinsboroughAbstract:The abstract domain Prop for analyzing variable groundness in logic programs is considered. This domain consists of (equivalence classes of) Propositional Formulas whose Propositional variables correspond to program variables with truth assignments indicating which program variables are ground. Some ambiguity remains about precisely which Formula should be included in Prop so that all interesting sets of program execution states (substitutions) have a unique representation. This ambiguity is clarified by characterizing, both semantically and syntactically, the appropriate definition of Prop. The use of Propositional Formulas for representing properties of substitutions of a different type than groundness, such as freeness and independence of variables, is discussed. >
Antti E J Hyvarinen - One of the best experts on this subject based on the ideXlab platform.
-
a proof sensitive approach for small Propositional interpolants
Verified Software: Theories Tools Experiments, 2015Co-Authors: Grigory Fedyukovich, Antti E J Hyvarinen, Natasha SharyginaAbstract:The labeled interpolation system LIS is a framework for Craig interpolation widely used in Propositional-satisfiability-based model checking. Most LIS-based algorithms construct the interpolant from a proof of unsatisfiability and a fixed labeling determined by which part of the Propositional Formula is being over-approximated. While this results in interpolants with fixed strength, it limits the possibility of generating interpolants of small size. This is problematic since the interpolant size is a determining factor in achieving good overa performance in model checking. This paper analyses theoretically how labeling functions can be used to construct small interpolants. In addition to developing the new labeling mechanism guaranteeing small interpolants, we also present its versions managing the strength of the interpolants. We implement the labeling functions in our tool PeRIPLO and study the behavior of the resulting algorithms experimentally by integrating the tool to a variety of model checking applications. Our results suggest that the new proof-sensitive interpolation algorithm performs consistently better than any of the standard interpolation algorithms based on LIS.
-
VSTTE - A Proof-Sensitive Approach for Small Propositional Interpolants
Lecture Notes in Computer Science, 2015Co-Authors: Grigory Fedyukovich, Antti E J Hyvarinen, Natasha SharyginaAbstract:The labeled interpolation system LIS is a framework for Craig interpolation widely used in Propositional-satisfiability-based model checking. Most LIS-based algorithms construct the interpolant from a proof of unsatisfiability and a fixed labeling determined by which part of the Propositional Formula is being over-approximated. While this results in interpolants with fixed strength, it limits the possibility of generating interpolants of small size. This is problematic since the interpolant size is a determining factor in achieving good overa performance in model checking. This paper analyses theoretically how labeling functions can be used to construct small interpolants. In addition to developing the new labeling mechanism guaranteeing small interpolants, we also present its versions managing the strength of the interpolants. We implement the labeling functions in our tool PeRIPLO and study the behavior of the resulting algorithms experimentally by integrating the tool to a variety of model checking applications. Our results suggest that the new proof-sensitive interpolation algorithm performs consistently better than any of the standard interpolation algorithms based on LIS.
