Add to ORKGWe 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.
International audienceWe introduce the notion of array-based system as a suitable abstraction of inf...
Abstract. First-order logic provides a convenient formalism for describ-ing a wide variety of verifi...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...
We outline an approach to use ordering-based theorem-proving strategies as satisfiability procedures...
The theory of arrays, introduced by McCarthy in his seminal paper “Towards a mathematical science of...
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 "Toward a mathematical science of ...
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,...
AbstractWe show how a well-known superposition-based inference system for first-order equational log...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...
We present an extension to an on-demand abstraction framework, which integrates deductive verificati...
International audienceProgram analysis and verification require decision procedures to reason on the...
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...
Abstract. First-order logic provides a convenient formalism for describ-ing a wide variety of verifi...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...
We outline an approach to use ordering-based theorem-proving strategies as satisfiability procedures...
The theory of arrays, introduced by McCarthy in his seminal paper “Towards a mathematical science of...
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 "Toward a mathematical science of ...
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,...
AbstractWe show how a well-known superposition-based inference system for first-order equational log...
The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampir...
We present an extension to an on-demand abstraction framework, which integrates deductive verificati...
International audienceProgram analysis and verification require decision procedures to reason on the...
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...
Abstract. First-order logic provides a convenient formalism for describ-ing a wide variety of verifi...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...