Abstract. We present a decision procedure that combines reasoning about data-types and codatatypes. The dual of the acyclicity rule for datatypes is a unique-ness rule that identifies observationally equal codatatype values, including cyclic values. The procedure decides universal problems and is composable via the Nelson–Oppen method. It has been implemented in CVC4, a state-of-the-art SMT solver. An evaluation based on problems generated from theories developed with Isabelle demonstrates the potential of the procedure.
Abstract. Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite...
International audienceSMT (Satisfiability Modulo Theories) solvers are automatic verification engine...
Abstract. Satisfiability modulo theories (SMT) solvers that support quantifier instantiations via ma...
We present a decision procedure that combines reasoning about datatypes and codatatypes. The dual of...
We present a decision procedure that combines reasoning about datatypes and codatatypes. The dual of...
Abstract. We present a decision procedure that combines reasoning about data-types and codatatypes. ...
The theory of recursive data types is a valuable modeling tool for software verification. In the pas...
International audienceFormal methods in software and hardware design often generate formulas that ne...
The theory of recursive data types is a valuable modeling tool for software verification. In the pas...
AbstractFormal methods in software and hardware design often generate formulas that need to be valid...
Abstract. We give a fresh theoretical foundation for designing com-prehensive SMT solvers, generaliz...
Abstract. We give a fresh theoretical foundation for designing com-prehensive SMT solvers, generaliz...
SMT solvers are efficient tools to decide the satisfiability of ground formulas, including a number ...
AbstractSMT (Satisfiability Modulo Theories) solvers are automatic verification engines suitable to ...
SMT solvers can decide the satisfiability of ground formulas modulo a combination of built-in theori...
Abstract. Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite...
International audienceSMT (Satisfiability Modulo Theories) solvers are automatic verification engine...
Abstract. Satisfiability modulo theories (SMT) solvers that support quantifier instantiations via ma...
We present a decision procedure that combines reasoning about datatypes and codatatypes. The dual of...
We present a decision procedure that combines reasoning about datatypes and codatatypes. The dual of...
Abstract. We present a decision procedure that combines reasoning about data-types and codatatypes. ...
The theory of recursive data types is a valuable modeling tool for software verification. In the pas...
International audienceFormal methods in software and hardware design often generate formulas that ne...
The theory of recursive data types is a valuable modeling tool for software verification. In the pas...
AbstractFormal methods in software and hardware design often generate formulas that need to be valid...
Abstract. We give a fresh theoretical foundation for designing com-prehensive SMT solvers, generaliz...
Abstract. We give a fresh theoretical foundation for designing com-prehensive SMT solvers, generaliz...
SMT solvers are efficient tools to decide the satisfiability of ground formulas, including a number ...
AbstractSMT (Satisfiability Modulo Theories) solvers are automatic verification engines suitable to ...
SMT solvers can decide the satisfiability of ground formulas modulo a combination of built-in theori...
Abstract. Datatypes and codatatypes are useful for specifying and reasoning about (possibly infinite...
International audienceSMT (Satisfiability Modulo Theories) solvers are automatic verification engine...
Abstract. Satisfiability modulo theories (SMT) solvers that support quantifier instantiations via ma...