The vampire and the FOOL

Kotelnikov, Evgenii; Kovács, Laura; Reger, Giles; Воронков, Андрей

doi:10.1145/2854065.2854071

Cited by 22 publications

(23 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Whenever we refer to Vampire, we mean the Vampire version extended with our new VCNF FOOL clausification algorithm for FOOL. We will write Vampire for the previous version of Vampire with the FOOL2FOL algorithm of [8]; Vampire translates FOOL formulas to FOL (after which they are clausified in a standard way) and uses a special inference rule to avoid FOOL self-paramodulation.…”

Section: Resultsmentioning

confidence: 99%

“…We evaluate our work on three benchmark suites coming from verification and analysis of software and described in Section 4, and show experimentally that our method significantly improves over [8] by the number of solved problems and the runtime.…”

Section: Contributionsmentioning

confidence: 99%

“…For each one of the 20 loop-free benchmarks, we expressed its partial correctness as a TPTP problem using FOOL in the combination of the theory of linear integer arithmetic and the polymorphic theory of arrays [8]. To this end, (i) we formulated the safety assertion as a TPTP conjecture and (ii) expressed the transition relation of the program as a FOOL formula with tuple expressions and let-in expressions with tuple definitions.…”

Section: Experiments With Fool Reasoning About Programsmentioning

confidence: 99%

See 2 more Smart Citations

A Clausal Normal Form Translation for FOOL

Kotelnikov¹,

Kovács²,

Suda³

et al.

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

Automated theorem provers for first-order logic usually operate on sets of first-order clauses. It is well-known that the translation of a formula in full first-order logic to a clausal normal form (CNF) can crucially affect performance of a theorem prover. In our recent work we introduced a modification of first-order logic extended by the first class boolean sort and syntactical constructs that mirror features of programming languages. We called this logic FOOL. Formulas in FOOL can be translated to ordinary first-order formulas and checked by first-order theorem provers. While this translation is straightforward, it does not result in a CNF that can be efficiently handled by state-of-the-art theorem provers which use superposition calculus. In this paper we present a new CNF translation algorithm for FOOL that is friendly and efficient for superposition-based first-order provers. We implemented the algorithm in the Vampire theorem prover and evaluated it on a large number of problems coming from formalisation of mathematics and program analysis. Our experimental results show an increase of performance of the prover with our CNF translation compared to the naive translation.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Contributionsmentioning

confidence: 99%

Section: Experiments With Fool Reasoning About Programsmentioning

confidence: 99%

See 1 more Smart Citation

A Clausal Normal Form Translation for FOOL

Kotelnikov¹,

Kovács²,

Suda³

et al.

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Second, we extend symbol elimination with theory-specific reasoning. Unlike [2], we do not treat arrays as uninterpreted functions but exploit the read/write semantics of array operations and use the polymorphic theory of arrays [8] for generating and proving program properties over arrays. Our work is implemented in Vampire and evaluated on many examples from program analysis and verification.…”

Section: Each Negative Element Of the Arraymentioning

confidence: 99%

“…The recent work of [8] introduces an extension of first-order logic, called FOOL. FOOL extends first-order logic with first-class boolean variables and polymorphic arrays.…”

Section: First-order Reasoning About Array Propertiesmentioning

confidence: 99%

Theory-Specific Reasoning about Loops with Arrays using Vampire

Chen¹,

Kovács²,

Robillard³

EPiC Series in Computing

View full text Add to dashboard Cite

We describe new extensions of the first-order theorem prover Vampire for supporting program analysis and proving properties of loops with arrays. The common theme of our work is the symbol elimination method for generating loop invariants. In our work, we improve symbol elimination for program analysis in two ways. First, we enhance the program analysis framework of Vampire by simplifying skolemization during consequence finding. Second, we extend symbol elimination with theory-specific reasoning, in particular in the theory of polymorphic arrays, and generate and prove program properties over arrays. We illustrate our approach on a number of challenging examples coming from program analysis and verification. Our experiments show that, thanks to our improvements, programs that could not be analyzed before can now be verified with our method.

show abstract

Reachability Analysis for AWS-Based Networks

Backes

Bayless

Cook

et al. 2019

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Cloud services provide the ability to provision virtual networked infrastructure on demand over the Internet. The rapid growth of these virtually provisioned cloud networks has increased the demand for automated reasoning tools capable of identifying misconfigurations or security vulnerabilities. This type of automation gives customers the assurance they need to deploy sensitive workloads. It can also reduce the cost and time-to-market for regulated customers looking to establish compliance certification for cloud-based applications. In this industrial case-study, we describe a new network reachability reasoning tool, called Tiros, that uses off-the-shelf automated theorem proving tools to fill this need. Tiros is the foundation of a recently introduced network security analysis feature in the Amazon Inspector service now available to millions of customers building applications in the cloud. Tiros is also used within Amazon Web Services (AWS) to automate the checking of compliance certification and adherence to security invariants for many AWS services that build on existing AWS networking features.

show abstract

The vampire and the FOOL

Cited by 22 publications

References 19 publications

A Clausal Normal Form Translation for FOOL

A Clausal Normal Form Translation for FOOL

Theory-Specific Reasoning about Loops with Arrays using Vampire

Reachability Analysis for AWS-Based Networks

Contact Info

Product

Resources

About