Scheduling Complexity of Interleaving Search

02/17/2022
by   Dmitry Rozplokhas, et al.
0

miniKanren is a lightweight embedded language for logic and relational programming. Many of its useful features come from a distinctive search strategy, called interleaving search. However, with interleaving search conventional ways of reasoning about the complexity and performance of logical programs become irrelevant. We identify an important key component – scheduling – which makes the reasoning for miniKanren so different, and present a semi-automatic technique to estimate the scheduling impact via symbolic execution for a reasonably wide class of programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2022

Unrealizability Logic

We consider the problem of establishing that a program-synthesis problem...
research
06/24/2019

Verifying Relational Properties using Trace Logic

We present a logical framework for the verification of relational proper...
research
04/10/2023

Scallop: A Language for Neurosymbolic Programming

We present Scallop, a language which combines the benefits of deep learn...
research
04/05/2013

Logical Fuzzy Preferences

We present a unified logical framework for representing and reasoning ab...
research
03/20/2019

Quantum Relational Hoare Logic with Expectations

We present a variant of the quantum relational Hoare logic from (Unruh, ...
research
01/09/2020

Killing Stubborn Mutants with Symbolic Execution

We introduce SeMu, a Dynamic Symbolic Execution technique that generates...
research
04/25/2018

Stratified Negation in Limit Datalog Programs

There has recently been an increasing interest in declarative data analy...

Please sign up or login with your details

Forgot password? Click here to reset