Commit fba1955c authored by Lawrence Paulson's avatar Lawrence Paulson
Browse files

Merge (generating index again)

...@@ -870,6 +870,18 @@ topic = Computer Science/Automata and Formal Languages ...@@ -870,6 +870,18 @@ topic = Computer Science/Automata and Formal Languages
date = 2011-08-26 date = 2011-08-26
abstract = There are many proofs of the Myhill-Nerode theorem using automata. In this library we give a proof entirely based on regular expressions, since regularity of languages can be conveniently defined using regular expressions (it is more painful in HOL to define regularity in terms of automata). We prove the first direction of the Myhill-Nerode theorem by solving equational systems that involve regular expressions. For the second direction we give two proofs: one using tagging-functions and another using partial derivatives. We also establish various closure properties of regular languages. Most details of the theories are described in our ITP 2011 paper. abstract = There are many proofs of the Myhill-Nerode theorem using automata. In this library we give a proof entirely based on regular expressions, since regularity of languages can be conveniently defined using regular expressions (it is more painful in HOL to define regularity in terms of automata). We prove the first direction of the Myhill-Nerode theorem by solving equational systems that involve regular expressions. For the second direction we give two proofs: one using tagging-functions and another using partial derivatives. We also establish various closure properties of regular languages. Most details of the theories are described in our ITP 2011 paper.
[CYK]
title = A formalisation of the Cocke-Younger-Kasami algorithm
author = Maksym Bortin <mailto:Maksym.Bortin@nicta.com.au>
date = 2016-04-27
topic = Computer Science/Algorithms, Computer Science/Automata and Formal Languages
abstract =
The theory provides a formalisation of the Cocke-Younger-Kasami
algorithm (CYK for short), an approach to solving the word problem
for context-free languages. CYK decides if a word is in the
languages generated by a context-free grammar in Chomsky normal form.
The formalized algorithm is executable.
[Boolean_Expression_Checkers] [Boolean_Expression_Checkers]
title = Boolean Expression Checkers title = Boolean Expression Checkers
author = Tobias Nipkow <http://www.in.tum.de/~nipkow> author = Tobias Nipkow <http://www.in.tum.de/~nipkow>
......
This diff is collapsed.
chapter AFP
session CYK (AFP) = HOL +
options [timeout = 200]
theories
CYK
document_files
"root.bib"
"root.tex"
# -*- shell-script -*-
# Get email when automated build fails. May be empty.
# values: "email1 email2 .. emailn"
NOTIFY="maksym.bortin@nicta.com.au"
# Participate in frequent (nightly) build (only for small submissions)
# values: "yes" "no"
FREQUENT="yes"
@article{Younger1967,
author = "Daniel H. Younger",
title = "Recognition and parsing of context-free languages in time n3 ",
journal = "Information and Control ",
volume = "10",
number = "2",
pages = "189 - 208",
year = "1967",
note = "",
issn = "0019-9958",
doi = "http://dx.doi.org/10.1016/S0019-9958(67)80007-X",
url = "http://www.sciencedirect.com/science/article/pii/S001999586780007X"
}
\documentclass[11pt,a4paper]{article}
\usepackage{isabelle,isabellesym}
%\usepackage[sorting=none]{biblatex}
% this should be the last package used
\usepackage{pdfsetup}
% urls in roman style, theory text in math-similar italics
\urlstyle{rm}
\isabellestyle{it}
\begin{document}
\title{A formalisation of the Cocke-Younger-Kasami algorithm}
\author{Maksym Bortin}
\maketitle
\begin{abstract}
The theory provides a formalisation of the Cocke-Younger-Kasami
algorithm~\cite{Younger1967} (CYK for short), an approach to solving the
word problem for context-free languages. CYK decides if a word is in the
languages generated by a context-free grammar in Chomsky normal form.
The formalized algorithm is executable.
\end{abstract}
\tableofcontents
% include generated text of all theories
\input{session}
\bibliographystyle{abbrv}
\bibliography{root}
\end{document}
...@@ -50,6 +50,7 @@ Consensus_Refined ...@@ -50,6 +50,7 @@ Consensus_Refined
Containers Containers
CoreC++ CoreC++
CryptoBasedCompositionalProperties CryptoBasedCompositionalProperties
CYK
DPT-SAT-Solver DPT-SAT-Solver
DataRefinementIBP DataRefinementIBP
Datatype_Order_Generator Datatype_Order_Generator
......
<!DOCTYPE public "-//w3c//dtd html 4.01 transitional//en"
"http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<title>Archive of Formal Proofs</title>
<link rel="stylesheet" type="text/css" href="../front.css">
<script src="../jquery.min.js"></script>
<script src="../script.js"></script>
<link rel="icon" href="../images/favicon.ico" type="image/icon">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<table width="100%">
<tbody>
<tr>
<td width="20%" align="center" valign="top">
<!-- navigation -->
<!--#include file="nav.html"-->
</td>
<td width="80%" valign="top">
<!-- content -->
<div align="center">
<p>&nbsp;</p>
<h1><font class="first">A</font>
formalisation
of
the
<font class="first">C</font>ocke-Younger-Kasami
algorithm
</h1>
<p></p>
<table width="80%" class="data">
<tbody>
<tr><td class="datahead" width="20%">Title:</td>
<td class="data" width="80%">A formalisation of the Cocke-Younger-Kasami algorithm</td></tr>
<tr><td class="datahead">Author:</td>
<td class="data">Maksym Bortin (Maksym /dot/ Bortin /at/ nicta /dot/ com /dot/ au)</td></tr>
<tr><td class="datahead">Submission date:</td>
<td class="data">2016-04-27</td></tr>
<tr><td class="datahead" valign="top">Abstract:</td>
<td class="abstract">
The theory provides a formalisation of the Cocke-Younger-Kasami
algorithm (CYK for short), an approach to solving the word problem
for context-free languages. CYK decides if a word is in the
languages generated by a context-free grammar in Chomsky normal form.
The formalized algorithm is executable.
</td></tr>
<tr><td class="datahead" valign="top">BibTeX:</td>
<td class="formatted">
<pre>@article{CYK-AFP,
author = {Maksym Bortin},
title = {A formalisation of the Cocke-Younger-Kasami algorithm},
journal = {Archive of Formal Proofs},
month = apr,
year = 2016,
note = {\url{http://isa-afp.org/entries/CYK.shtml},
Formal proof development},
ISSN = {2150-914x},
}</pre>
</td></tr>
<tr><td class="datahead">License:</td>
<td class="data"><a href="http://isa-afp.org/LICENSE">BSD License</a></td></tr>
<!--#set var="status" value="-STATUS-" -->
<!--#set var="version" value="-VERSION-" -->
<!--#set var="afp-version" value="-AFPVERSION-" -->
<!---INCLUDE- file="devel-warning.shtml"-->
</tbody>
</table>
<p></p>
<!--#set var="name" value="CYK" -->
<!--#set var="binfo" value="../browser_info/current/AFP/${name}" -->
<!--#set var="doc" value="${binfo}/document.pdf" -->
<!--#set var="outline" value="${binfo}/outline.pdf" -->
<!--#set var="browse" value="${binfo}/index.html" -->
<!--#set var="tar" value="../release/afp-${name}-current.tar.gz" -->
<table class="links">
<tbody>
<tr>
<td class="links">
<a href="<!--#echo var="outline" -->">Proof outline</a><br>
<a href="<!--#echo var="doc" -->">Proof document</a>
</td>
<!-- link to README.hmtl if no document exists -->
</tr>
<tr>
<td class="links">
<a href="<!--#echo var="browse" -->">Browse theories</a>
</td></tr>
<tr>
<td class="links">
<a href="<!--#echo var="tar" -->">Download this entry</a>
</td>
</tr>
<tr><td class="links">Older releases:
None </td></tr>
</tbody>
</table>
<!-- entry data end -->
</td> </tr> </table>
</body>
</html>
...@@ -39,6 +39,7 @@ ...@@ -39,6 +39,7 @@
<a href="entries/MSO_Regex_Equivalence.shtml">MSO_Regex_Equivalence</a> &nbsp; <a href="entries/MSO_Regex_Equivalence.shtml">MSO_Regex_Equivalence</a> &nbsp;
<a href="entries/Formula_Derivatives.shtml">Formula_Derivatives</a> &nbsp; <a href="entries/Formula_Derivatives.shtml">Formula_Derivatives</a> &nbsp;
<a href="entries/Myhill-Nerode.shtml">Myhill-Nerode</a> &nbsp; <a href="entries/Myhill-Nerode.shtml">Myhill-Nerode</a> &nbsp;
<a href="entries/CYK.shtml">CYK</a> &nbsp;
<a href="entries/Presburger-Automata.shtml">Presburger-Automata</a> &nbsp; <a href="entries/Presburger-Automata.shtml">Presburger-Automata</a> &nbsp;
<a href="entries/Functional-Automata.shtml">Functional-Automata</a> &nbsp; <a href="entries/Functional-Automata.shtml">Functional-Automata</a> &nbsp;
<a href="entries/Statecharts.shtml">Statecharts</a> &nbsp; <a href="entries/Statecharts.shtml">Statecharts</a> &nbsp;
...@@ -67,6 +68,7 @@ ...@@ -67,6 +68,7 @@
<a href="entries/Roy_Floyd_Warshall.shtml">Roy_Floyd_Warshall</a> &nbsp; <a href="entries/Roy_Floyd_Warshall.shtml">Roy_Floyd_Warshall</a> &nbsp;
<a href="entries/Selection_Heap_Sort.shtml">Selection_Heap_Sort</a> &nbsp; <a href="entries/Selection_Heap_Sort.shtml">Selection_Heap_Sort</a> &nbsp;
<a href="entries/Dijkstra_Shortest_Path.shtml">Dijkstra_Shortest_Path</a> &nbsp; <a href="entries/Dijkstra_Shortest_Path.shtml">Dijkstra_Shortest_Path</a> &nbsp;
<a href="entries/CYK.shtml">CYK</a> &nbsp;
<a href="entries/Boolean_Expression_Checkers.shtml">Boolean_Expression_Checkers</a> &nbsp; <a href="entries/Boolean_Expression_Checkers.shtml">Boolean_Expression_Checkers</a> &nbsp;
<a href="entries/Depth-First-Search.shtml">Depth-First-Search</a> &nbsp; <a href="entries/Depth-First-Search.shtml">Depth-First-Search</a> &nbsp;
<a href="entries/FFT.shtml">FFT</a> &nbsp; <a href="entries/FFT.shtml">FFT</a> &nbsp;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment