Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and… Expand

Is this relevant?

2015

2015

We combine constrained literals for model representation with key concepts from first-order superposition and propositional… Expand

Is this relevant?

2015

2015

Formal validation of domain-specific languages with derived features and well-formedness constraints

Despite the wide range of existing tool support, constructing a design environment for a complex domain-specific language (DSL… Expand

Is this relevant?

2014

2014

First order logic with transitive closure, and separation logic enable elegant interactive verification of heap-manipulating… Expand

Is this relevant?

2013

2013

We show that every geometric morphism between realizability toposes satises the condition that its inverse image commutes with… Expand

Is this relevant?

2012

2012

It is well known that preprocessing is crucial for efficient reasoning on large industrial problems. Although preprocessing is… Expand

Is this relevant?

2010

2010

The Bernays-Schonfinkel class with Datalog is a 2-variable fragment of the Bernays-Schonfinkel class extended with least fixed… Expand

Is this relevant?

2010

2010

As is well-known, the Bernays-Schonfinkel-Ramsey class of all prenex ∃*∀*-sentences which are valid in classical first-order… Expand

Is this relevant?

2009

2009

8 Types 751 8.1 The general development of type theories . . . . . . . . . . . . . . . 751 8.1.1 Types as grammatical categories… Expand

Is this relevant?

2007

2007

The Bernays-Schonfinkel-Ramsey (BSR) class of formulas is the class of formulas that, when written in prenex normal form, have an… Expand

Is this relevant?