bug-bounty449
google357
microsoft315
facebook267
xss238
apple181
malware175
rce148
exploit127
bragging-post101
cve100
account-takeover93
phishing83
csrf79
privilege-escalation77
stored-xss65
supply-chain65
authentication-bypass62
dos60
browser58
reflected-xss57
react51
cloudflare49
input-validation48
reverse-engineering48
cross-site-scripting48
access-control47
docker46
smart-contract45
aws45
node45
ethereum43
web343
sql-injection42
defi42
web-application41
web-security40
ssrf38
burp-suite35
vulnerability-disclosure34
idor34
info-disclosure34
race-condition33
buffer-overflow33
html-injection33
cloud33
writeup32
oauth32
smart-contract-vulnerability32
information-disclosure30
0
7/10
research
This article explores how dependent type systems in Lean 4 can serve as executable specifications, allowing AI-generated code to be verified as correct by the compiler rather than through traditional testing. The author demonstrates this with a worked example of AI-generated sorting implementations where the type signature itself encodes the correctness proof.
dependent-types
type-systems
formal-verification
lean-4
ai-code-generation
proof-assistants
curry-howard-correspondence
refinement-types
correctness-by-construction
sorting-algorithms
inductive-types
theorem-proving
Lean 4
Claude
Curry-Howard correspondence
IEEE