We outline an approach to use ordering-based theorem-proving strategies as satisfiability procedures for certain decidable theories. We report on experiments with synthetic benchmarks in the theory of arrays with extensionality, showing that a theorem prover - the E system - compares favorably with the state-of-the-art validity checker CVC
Abstract. We introduce the notion of array-based system as a suit-able abstraction of infinite state...
International audienceWe introduce the notion of array-based system as a suitable abstraction of inf...
AbstractThe Deductive Tableau of Manna and Waldinger is a formal system with an associated methodolo...
We outline an approach to use ordering-based theorem-proving strategies as satisfiability procedures...
International audienceThe theory of arrays, introduced by McCarthy in his seminal paper "Towards a m...
The theory of arrays, introduced by McCarthy in his seminal paper “Towards a mathematical science of...
The theory of arrays, introduced by McCarthy in his seminal paper "Toward a mathematical science of ...
We present an extension to an on-demand abstraction framework, which integrates deductive verificati...
The rewriting approach to T-satisfiability is based on establishing termination of a rewrite-based i...
A decision procedure for a theory of arrays is of inter-est for applications in formal verification,...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
AbstractWe show how a well-known superposition-based inference system for first-order equational log...
Program analysis and verification require decision procedures to reason on theories of data structur...
Abstract. We introduce the notion of array-based system as a suit-able abstraction of infinite state...
International audienceWe introduce the notion of array-based system as a suitable abstraction of inf...
AbstractThe Deductive Tableau of Manna and Waldinger is a formal system with an associated methodolo...
We outline an approach to use ordering-based theorem-proving strategies as satisfiability procedures...
International audienceThe theory of arrays, introduced by McCarthy in his seminal paper "Towards a m...
The theory of arrays, introduced by McCarthy in his seminal paper “Towards a mathematical science of...
The theory of arrays, introduced by McCarthy in his seminal paper "Toward a mathematical science of ...
We present an extension to an on-demand abstraction framework, which integrates deductive verificati...
The rewriting approach to T-satisfiability is based on establishing termination of a rewrite-based i...
A decision procedure for a theory of arrays is of inter-est for applications in formal verification,...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
AbstractWe show how a well-known superposition-based inference system for first-order equational log...
Program analysis and verification require decision procedures to reason on theories of data structur...
Abstract. We introduce the notion of array-based system as a suit-able abstraction of infinite state...
International audienceWe introduce the notion of array-based system as a suitable abstraction of inf...
AbstractThe Deductive Tableau of Manna and Waldinger is a formal system with an associated methodolo...
Add to ORKG