Main

id

1551358

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-03-18 14:10:16

expired found date

-

created at

2024-05-28 04:06:21

updated at

2025-12-23 23:56:20

Domain name statistics

length

24

crc

42416

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

5694

mp size raw text

2982

mp inner links count

1

mp inner links status

20 (imported)

Open Graph

title

description

image

site name

author

updated

2025-12-05 18:03:43

raw text

Kedar Namjoshi I work in computer science at Bell Labs . My research is on simplifying the construction of provably correct and secure programs. Contact E-mail: kedar.namjoshi AT nokia-bell-labs.com Address: Room 2B-435, 600-700 Mountain Avenue, Murray Hill, NJ 07974, USA Producing good software is challenging. My research develops methods to simplify program construction while providing precise guarantees of correctness and security. Much of my research is driven by a fascinating interplay between the deductive and algorithmic approaches to program verification. Deductive methods formalize intuitive patterns of reasoning. Those patterns can be automated and used to guide correct program construction. Conversely, algorithmic methods such as model checking can be modified to generate deductive proofs that justify their results. Research Highlights Parameterized Protocol Verification: Cutoff theorems make it possible to show that a protocol...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Edukacja (47)

index version

2025110801

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

2289

text words

416

text unique words

245

text lines

64

text sentences

26

text paragraphs

6

text words per sentence

16

text matched phrases

1

text matched dictionaries

1

RSS

rss path

rss status

3 (priority 3 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

2 (priority 2 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

2024-07-01 15:31:49

sitemap first import date

-

sitemap last import date

-