1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841
|
(in-package "ACL2")
; file-system-4.lisp Mihir Mehta
; Here we define a more complex file system with a disk and an allocation bitmap.
; We first start with a file-system recognizer, and then we define various
; file-system operations.
; There used to be a long comment here about converting an instance of l4 to an
; instance of l3. We ended up bypassing this by converting to l2 instead, so
; the comment is no longer pertinent.
(include-book "file-system-3")
(include-book "../utilities/find-n-free-blocks")
(include-book "../utilities/set-indices")
(defthm mv-nth-replacement
(equal (mv-nth n (cons a b))
(if (zp n) a (mv-nth (- n 1) b))))
(in-theory (disable mv-nth))
;; could be handled differently using repeat... let's see.
(defun indices-marked-p (index-list alv)
(declare (xargs :guard (and (nat-listp index-list) (boolean-listp alv))))
(or (atom index-list)
(and (equal (nth (car index-list) alv) t)
(indices-marked-p (cdr index-list) alv))))
(defthm indices-marked-p-correctness-1
(implies (and (indices-marked-p index-list alv)
(equal b (len alv))
(nat-listp index-list))
(bounded-nat-listp index-list b)))
(defthm indices-marked-p-correctness-2
(equal
(indices-marked-p (binary-append x y) alv)
(and (indices-marked-p x alv) (indices-marked-p y alv))))
(defthm
indices-marked-p-correctness-3
(implies (and (nat-listp index-list1)
(nat-listp index-list2)
(boolean-listp alv)
(indices-marked-p index-list1 alv)
(bounded-nat-listp index-list1 (len alv)))
(indices-marked-p index-list1
(set-indices-in-alv alv index-list2 t)))
:hints
(("subgoal *1/5''" :in-theory (disable set-indices-in-alv-correctness-3
set-indices-in-alv-correctness-4)
:use ((:instance set-indices-in-alv-correctness-3
(value t)
(n (car index-list1))
(index-list index-list2))
(:instance set-indices-in-alv-correctness-4
(value t)
(n (car index-list1))
(index-list index-list2)))
:cases (member-equal (car index-list1)
index-list2))))
(encapsulate
()
(local (defun induction-scheme (l1 l2)
(if (atom l2)
l1
(induction-scheme (binary-append l1 (cons (car l2) nil)) (cdr l2)))))
(defthm
indices-marked-p-correctness-4
(implies (and (boolean-listp alv)
(bounded-nat-listp index-list1 (len alv))
(bounded-nat-listp index-list2 (len alv)))
(indices-marked-p
index-list2
(set-indices-in-alv alv
(binary-append index-list1 index-list2)
t)))
:hints (("Goal" :induct (induction-scheme index-list1 index-list2))))
)
(defthm
indices-marked-p-correctness-5
(implies (and (boolean-listp alv)
(bounded-nat-listp index-list (len alv)))
(indices-marked-p index-list
(set-indices-in-alv alv index-list t)))
:hints (("Goal" :in-theory (disable indices-marked-p-correctness-4)
:use (:instance indices-marked-p-correctness-4
(index-list2 index-list)
(index-list1 nil)))))
(defun l4-regular-file-entry-p (entry)
(declare (xargs :guard t))
(l3-regular-file-entry-p entry))
(defun l4-fs-p (fs)
(declare (xargs :guard t))
(l3-fs-p fs))
(defun l4-stat (hns fs disk)
(declare (xargs :guard (and (symbol-listp hns)
(l4-fs-p fs)
(block-listp disk))))
(l3-stat hns fs disk))
(defun l4-rdchs (hns fs disk start n)
(declare (xargs :guard (and (symbol-listp hns)
(l4-fs-p fs)
(natp start)
(natp n)
(block-listp disk))))
(l3-rdchs hns fs disk start n))
; This function writes a specified text string to a specified position to a
; text file at a specified path.
(defun l4-wrchs (hns fs disk alv start text)
(declare (xargs :guard (and (symbol-listp hns)
(l4-fs-p fs)
(natp start)
(stringp text)
(block-listp disk)
(boolean-listp alv)
(equal (len alv) (len disk)))))
(if (atom hns)
(mv fs disk alv) ;; error - showed up at fs with no name - so leave fs unchanged
(if (atom fs)
(mv nil disk alv) ;; error, so leave fs unchanged
(let ((sd (assoc (car hns) fs)))
(if (atom sd)
(mv fs disk alv) ;; file-not-found error, so leave fs unchanged
(let ((contents (cdr sd)))
(if (l3-regular-file-entry-p contents)
(if (cdr hns)
(mv (cons (cons (car sd) contents)
(remove1-assoc (car hns) fs))
disk
alv) ;; error, so leave fs unchanged
(let* ((old-text
(unmake-blocks
(fetch-blocks-by-indices disk (car contents))
(cdr contents)))
(alv-after-free
(set-indices-in-alv alv (car contents) nil))
(new-text (insert-text old-text start text))
(new-blocks (make-blocks new-text))
(new-indices
(find-n-free-blocks alv-after-free (len new-blocks))))
(if (not (equal (len new-indices) (len new-blocks)))
;; we have an error because of insufficient disk space
;; - so we leave the fs unchanged
(mv (cons (cons (car sd) contents)
(remove1-assoc (car hns) fs))
disk
alv)
(mv (cons (cons (car sd)
(cons new-indices (len new-text)))
(remove1-assoc (car hns) fs))
;; this (take) means we write as many blocks as we can
;; if we run out of space
(set-indices disk new-indices new-blocks)
(set-indices-in-alv alv-after-free new-indices t)))))
(mv-let (new-contents new-disk new-alv)
(l4-wrchs (cdr hns) contents disk alv start text)
(mv (cons (cons (car sd) new-contents)
(remove1-assoc (car hns) fs))
new-disk
new-alv)))
))))))
(defund
l4-list-all-indices (fs)
(declare (xargs :guard (l4-fs-p fs)))
(if (atom fs)
nil
(binary-append
(let ((directory-or-file-entry (car fs)))
(let ((entry (cdr directory-or-file-entry)))
(if (l4-regular-file-entry-p entry)
(car entry)
(l4-list-all-indices entry))))
(l4-list-all-indices (cdr fs)))))
(defthm l4-list-all-indices-correctness-1
(implies (l4-fs-p fs)
(nat-listp (l4-list-all-indices fs)))
:hints (("Goal" :in-theory (enable l4-list-all-indices)) ))
(defun l4-stricter-fs-p (fs alv)
(declare (xargs :guard t))
(and (l4-fs-p fs)
(boolean-listp alv)
(let ((all-indices (l4-list-all-indices fs)))
(and (no-duplicatesp all-indices)
(indices-marked-p all-indices alv)))))
(defthm
l4-wrchs-returns-fs
(implies
(and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk))
(l3-fs-p (mv-nth 0
(l4-wrchs hns fs disk alv start text))))
:hints (("subgoal *1/6"
:in-theory (enable l3-regular-file-entry-p))))
(defthm l4-wrchs-returns-alv
(implies (and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk))
(boolean-listp (mv-nth 2 (l4-wrchs hns fs disk alv start text)))))
(defun l4-collect-all-index-lists (fs)
(declare (xargs :guard (l4-fs-p fs)))
(if (atom fs)
nil
(let* ((directory-or-file-entry (car fs))
(entry (cdr directory-or-file-entry))
(tail (l4-collect-all-index-lists (cdr fs))))
(if (l4-regular-file-entry-p entry)
(cons (car entry) tail)
(binary-append (l4-collect-all-index-lists entry) tail))))
)
(defthm l4-collect-all-index-lists-correctness-1
(implies (l3-fs-p fs)
(true-list-listp (l4-collect-all-index-lists fs))))
(include-book "../utilities/member-intersectp")
;; This theorem shows the equivalence between two ways of listing indices
(defthm l4-collect-all-index-lists-correctness-2
(implies (l3-fs-p fs)
(equal (flatten (l4-collect-all-index-lists fs))
(l4-list-all-indices fs)))
:hints (("Goal" :in-theory (enable l4-list-all-indices)) ))
(defthm
l4-collect-all-index-lists-correctness-3
(implies
(l3-fs-p fs)
(equal (no-duplicatesp-equal (l4-list-all-indices fs))
(and (disjoint-list-listp (l4-collect-all-index-lists fs))
(no-duplicates-listp (l4-collect-all-index-lists fs)))))
:hints
(("goal" :in-theory (disable flatten-disjoint-lists)
:use ((:instance flatten-disjoint-lists
(l (l4-collect-all-index-lists fs)))))))
(defun indices-marked-listp (l alv)
(if (atom l)
(equal l nil)
(and (indices-marked-p (car l) alv) (indices-marked-listp (cdr l) alv))))
(defthm indices-marked-p-of-flatten
(implies (true-listp l)
(equal (indices-marked-p (flatten l) alv)
(indices-marked-listp l alv))))
(defthm l4-indices-marked-p-of-list-all-indices
(implies (l3-fs-p fs)
(equal (indices-marked-p (l4-list-all-indices fs)
alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)))
:hints (("goal" :in-theory (disable indices-marked-p-of-flatten)
:use (:instance indices-marked-p-of-flatten
(l (l4-collect-all-index-lists fs))))))
(defthm indices-marked-listp-of-binary-append
(implies (true-listp l1)
(equal (indices-marked-listp (binary-append l1 l2) alv)
(and (indices-marked-listp l1 alv)
(indices-marked-listp l2 alv)))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-1
(implies (and (not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(disjoint-list-listp (l4-collect-all-index-lists fs)))
(disjoint-list-listp
(l4-collect-all-index-lists (cdr (assoc-equal name fs)))))
:hints (("goal" :in-theory (enable disjoint-list-listp))))
(defthm l4-wrchs-returns-stricter-fs-lemma-2
(implies
(and (consp (assoc-equal name fs))
(not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(l3-fs-p fs)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv))
(indices-marked-listp
(l4-collect-all-index-lists (cdr (assoc-equal name fs)))
alv)))
(defthm l4-wrchs-returns-stricter-fs-lemma-3
(implies
(and
(consp (assoc-equal name fs))
(not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(l3-fs-p fs)
(no-duplicates-listp (l4-collect-all-index-lists fs)))
(no-duplicates-listp
(l4-collect-all-index-lists (cdr (assoc-equal name fs))))))
(defthm l4-wrchs-returns-stricter-fs-lemma-4
(implies (member-intersectp-equal l b)
(member-intersectp-equal l (cons a b)))
:hints (("Goal" :in-theory (enable not-intersectp-list
member-intersectp-is-commutative-lemma-3))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-5
(implies
(and (l3-fs-p fs)
(not (member-intersectp-equal (l4-collect-all-index-lists fs)
l)))
(not (member-intersectp-equal
l
(l4-collect-all-index-lists (remove1-assoc-equal name fs)))))
:hints (("Goal" :in-theory (enable not-intersectp-list))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-6
(implies (and (l3-fs-p fs)
(not-intersectp-list l (l4-collect-all-index-lists fs)))
(not-intersectp-list
l
(l4-collect-all-index-lists (remove1-assoc-equal name fs))))
:hints (("Goal" :in-theory (enable not-intersectp-list))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-7
(implies (and (l3-fs-p fs)
(disjoint-list-listp (l4-collect-all-index-lists fs)))
(disjoint-list-listp
(l4-collect-all-index-lists (remove1-assoc-equal name fs))))
:hints (("goal" :in-theory (enable disjoint-list-listp))))
(defthm l4-wrchs-returns-stricter-fs-lemma-8
(implies
(and (l3-fs-p fs)
(no-duplicates-listp (l4-collect-all-index-lists fs)))
(no-duplicates-listp
(l4-collect-all-index-lists (remove1-assoc-equal name fs)))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-9
(implies (and (l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv))
(indices-marked-listp
(l4-collect-all-index-lists (remove1-assoc-equal name fs))
alv)))
(defthm l4-wrchs-returns-stricter-fs-lemma-10
(implies (and (l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv))
(indices-marked-p (cadr (assoc-equal name fs))
alv)))
(defthm l4-wrchs-returns-stricter-fs-lemma-11
(implies (and (l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(l3-fs-p fs)
(no-duplicates-listp (l4-collect-all-index-lists fs)))
(no-duplicatesp-equal (cadr (assoc-equal name fs)))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-12
(implies (and (l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(l3-fs-p fs)
(not-intersectp-list l (l4-collect-all-index-lists fs)))
(not (intersectp-equal l (cadr (assoc-equal name fs)))))
:hints (("Goal" :in-theory (enable not-intersectp-list))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-13
(implies (and (l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(l3-fs-p fs)
(not (member-intersectp-equal (l4-collect-all-index-lists fs)
l)))
(not-intersectp-list (cadr (assoc-equal name fs))
l)))
(defthm
l4-wrchs-returns-stricter-fs-lemma-14
(implies (and (l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(l3-fs-p fs)
(disjoint-list-listp (l4-collect-all-index-lists fs)))
(not-intersectp-list
(cadr (assoc-equal name fs))
(l4-collect-all-index-lists (remove1-assoc-equal name fs))))
:hints (("goal" :in-theory (enable not-intersectp-list
disjoint-list-listp))))
(defthm l4-wrchs-returns-stricter-fs-lemma-15
(implies (indices-marked-p l alv)
(not (intersectp-equal l (find-n-free-blocks alv n)))))
(encapsulate ()
(set-default-hints
'(("goal"
:in-theory (enable fast-list-equiv)
:induct (fast-list-equiv index-list index-list-equiv))))
(defcong
list-equiv
equal (indices-marked-p index-list alv)
1)
(defcong
list-equiv equal
(fetch-blocks-by-indices block-list index-list)
2)
(set-default-hints
'(("goal"
:in-theory (enable fast-list-equiv)
:induct (fast-list-equiv fs fs-equiv))))
(defcong list-equiv equal (l4-list-all-indices fs) 1
:hints (("subgoal *1/4" :expand ((l4-list-all-indices fs)
(l4-list-all-indices fs-equiv)))
("subgoal *1/1" :expand ((l4-list-all-indices fs)
(l4-list-all-indices fs-equiv)))))
(defcong list-equiv equal (l3-to-l2-fs fs disk) 1
:hints (("subgoal *1/1" :expand ((l3-to-l2-fs fs disk)
(l3-to-l2-fs fs-equiv disk))))))
(defcong list-equiv equal (indices-marked-p index-list alv) 2)
(defcong list-equiv list-equiv
(set-indices-in-alv alv index-list value) 1
:hints (("goal" :in-theory (enable set-indices-in-alv))))
(defthm l4-wrchs-returns-stricter-fs-lemma-17
(implies (and (boolean-listp alv)
(nat-listp l)
(bounded-nat-listp index-list (len alv))
(indices-marked-p index-list alv)
(not (intersectp-equal l index-list)))
(indices-marked-p index-list
(set-indices-in-alv alv l nil))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-19
(implies (and (l3-fs-p fs)
(nat-listp l)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv))
(indices-marked-listp (l4-collect-all-index-lists fs)
(set-indices-in-alv alv l t))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-20
(implies
(and (consp (assoc-equal name fs))
(not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(l3-fs-p fs)
(not (member-intersectp-equal l (l4-collect-all-index-lists fs))))
(not (member-intersectp-equal
l
(l4-collect-all-index-lists (cdr (assoc-equal name fs)))))))
(defthm l4-wrchs-returns-stricter-fs-lemma-21
(implies (and (natp n)
(boolean-listp alv)
(indices-marked-listp l alv))
(not-intersectp-list (find-n-free-blocks alv n)
l))
:hints (("Goal" :in-theory (enable not-intersectp-list))))
(defcong list-equiv equal (INDICES-MARKED-LISTP L ALV) 2)
(defthm
l4-wrchs-returns-stricter-fs-lemma-22
(implies (and (boolean-listp alv)
(nat-listp index-list)
(true-list-listp l)
(bounded-nat-listp (flatten l)
(len alv))
(indices-marked-listp l alv)
(not-intersectp-list index-list l))
(indices-marked-listp l
(set-indices-in-alv alv index-list nil)))
:hints (("Goal" :in-theory (enable not-intersectp-list)
:expand (flatten l))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-24
(implies (and (l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(l3-fs-p fs)
(boolean-listp alv)
(bounded-nat-listp (l4-list-all-indices fs)
(len alv)))
(bounded-nat-listp (cadr (assoc-equal name fs))
(len alv)))
:hints (("goal" :induct (l4-list-all-indices fs)
:in-theory (enable l4-list-all-indices))))
(defthm l4-wrchs-returns-stricter-fs-lemma-25
(implies (and (l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv))
(bounded-nat-listp (l4-list-all-indices fs)
(len alv)))
:hints (("goal" :induct (l4-list-all-indices fs)
:in-theory (enable l4-list-all-indices))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-26
(implies (and (consp (assoc-equal name fs))
(not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(l3-fs-p fs)
(not-intersectp-list l (l4-collect-all-index-lists fs)))
(not-intersectp-list
l
(l4-collect-all-index-lists (cdr (assoc-equal name fs)))))
:hints (("Goal" :in-theory (enable not-intersectp-list))))
(defthmd
l4-wrchs-returns-stricter-fs-lemma-27
(implies
(and
(l3-fs-p fs)
(symbol-listp hns)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(bounded-nat-listp l (len alv))
(not-intersectp-list l (l4-collect-all-index-lists fs))
(indices-marked-p l alv))
(indices-marked-p l
(mv-nth 2
(l4-wrchs hns fs disk alv start text))))
:hints
(("Subgoal *1/5"
:in-theory (disable indices-marked-p-correctness-3)
:use
((:instance
indices-marked-p-correctness-3
(index-list1 l)
(alv (set-indices-in-alv alv (cadr (assoc-equal (car hns) fs))
nil))
(index-list2
(find-n-free-blocks
(set-indices-in-alv alv (cadr (assoc-equal (car hns) fs))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal (car hns) fs)))
(cddr (assoc-equal (car hns) fs)))
start text))))))
(:instance set-indices-in-alv-correctness-2
(index-list (cadr (assoc-equal (car hns) fs)))
(value nil))
(:instance
indices-marked-p-correctness-1
(index-list l)
(b (len (set-indices-in-alv alv (cadr (assoc-equal (car hns) fs))
nil))))))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-28
(implies
(and (l3-fs-p fs)
(symbol-listp hns)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(bounded-nat-listp (flatten l)
(len alv))
(not (member-intersectp-equal
l (l4-collect-all-index-lists fs)))
(indices-marked-listp l alv)
(true-list-listp l))
(indices-marked-listp
l
(mv-nth 2
(l4-wrchs hns fs disk alv start text))))
:hints
(("goal"
:in-theory (enable l4-wrchs-returns-stricter-fs-lemma-27)
:induct (indices-marked-listp l alv))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-30
(implies
(and (consp (assoc-equal name fs))
(not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(l3-fs-p fs)
(disjoint-list-listp (l4-collect-all-index-lists fs)))
(not (member-intersectp-equal
(l4-collect-all-index-lists (remove1-assoc-equal name fs))
(l4-collect-all-index-lists (cdr (assoc-equal name fs))))))
:hints
(("goal" :induct (mv (l4-collect-all-index-lists fs)
(l3-fs-p fs)
(assoc-equal name fs))
:do-not-induct t
:in-theory (enable disjoint-list-listp))
("subgoal *1/7''"
:in-theory (disable member-intersectp-is-commutative)
:use
(:instance
member-intersectp-is-commutative
(x (l4-collect-all-index-lists (cdr (assoc-equal name (cdr fs)))))
(y
(cons
(cadr (car fs))
(l4-collect-all-index-lists (remove1-assoc-equal name (cdr fs)))))))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-31
(implies
(and
(l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(consp (assoc-equal name fs))
(l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(<=
(len
(make-blocks
(insert-text
(unmake-blocks (fetch-blocks-by-indices
disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text)))
(count-free-blocks
(set-indices-in-alv alv (cadr (assoc-equal name fs))
nil))))
(l3-regular-file-entry-p
(cons
(find-n-free-blocks
(set-indices-in-alv alv (cadr (assoc-equal name fs))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks (fetch-blocks-by-indices
disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text))))
(len
(insert-text
(unmake-blocks (fetch-blocks-by-indices
disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text)))))
:hints (("goal" :in-theory (enable l3-regular-file-entry-p))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-32
(implies
(and
(l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(consp fs)
(consp (assoc-equal name fs))
(l3-regular-file-entry-p (cdr (assoc-equal name fs)))
(equal
(count-free-blocks (set-indices-in-alv alv (cadr (assoc-equal name fs))
nil))
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text)))))
(l3-regular-file-entry-p
(cons
(find-n-free-blocks
(set-indices-in-alv alv (cadr (assoc-equal name fs))
nil)
(count-free-blocks (set-indices-in-alv alv (cadr (assoc-equal name fs))
nil)))
(len
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text)))))
:hints (("goal" :in-theory (disable l4-wrchs-returns-stricter-fs-lemma-31)
:use l4-wrchs-returns-stricter-fs-lemma-31)))
(defthm
l4-wrchs-returns-stricter-fs-lemma-33
(implies
(and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(not-intersectp-list l (l4-collect-all-index-lists fs))
(indices-marked-p l alv)
(nat-listp l))
(not-intersectp-list l
(l4-collect-all-index-lists
(mv-nth 0
(l4-wrchs hns fs disk alv start text)))))
:hints (("Goal" :in-theory (enable not-intersectp-list))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-34
(implies
(and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(not (member-intersectp-equal l (l4-collect-all-index-lists fs)))
(indices-marked-listp l alv)
(nat-listp (flatten l))
(true-list-listp l))
(not (member-intersectp-equal
l
(l4-collect-all-index-lists
(mv-nth 0
(l4-wrchs hns fs disk alv start text))))))
:hints (("Goal" :induct (indices-marked-listp l alv))
("Subgoal *1/2" :expand (flatten l))))
(defthm
l4-wrchs-returns-stricter-fs-lemma-35
(implies
(and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk))
(not (member-intersectp-equal l (l4-collect-all-index-lists fs)))
(indices-marked-listp l alv)
(nat-listp (flatten l))
(true-list-listp l))
(not (member-intersectp-equal
l
(l4-collect-all-index-lists
(mv-nth 0
(l4-wrchs hns fs disk alv start text))))))
:hints (("goal" :induct (indices-marked-listp l alv))
("subgoal *1/2" :expand (flatten l))))
;; Find a simpler problem that doesn't have all these details, that shows the
;; same kind of issue.
(defthm l4-wrchs-returns-stricter-fs
(implies (and (symbol-listp hns)
(l4-stricter-fs-p fs alv)
(natp start)
(stringp text)
(block-listp disk)
(equal (len alv) (len disk)))
(mv-let (new-fs new-disk new-alv)
(l4-wrchs hns fs disk alv start text)
(declare (ignore new-disk))
(l4-stricter-fs-p new-fs new-alv)))
:hints (("goal" :in-theory (enable disjoint-list-listp)
:induct (l4-wrchs hns fs disk alv start text)
:do-not-induct t)))
(defun l4-to-l2-fs (fs disk)
(declare (xargs :guard (and (l4-fs-p fs) (block-listp disk))
))
(l3-to-l2-fs fs disk))
;; This theorem shows the type-correctness of l4-to-l2-fs.
(defthm l4-to-l2-fs-correctness-1
(implies (and (l4-fs-p fs) (block-listp disk))
(l2-fs-p (l4-to-l2-fs fs disk))))
;; This is the first of two theorems showing the equivalence of the l4 and l2
;; versions of stat.
(defthm l4-stat-correctness-1
(implies (and (symbol-listp hns)
(l4-fs-p fs)
(block-listp disk)
(stringp (l4-stat hns fs disk)))
(equal (l2-stat hns (l4-to-l2-fs fs disk))
(l4-stat hns fs disk))))
;; This is the second of two theorems showing the equivalence of the l4 and l2
;; versions of stat.
(defthm l4-stat-correctness-2
(implies (and (symbol-listp hns)
(l4-fs-p fs)
(block-listp disk)
(l4-fs-p (l4-stat hns fs disk)))
(equal (l2-stat hns (l4-to-l2-fs fs disk))
(l4-to-l2-fs (l4-stat hns fs disk)
disk))))
;; This theorem proves the equivalence of the l4 and l2 versions of rdchs.
(defthm l4-rdchs-correctness-1
(implies (and (symbol-listp hns)
(l4-fs-p fs)
(natp start)
(natp n)
(block-listp disk))
(equal (l2-rdchs hns (l4-to-l2-fs fs disk) start n)
(l4-rdchs hns fs disk start n))))
(defcong list-equiv equal (fetch-blocks-by-indices block-list index-list) 1)
(defthm
l4-wrchs-correctness-1-lemma-1
(implies (and (natp key)
(< key (len block-list))
(block-listp block-list)
(nat-listp index-list)
(not (member-equal key index-list)))
(equal (fetch-blocks-by-indices (update-nth key val block-list)
index-list)
(fetch-blocks-by-indices block-list index-list))))
(defthm l4-wrchs-correctness-1-lemma-2
(implies (and (l3-regular-file-entry-p (cdr (car fs)))
(not (member-equal index (l4-list-all-indices fs))))
(not (member-equal index (cadr (car fs)))))
:hints (("goal" :in-theory (enable l4-list-all-indices))))
(defthm
l4-wrchs-correctness-1-lemma-3
(implies (and (consp fs)
(l3-fs-p fs)
(member-equal index (l4-list-all-indices (cdr fs))))
(member-equal index (l4-list-all-indices fs)))
:hints (("goal" :expand (l4-list-all-indices fs))))
(defthm
l4-wrchs-correctness-1-lemma-4
(implies (and (l3-fs-p fs)
(consp (car fs))
(l3-fs-p (cdr (car fs)))
(member-equal index
(l4-list-all-indices (cdr (car fs)))))
(member-equal index (l4-list-all-indices fs)))
:hints (("goal" :expand (l4-list-all-indices fs))))
(defcong list-equiv equal (l3-to-l2-fs fs disk) 2)
(defthm l4-wrchs-correctness-1-lemma-5
(implies (and (l3-fs-p fs)
(block-listp disk)
(integerp index)
(<= 0 index)
(< index (len disk))
(not (member-equal index (l4-list-all-indices fs))))
(equal (l3-to-l2-fs fs (update-nth index value disk))
(l3-to-l2-fs fs disk))))
(defthm l4-wrchs-correctness-1-lemma-6
(implies (and (consp index-list)
(member-equal (car index-list)
(l4-list-all-indices fs))
(l3-fs-p fs)
(nat-listp (cdr index-list)))
(not (not-intersectp-list index-list
(l4-collect-all-index-lists fs))))
:hints (("goal" :in-theory (enable l4-list-all-indices not-intersectp-list))))
(defthm
l4-wrchs-correctness-1-lemma-7
(implies (and (consp index-list)
(not (not-intersectp-list (cdr index-list)
(l4-collect-all-index-lists fs)))
(l3-fs-p fs))
(not (not-intersectp-list index-list
(l4-collect-all-index-lists fs))))
:hints (("goal" :in-theory (enable l4-collect-all-index-lists not-intersectp-list))))
(defthm l4-wrchs-correctness-1-lemma-8
(implies (and (block-listp disk)
(natp key)
(< key (len disk))
(character-listp val)
(equal (len val) *blocksize*))
(block-listp (update-nth key val disk))))
(defthm
l4-wrchs-correctness-1-lemma-9
(implies (and (l3-fs-p fs)
(block-listp disk)
(not-intersectp-list index-list
(l4-collect-all-index-lists fs))
(bounded-nat-listp index-list (len disk))
(block-listp value-list)
(equal (len value-list)
(len index-list)))
(equal (l3-to-l2-fs fs
(set-indices disk index-list value-list))
(l3-to-l2-fs fs disk)))
:hints
(("subgoal *1/7''" :in-theory (disable l4-wrchs-correctness-1-lemma-5)
:use (:instance l4-wrchs-correctness-1-lemma-5
(index (car index-list))
(value (car value-list))))))
(defthm l4-wrchs-correctness-1-lemma-11
(implies (and (natp n)
(boolean-listp alv)
(indices-marked-listp l alv))
(not-intersectp-list (find-n-free-blocks alv n)
l)))
(defthm
l4-wrchs-correctness-1-lemma-12
(implies
(and (l3-fs-p fs1)
(l3-fs-p fs2)
(boolean-listp alv)
(disjoint-list-listp (l4-collect-all-index-lists fs1))
(no-duplicates-listp (l4-collect-all-index-lists fs1))
(indices-marked-listp (l4-collect-all-index-lists fs1)
alv)
(indices-marked-listp (l4-collect-all-index-lists fs2)
alv)
(stringp text)
(integerp start)
(<= 0 start)
(symbol-listp hns)
(block-listp disk)
(equal (len alv) (len disk))
(<= 0 (count-free-blocks alv))
(not (member-intersectp-equal
(l4-collect-all-index-lists fs1)
(l4-collect-all-index-lists fs2))))
(equal (l3-to-l2-fs
fs2
(mv-nth 1
(l4-wrchs hns fs1 disk alv start text)))
(l3-to-l2-fs fs2 disk)))
:hints
(("subgoal *1/11.2''"
:in-theory (disable l4-wrchs-correctness-1-lemma-9
find-n-free-blocks-correctness-7)
:use
((:instance
find-n-free-blocks-correctness-7
(alv (set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil))
(n
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(:instance
l4-wrchs-correctness-1-lemma-9 (fs fs2)
(index-list
(find-n-free-blocks
(set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(value-list
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text))))))
("subgoal *1/10.2''"
:in-theory (disable l4-wrchs-correctness-1-lemma-9
find-n-free-blocks-correctness-7)
:use
((:instance
find-n-free-blocks-correctness-7
(alv (set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil))
(n
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(:instance
l4-wrchs-correctness-1-lemma-9 (fs fs2)
(index-list
(find-n-free-blocks
(set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(value-list
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text))))))
("subgoal *1/8.2''"
:in-theory (disable l4-wrchs-correctness-1-lemma-9
find-n-free-blocks-correctness-7)
:use
((:instance
find-n-free-blocks-correctness-7
(alv (set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil))
(n
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(:instance
l4-wrchs-correctness-1-lemma-9 (fs fs2)
(index-list
(find-n-free-blocks
(set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(value-list
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text))))))
("subgoal *1/7.2''"
:in-theory (disable l4-wrchs-correctness-1-lemma-9
find-n-free-blocks-correctness-7)
:use
((:instance
find-n-free-blocks-correctness-7
(alv (set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil))
(n
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(:instance
l4-wrchs-correctness-1-lemma-9 (fs fs2)
(index-list
(find-n-free-blocks
(set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(value-list
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text))))))
("subgoal *1/6.2''"
:in-theory (disable l4-wrchs-correctness-1-lemma-9
find-n-free-blocks-correctness-7)
:use
((:instance
find-n-free-blocks-correctness-7
(alv (set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil))
(n
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(:instance
l4-wrchs-correctness-1-lemma-9 (fs fs2)
(index-list
(find-n-free-blocks
(set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(value-list
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text))))))
("subgoal *1/4.2''"
:in-theory (disable l4-wrchs-correctness-1-lemma-9
find-n-free-blocks-correctness-7)
:use
((:instance
find-n-free-blocks-correctness-7
(alv (set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil))
(n
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(:instance
l4-wrchs-correctness-1-lemma-9 (fs fs2)
(index-list
(find-n-free-blocks
(set-indices-in-alv
alv (cadr (assoc-equal (car hns) fs1))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text)))))
(value-list
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices
disk (cadr (assoc-equal (car hns) fs1)))
(cddr (assoc-equal (car hns) fs1)))
start text))))))))
(defthm
l4-wrchs-correctness-1-lemma-13
(implies
(and (bounded-nat-listp index-list (len v))
(no-duplicatesp index-list)
(block-listp value-list)
(equal (len index-list)
(len value-list)))
(equal (fetch-blocks-by-indices (set-indices v index-list value-list)
index-list)
value-list)))
(defthm
l4-wrchs-correctness-1-lemma-14
(implies (and (boolean-listp alv)
(integerp n)
(<= 0 n)
(<= n (len alv)))
(equal (count-free-blocks-alt (set-indices-in-alv alv nil nil)
n)
(count-free-blocks-alt alv n))))
(defthm
l4-wrchs-correctness-1-lemma-15
(implies (and (boolean-listp alv)
(nat-listp index-list)
(natp n)
(< n (len alv))
(not (equal n (car index-list))))
(iff (nth n
(set-indices-in-alv alv index-list nil))
(nth n
(set-indices-in-alv alv (cdr index-list)
nil))))
:hints (("goal" :cases ((member-equal n (cdr index-list))))))
(defthm
l4-wrchs-correctness-1-lemma-16
(implies
(and (consp index-list)
(boolean-listp alv)
(natp n)
(<= n (len alv))
(nat-listp index-list)
(indices-marked-p index-list alv)
(no-duplicatesp-equal index-list))
(equal
(count-free-blocks-alt (set-indices-in-alv alv index-list nil)
n)
(if (< (car index-list) n)
(+ 1
(count-free-blocks-alt (set-indices-in-alv alv (cdr index-list)
nil)
n))
(count-free-blocks-alt (set-indices-in-alv alv (cdr index-list)
nil)
n))))
:hints
(("goal" :induct (count-free-blocks-alt alv n))))
(defthm
l4-wrchs-correctness-1-lemma-17
(implies
(and (boolean-listp alv)
(natp n)
(<= n (len alv))
(nat-listp index-list)
(indices-marked-p index-list alv)
(no-duplicatesp-equal index-list))
(equal (count-free-blocks-alt (set-indices-in-alv alv index-list nil)
n)
(+ (count-free-blocks-alt alv n)
(count-before-n index-list n))))
:hints (("goal" :induct (count-before-n index-list n))))
(defthm
l4-wrchs-correctness-1-lemma-18
(implies (and (boolean-listp alv)
(indices-marked-p index-list alv)
(no-duplicatesp-equal index-list)
(bounded-nat-listp index-list (len alv)))
(equal (count-free-blocks (set-indices-in-alv alv index-list nil))
(+ (count-free-blocks alv)
(len index-list))))
:hints
(("goal"
:in-theory (disable count-free-blocks-alt-correctness-2
count-free-blocks
l4-wrchs-correctness-1-lemma-15
count-before-n-correctness-2)
:use ((:instance count-free-blocks-alt-correctness-2
(n (len alv)))
(:instance count-free-blocks-alt-correctness-2
(alv (set-indices-in-alv alv index-list nil))
(n (len (set-indices-in-alv alv index-list nil))))
(:instance l4-wrchs-correctness-1-lemma-15
(n (len alv)))
(:instance count-before-n-correctness-2
(l index-list)
(b (len alv)))))))
(defthm
l4-wrchs-correctness-1-lemma-19
(implies
(and (boolean-listp alv)
(stringp text)
(integerp start)
(<= 0 start)
(block-listp disk)
(<= (len (make-blocks (insert-text nil start text)))
(count-free-blocks alv))
(l3-regular-file-entry-p entry)
(indices-marked-p (car entry) alv)
(no-duplicatesp-equal (car entry)))
(equal
(len
(find-n-free-blocks
(set-indices-in-alv alv (car entry) nil)
(len
(make-blocks
(insert-text (unmake-blocks (fetch-blocks-by-indices disk (car entry))
(cdr entry))
start text)))))
(len
(make-blocks
(insert-text (unmake-blocks (fetch-blocks-by-indices disk (car entry))
(cdr entry))
start text)))))
:hints
(("goal"
:in-theory (e/d (len-of-insert-text)
(make-blocks-correctness-4))
:use
((:instance
make-blocks-correctness-4
(text1
(insert-text (unmake-blocks (fetch-blocks-by-indices disk (car entry))
(cdr entry))
start text))
(text2 (insert-text nil start text)))
(:instance
make-blocks-correctness-4
(text1
(insert-text (unmake-blocks (fetch-blocks-by-indices disk (car entry))
(cdr entry))
start text))
(text2 (unmake-blocks (fetch-blocks-by-indices disk (car entry))
(cdr entry))))))))
(defthm
l4-wrchs-correctness-1-lemma-20
(implies
(and (l3-fs-p fs)
(boolean-listp alv)
(no-duplicates-listp (l4-collect-all-index-lists fs))
(indices-marked-listp (l4-collect-all-index-lists fs)
alv)
(stringp text)
(integerp start)
(<= 0 start)
(block-listp disk)
(<= (len (make-blocks (insert-text nil start text)))
(count-free-blocks alv))
(l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(l3-regular-file-entry-p
(cons
(find-n-free-blocks
(set-indices-in-alv alv (cadr (assoc-equal name fs))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text))))
(len
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text)))))
:hints
(("goal"
:expand
(l3-regular-file-entry-p
(cons
(find-n-free-blocks
(set-indices-in-alv alv (cadr (assoc-equal name fs))
nil)
(len
(make-blocks
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text))))
(len
(insert-text
(unmake-blocks
(fetch-blocks-by-indices disk (cadr (assoc-equal name fs)))
(cddr (assoc-equal name fs)))
start text)))))))
;; This theorem shows the equivalence of the l4 and l2 versions of wrchs.
(defthm
l4-wrchs-correctness-1
(implies (and (l4-stricter-fs-p fs alv)
(stringp text)
(natp start)
(symbol-listp hns)
(block-listp disk)
(equal (len alv) (len disk))
(<= (len (make-blocks (insert-text nil start text)))
(count-free-blocks alv)))
(equal (l2-wrchs hns (l4-to-l2-fs fs disk)
start text)
(mv-let (new-fs new-disk new-alv)
(l4-wrchs hns fs disk alv start text)
(declare (ignore new-alv))
(l4-to-l2-fs new-fs new-disk)))))
(defthm l4-wrchs-returns-disk-lemma-1
(implies (and (equal (len index-list)
(len value-list))
(block-listp disk)
(block-listp value-list)
(bounded-nat-listp index-list (len disk)))
(block-listp (set-indices disk index-list value-list))))
(defthm
l4-wrchs-returns-disk-lemma-2
(implies
(and (not (l3-regular-file-entry-p (cdr (assoc-equal name fs))))
(bounded-nat-listp (l4-list-all-indices fs)
(len alv)))
(bounded-nat-listp (l4-list-all-indices (cdr (assoc-equal name fs)))
(len alv)))
:hints (("goal" :in-theory (enable l4-list-all-indices)
:induct (l4-list-all-indices fs))))
(defthm
l4-wrchs-returns-disk
(implies (and (l3-fs-p fs)
(boolean-listp alv)
(integerp start)
(<= 0 start)
(stringp text)
(block-listp disk)
(equal (len disk) (len alv))
(bounded-nat-listp (l4-list-all-indices fs)
(len disk)))
(block-listp (mv-nth 1
(l4-wrchs hns fs disk alv start text)))))
(defthm
l4-stat-after-write-lemma-1
(implies
(and (l4-stricter-fs-p fs alv)
(block-listp disk)
(symbol-listp hns1)
(symbol-listp hns2)
(natp start2)
(stringp text2)
(equal (len disk) (len alv))
(<= (len (make-blocks (insert-text nil start2 text2)))
(count-free-blocks alv)))
(mv-let (new-fs new-disk new-alv)
(l4-wrchs hns2 fs disk alv start2 text2)
(declare (ignore new-alv))
(equal (stringp (l4-stat hns1 new-fs new-disk))
(stringp (l4-stat hns1 fs disk)))))
:hints
(("goal" :in-theory (disable l2-read-after-write-2-lemma-4
l4-wrchs-correctness-1)
:use ((:instance l2-read-after-write-2-lemma-4
(fs (l4-to-l2-fs fs disk)))
(:instance l4-wrchs-correctness-1 (hns hns2)
(start start2)
(text text2))))))
(defthm
l4-stat-after-write
(implies
(and (l4-stricter-fs-p fs alv)
(stringp text2)
(symbol-listp hns1)
(symbol-listp hns2)
(natp start2)
(stringp (l4-stat hns1 fs disk))
(equal (len alv) (len disk))
(block-listp disk)
(<= (len (make-blocks (insert-text nil start2 text2)))
(count-free-blocks alv)))
(mv-let
(new-fs new-disk new-alv)
(l4-wrchs hns2 fs disk alv start2 text2)
(declare (ignore new-alv))
(equal (l4-stat hns1 new-fs new-disk)
(if (equal hns1 hns2)
(coerce (insert-text (coerce (l4-stat hns1 fs disk) 'list)
start2 text2)
'string)
(l4-stat hns1 fs disk)))))
:hints
(("goal"
:in-theory (disable l3-stat-correctness-1
l3-stat-correctness-2
l2-stat-after-write l4-wrchs-returns-fs
l4-wrchs-returns-disk
l4-stat-after-write-lemma-1
l4-wrchs-correctness-1)
:use ((:instance l3-stat-correctness-1 (hns hns1))
(:instance l3-stat-correctness-1 (hns hns1)
(fs (mv-nth 0
(l4-wrchs hns2 fs disk alv start2 text2)))
(disk (mv-nth 1
(l4-wrchs hns2 fs disk alv start2 text2))))
(:instance l3-stat-correctness-2 (hns hns1))
(:instance l3-stat-correctness-2 (hns hns1)
(fs (mv-nth 0
(l4-wrchs hns2 fs disk alv start2 text2)))
(disk (mv-nth 1
(l4-wrchs hns2 fs disk alv start2 text2))))
(:instance l2-stat-after-write
(fs (l3-to-l2-fs fs disk)))
(:instance l4-wrchs-returns-fs (hns hns2)
(start start2)
(text text2))
(:instance l4-wrchs-returns-disk (hns hns2)
(start start2)
(text text2))
l4-stat-after-write-lemma-1
(:instance l4-wrchs-correctness-1 (hns hns2)
(start start2)
(text text2))))))
(defthm
l4-read-after-write-1
(implies (and (l4-stricter-fs-p fs alv)
(stringp text)
(natp start)
(symbol-listp hns)
(block-listp disk)
(equal (len alv) (len disk))
(<= (len (make-blocks (insert-text nil start text)))
(count-free-blocks alv))
(equal n (length text))
(stringp (l4-stat hns fs disk)))
(mv-let (new-fs new-disk new-alv)
(l4-wrchs hns fs disk alv start text)
(declare (ignore new-alv))
(equal (l4-rdchs hns new-fs new-disk start n)
text))))
(defthm
l4-read-after-write-2
(implies (and (l4-stricter-fs-p fs alv)
(stringp text2)
(natp start2)
(symbol-listp hns1)
(symbol-listp hns2)
(not (equal hns1 hns2))
(block-listp disk)
(equal (len alv) (len disk))
(<= (len (make-blocks (insert-text nil start2 text2)))
(count-free-blocks alv)))
(mv-let (new-fs new-disk new-alv)
(l4-wrchs hns2 fs disk alv start2 text2)
(declare (ignore new-alv))
(equal (l4-rdchs hns1 new-fs new-disk start1 n1)
(l4-rdchs hns1 fs disk start1 n1))))
:hints (("goal" :in-theory (disable l4-stat-after-write-lemma-1
l4-stat-after-write)
:use (l4-stat-after-write-lemma-1 l4-stat-after-write))))
(defun l4-create (hns fs disk alv text)
(declare (xargs :guard (and (symbol-listp hns)
(l3-fs-p fs)
(stringp text)
(block-listp disk)
(boolean-listp alv)
(equal (len alv) (len disk)))))
(if (atom hns)
(mv fs disk alv) ;; error - showed up at fs with no name - so leave fs unchanged
(let ((sd (assoc (car hns) fs)))
(if (atom sd)
(if (atom (cdr hns))
(let* ((blocks (make-blocks (coerce text 'list)))
(indices (find-n-free-blocks alv (len blocks))))
(if (not (equal (len indices) (len blocks)))
;; we have an error because of insufficient disk space
;; - so we leave the fs unchanged
(mv sd disk alv)
(mv (cons (cons (car hns)
(cons indices
(length text)))
fs)
(set-indices disk indices blocks)
(set-indices-in-alv alv indices t))))
(mv-let (new-fs new-disk new-alv) (l4-create (cdr hns) nil disk alv text)
(mv (cons (cons (car hns) new-fs) fs) new-disk new-alv)))
(let ((contents (cdr sd)))
(if (l3-regular-file-entry-p contents)
(mv (cons (cons (car sd) contents) ;; file already exists, so leave fs unchanged
(remove1-assoc (car hns) fs))
disk
alv)
(mv-let (new-fs new-disk new-alv) (l4-create (cdr hns) contents disk alv text)
(mv (cons (cons (car sd)
new-fs)
(remove1-assoc (car hns) fs))
new-disk
new-alv)))
)))))
(defthm
l4-create-returns-fs
(implies (and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv)
(stringp text))
(l3-fs-p (mv-nth 0 (l4-create hns fs disk alv text))))
:hints
(("subgoal *1/3" :in-theory (enable l3-regular-file-entry-p))
("subgoal *1/2'4'" :in-theory (disable consp-assoc-equal)
:use (:instance consp-assoc-equal (name (car hns))
(l fs)))))
(defthm
l4-create-correctness-1-lemma-1
(implies (and (l3-fs-p fs1)
(l3-fs-p fs2)
(boolean-listp alv)
(indices-marked-listp (l4-collect-all-index-lists fs2)
alv)
(block-listp disk)
(equal (len alv) (len disk)))
(equal (l3-to-l2-fs fs2
(mv-nth 1 (l4-create hns fs1 disk alv text)))
(l3-to-l2-fs fs2 disk))))
;; This theorem shows the equivalence of the l4 and l2 versions of create.
(defthm
l4-create-correctness-1
(implies (and (l4-stricter-fs-p fs alv)
(stringp text)
(symbol-listp hns)
(block-listp disk)
(equal (len alv) (len disk))
(<= (len (make-blocks (coerce text 'list)))
(count-free-blocks alv)))
(equal (l2-create hns (l4-to-l2-fs fs disk)
text)
(mv-let (new-fs new-disk new-alv)
(l4-create hns fs disk alv text)
(declare (ignore new-alv))
(l4-to-l2-fs new-fs new-disk))))
:hints (("goal" :induct (l4-create hns fs disk alv text))
("subgoal *1/3"
:in-theory (enable l3-regular-file-entry-p))))
(defthm l4-create-returns-disk
(implies (and (boolean-listp alv)
(block-listp disk)
(equal (len disk) (len alv)))
(block-listp (mv-nth 1 (l4-create hns fs disk alv text)))))
(defthm
l4-read-after-create-1
(implies (and (l4-stricter-fs-p fs alv)
(stringp text)
(equal (len alv) (len disk))
(<= (len (make-blocks (coerce text 'list)))
(count-free-blocks alv))
(equal n (length text))
(not (l4-stat hns fs disk)))
(mv-let (new-fs new-disk new-alv)
(l4-create hns fs disk alv text)
(declare (ignore new-alv))
(implies (stringp (l4-stat hns new-fs new-disk))
(equal (l4-rdchs hns new-fs new-disk 0 n)
text))))
:hints
(("goal" :in-theory (disable l4-rdchs-correctness-1
l2-read-after-create-1
l4-create-correctness-1)
:use ((:instance l4-rdchs-correctness-1
(fs (mv-nth 0 (l4-create hns fs disk alv text)))
(disk (mv-nth 1 (l4-create hns fs disk alv text)))
(start 0)
(n (length text)))
(:instance l2-read-after-create-1 (n (length text))
(fs (l4-to-l2-fs fs disk)))
l4-create-correctness-1))))
(defthm
l4-read-after-create-2
(implies (and (l4-stricter-fs-p fs alv)
(stringp text2)
(symbol-listp hns1)
(symbol-listp hns2)
(natp start1)
(natp n1)
(not (l4-stat hns2 fs disk))
(stringp (l4-stat hns1 fs disk))
(block-listp disk)
(equal (len alv) (len disk))
(<= (len (make-blocks (coerce text2 'list)))
(count-free-blocks alv)))
(mv-let (new-fs new-disk new-alv)
(l4-create hns2 fs disk alv text2)
(declare (ignore new-alv))
(implies (stringp (l4-stat hns2 new-fs new-disk))
(equal (l4-rdchs hns1 new-fs new-disk start1 n1)
(l4-rdchs hns1 fs disk start1 n1)))))
:hints
(("goal"
:in-theory (disable (:rewrite l2-read-after-create-2)
(:rewrite l3-to-l2-fs-correctness-1)
(:rewrite l3-stat-correctness-2)
(:rewrite l4-create-returns-fs)
(:rewrite l3-stat-correctness-1)
(:rewrite l4-create-correctness-1)
(:rewrite l3-rdchs-correctness-1))
:use ((:instance l2-read-after-create-2
(fs (l3-to-l2-fs fs disk)))
l3-to-l2-fs-correctness-1
(:instance l3-stat-correctness-2 (hns hns2))
(:instance l3-stat-correctness-1 (hns hns1))
(:instance l3-stat-correctness-1 (hns hns2)
(fs (mv-nth 0 (l4-create hns2 fs disk alv text2)))
(disk (mv-nth 1 (l4-create hns2 fs disk alv text2))))
(:instance l4-create-returns-fs (hns hns2)
(text text2))
(:instance l3-stat-correctness-1 (hns hns2)
(fs (mv-nth 0 (l4-create hns2 fs disk alv text2)))
(disk (mv-nth 1 (l4-create hns2 fs disk alv text2))))
(:instance l4-create-correctness-1 (hns hns2)
(text text2))
(:instance l3-rdchs-correctness-1 (hns hns1)
(start start1)
(n n1))
(:instance l3-rdchs-correctness-1 (hns hns1)
(start start1)
(n n1)
(fs (mv-nth 0 (l4-create hns2 fs disk alv text2)))
(disk (mv-nth 1
(l4-create hns2 fs disk alv text2))))))))
; This function deletes a file or directory given its path.
(defun
l4-unlink (hns fs alv)
(declare (xargs :guard (and (symbol-listp hns)
(l3-fs-p fs)
(boolean-listp alv))))
(if
(atom hns)
(mv fs alv) ;;error case, basically
(if
(atom (cdr hns))
(mv
(remove1-assoc (car hns) fs)
(if
(and (consp (assoc (car hns) fs))
(l3-regular-file-entry-p (cdr (assoc (car hns) fs))))
(set-indices-in-alv alv (car (cdr (assoc (car hns) fs)))
nil)
alv))
(if
(atom fs)
(mv nil alv)
(let
((sd (assoc (car hns) fs)))
(if
(atom sd)
(mv fs alv)
(let ((contents (cdr sd)))
(if (l3-regular-file-entry-p contents)
(mv fs alv) ;; we still have names but we're at a regular file - error
(mv-let (new-fs new-alv)
(l4-unlink (cdr hns) contents alv)
(mv (cons (cons (car sd) new-fs)
(remove1-assoc (car hns) fs))
new-alv))))))))))
(defthm l4-unlink-returns-fs
(implies (and (symbol-listp hns) (l3-fs-p fs))
(l3-fs-p (mv-nth 0 (l4-unlink hns fs alv)))))
;; This theorem shows the equivalence of the l4 and l2 versions of unlink.
(defthm l4-unlink-correctness-1
(implies (and (l4-stricter-fs-p fs alv)
(symbol-listp hns)
(block-listp disk))
(equal (l2-unlink hns (l4-to-l2-fs fs disk))
(mv-let (new-fs new-alv)
(l4-unlink hns fs alv)
(declare (ignore new-alv))
(l4-to-l2-fs new-fs disk)))))
|