Main

related bits

0

processing priority

3

site type

5 (wiki-type site, growing by topic rather than chronologically)

review version

11

html import

20 (imported)

Events

first seen date

2024-09-26 04:50:56

expired found date

-

created at

2024-09-26 04:50:56

updated at

2024-09-26 04:50:57

Domain name statistics

length

24

crc

53789

tld

86

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

87719371 (github.io)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

28555

mp size raw text

22476

mp inner links count

0

mp inner links status

1 (no links)

Open Graph

title

description

image

site name

author

updated

2026-03-06 14:34:33

raw text

Nekoka Home    Summary    Context    Goals    Team    Events    Papers    Contact Nekoka Realizing the Promise of Higher-Order SMT and Superposition for Interactive Verification     European Research Council (ERC) Consolidator Grant 2022 Grant Agreement No. 101083038 July 2023 – June 2028     Principal investigator:    Jasmin Blanchette Host institution:    Ludwig-Maximilians-Universität München , Germany Summary Proof assistants (also called interactive theorem provers) have a long history of being very tedious to use. The situation has improved markedly with the integration of first-order automatic theorem provers as backends. And recently, there have been exciting developments for more expressive logics, with the emergence of automatic provers based on optimized higher-order calculi. The Nekoka project's aim is to make higher-order SMT and λ-superposition a great fit for logical problems emerging from the verification of software and mathe...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Podsłuchy (13)

index version

1

spam phrases

0

Text statistics

text nonlatin

9

text cyrillic

0

text characters

18072

text words

3316

text unique words

1085

text lines

487

text sentences

155

text paragraphs

43

text words per sentence

21

text matched phrases

0

text matched dictionaries

0

RSS

rss path

rss status

1 (priority 1 already searched, no matches found)

rss found date

-

rss size orig

0

rss items

0

rss spam phrases

0

rss detected language

0 (awaiting analysis)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap path

sitemap status

1 (priority 1 already searched, no matches found)

sitemap review version

1

sitemap urls count

0

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

-

sitemap process date

-

sitemap first import date

-

sitemap last import date

-