Examples: Calculator protocol
Overview
Example appsDecision tables
Rule 30 cellStrike dieWise deferralCurrent supportHeader workPlant attunementCapability routePublish gateProposal admissionCompression admissionQuorum commitAddress admissionDataflow policyDraft admissionCoded matmul admissionUTQC row honestyCalculator protocolRequantization clampJCS NFC admissionTwo-seed barDocs sync// example · Decision tables
Calculator protocol
Sort a Calculator request by the kind of answer it gets. A bad, unknown or too-large request never gets a number back.
Inspired by UOR-Foundation/calculator-example (live). The reference PrismPM product: a checked signed 64-bit calculator built into a Pages application and A/B service releases.
Pattern: Decision table, OMG DMN 1.5, hit policy FIRST. To write one of your own, follow How to build a decision table app.
The data in this figure
| Step | What happens |
|---|---|
| 1. Request | version, operation, right, range |
| 2. 4 rules | the first that matches wins |
| 3. Answer | ok, overflow, division-by-zero, unsupported-version, unknown-operation |
| 4. Proved | 4 theorems, 44 tests |
- Fingerprint
99611d14491a9b4721580d28ab0cfef79b63876e97c156725227d230eb70acc7- Acceptance vectors
- 44
- Claims
- 7
Verified by prismpm verify in the pinned SDK when this site was built.
The prompt
This is the whole input. Raw JSON · Open it in the builder · Download the app (.zip)
The prompt 358 lines
{
"schema": "prism/prompt/1",
"pattern": "decisionTable",
"goal": "Sort a Calculator request by the kind of answer it gets. A bad, unknown or too-large request never gets a number back.",
"repository": "UOR-Foundation/calculator-example",
"app": {
"name": "calculator-protocol",
"title": "Calculator protocol",
"purpose": "Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers.",
"fields": [
{
"name": "version",
"kind": "number",
"min": 0,
"max": 9,
"means": "the protocol version the request names; the product speaks version 1"
},
{
"name": "operation",
"kind": "choice",
"values": [
"add",
"subtract",
"multiply",
"divide",
"other"
],
"means": "the operation name; other is any name the protocol does not define, such as mod"
},
{
"name": "right",
"kind": "choice",
"values": [
"zero",
"nonzero"
],
"means": "whether the right operand is 0"
},
{
"name": "range",
"kind": "choice",
"values": [
"within",
"beyond"
],
"means": "whether the exact mathematical result lies within the signed 64-bit range"
}
],
"outcomes": [
"ok",
"overflow",
"division-by-zero",
"unsupported-version",
"unknown-operation"
],
"meanings": {
"ok": "1 ok and the exact result",
"overflow": "1 error overflow: the CalculatorError Overflow",
"division-by-zero": "1 error division-by-zero: the CalculatorError DivisionByZero",
"unsupported-version": "1 error unsupported-version: the ProtocolError UnsupportedVersion",
"unknown-operation": "1 error unknown-operation: the ProtocolError UnknownOperation"
},
"rules": [
{
"when": [
{
"field": "version",
"op": "!=",
"value": 1
}
],
"then": "unsupported-version",
"why": "src/Calculator.lex.tex: decodeRequest refuses any version but 1 with ProtocolError UnsupportedVersion (vector 2 add 1 2)"
},
{
"when": [
{
"field": "operation",
"op": "is",
"value": "other"
}
],
"then": "unknown-operation",
"why": "src/Calculator.lex.tex: parseOperation knows only Add, Subtract, Multiply and Divide; anything else is ProtocolError UnknownOperation (vector 1 mod 1 2)"
},
{
"when": [
{
"field": "operation",
"op": "is",
"value": "divide"
},
{
"field": "right",
"op": "is",
"value": "zero"
}
],
"then": "division-by-zero",
"why": "src/Calculator.lex.tex: calculate answers CalculatorError DivisionByZero for a zero divisor (vector 1 divide 1 0)"
},
{
"when": [
{
"field": "range",
"op": "is",
"value": "beyond"
}
],
"then": "overflow",
"why": "src/Calculator.lex.tex: checkedResult answers CalculatorError Overflow outside the i64 range (vectors at 9223372036854775807 and -9223372036854775808)"
}
],
"otherwise": "ok",
"otherwiseWhy": "src/Calculator.lex.tex: calculate_correct proves the exact result is returned when it is in range",
"properties": [
{
"kind": "never",
"when": [
{
"field": "operation",
"op": "is",
"value": "divide"
},
{
"field": "right",
"op": "is",
"value": "zero"
}
],
"then": "ok",
"why": "a division by zero has no result"
},
{
"kind": "never",
"when": [
{
"field": "range",
"op": "is",
"value": "beyond"
}
],
"then": "ok",
"why": "a result outside i64 is never wrapped or truncated"
},
{
"kind": "never",
"when": [
{
"field": "version",
"op": "!=",
"value": 1
}
],
"then": "ok",
"why": "an unsupported version is never interpreted as version 1"
},
{
"kind": "always",
"when": [
{
"field": "version",
"op": "=",
"value": 1
},
{
"field": "operation",
"op": "is",
"value": "other"
}
],
"then": "unknown-operation",
"why": "an undefined operation is a typed protocol error"
}
],
"examples": [
{
"request": "1 add nonzero within",
"response": "ok"
},
{
"request": "1 add nonzero beyond",
"response": "overflow"
},
{
"request": "1 divide zero within",
"response": "division-by-zero"
},
{
"request": "1 divide nonzero beyond",
"response": "overflow"
},
{
"request": "2 add nonzero within",
"response": "unsupported-version"
},
{
"request": "1 other nonzero within",
"response": "unknown-operation"
},
{
"request": "1 multiply zero within",
"response": "ok"
}
]
},
"stakeholders": [
{
"name": "Calculator user",
"text": "Enters two operands and an operation in the Pages view and needs an exact result or a typed error, never a wrapped number.",
"concerns": [
"Correct answers",
"Proved guarantees"
]
},
{
"name": "Service operator",
"text": "Runs the A/B service releases and needs every protocol error typed and covered by a negative vector.",
"concerns": [
"Refused malformed requests",
"Proved guarantees"
]
}
],
"components": [
{
"name": "Calculator Pages view",
"text": "The portable Pages application at https://uor-foundation.github.io/calculator-example/.",
"kind": "staticSite"
},
{
"name": "Calculator service release",
"text": "The A and B service releases prismpm pushes, deploys and rolls back.",
"kind": "service"
}
],
"threats": [
{
"name": "Silent overflow",
"text": "An out-of-range sum or product is wrapped and answered as ok.",
"stride": "tampering",
"asset": "answer",
"likelihood": "medium",
"impact": "critical",
"control": {
"name": "Checked result",
"text": "A result beyond i64 is answered overflow.",
"evidence": [
{
"kind": "proof",
"reference": "CalculatorProtocolProofs::inv002Holds"
},
{
"kind": "gate",
"reference": "UOR-Foundation/calculator-example src/Calculator.lex.tex acceptance vectors at the i64 bounds"
}
]
}
},
{
"name": "Division by zero answered",
"text": "A zero divisor yields a number or a trap instead of a typed error.",
"stride": "denialOfService",
"asset": "answer",
"likelihood": "medium",
"impact": "major",
"control": {
"name": "Typed division error",
"text": "A zero divisor is answered division-by-zero.",
"evidence": [
{
"kind": "proof",
"reference": "CalculatorProtocolProofs::inv001Holds"
}
]
}
},
{
"name": "Version downgrade",
"text": "A client sends another protocol version hoping it is read as version 1.",
"stride": "spoofing",
"asset": "request",
"likelihood": "low",
"impact": "major",
"control": {
"name": "Only version 1",
"text": "Any version but 1 is unsupported-version.",
"evidence": [
{
"kind": "proof",
"reference": "CalculatorProtocolProofs::inv003Holds"
}
]
}
}
],
"quality": [
{
"characteristic": "Functional suitability",
"subcharacteristic": "Functional completeness",
"requirement": "Every operation modeled",
"text": "Each of the four Operation constructors is a value of the operation field.",
"measure": "Operations modeled",
"measureText": "Operation constructors of src/Calculator.lex.tex the app distinguishes.",
"threshold": 4
},
{
"characteristic": "Reliability",
"subcharacteristic": "Fault tolerance",
"requirement": "Every error typed",
"text": "Every CalculatorError and every ProtocolError but MalformedRequest, which the decoder answers invalid, is an answer.",
"measure": "Untyped errors",
"measureText": "Error constructors with no answer and no invalid refusal.",
"threshold": 0
}
],
"journeys": [
{
"stakeholder": "Calculator user",
"steps": [
"otherwise",
"REQ-003",
"REQ-004",
"INV-001",
"INV-002"
]
},
{
"stakeholder": "Service operator",
"steps": [
"REQ-001",
"REQ-002",
"INV-003",
"INV-004",
"refuse"
]
}
],
"axioms": {
"inv001Holds": [
"Classical.choice",
"Quot.sound",
"propext"
],
"inv003Holds": [
"Classical.choice",
"Quot.sound",
"propext"
],
"inv004Holds": [
"Classical.choice",
"Quot.sound",
"propext"
]
},
"concerns": [],
"license": "MIT OR Apache-2.0"
}What the app claims
Each claim is a row in model/ids.toml, a scenario and a test, and a theorem the Lean kernel checks. The claims are quoted as the model states them.
CP-01The app never answers ok when operation is divide and right is zeroCP-02The app never answers ok when range is beyondCP-03The app never answers ok when version differs from 1CP-04The app always answers unknown-operation when version equals 1 and operation is otherCP-05The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it referencesCP-06The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declaredCP-07Every compliance obligation is numbered in order and names its evidence
Pattern
Decision table: OMG DMN 1.5, hit policy FIRST. The rules are tried in order, and the first one that matches gives the answer. If none matches, the default answer applies. This is a DMN decision table with the FIRST hit policy.
| Pattern | Standard | Answers |
|---|---|---|
| Decision table | OMG DMN 1.5, hit policy FIRST | ok, overflow, division-by-zero, unsupported-version, unknown-operation |
Behavior
A request is version, operation, right, range, separated by spaces. The first rule that matches decides. If none matches, the answer is ok. A request over 112 bytes, or in any other form, is answered invalid.
| Rule | When | Answer | Why |
|---|---|---|---|
| REQ-001 | version differs from 1 | unsupported-version | src/Calculator.lex.tex: decodeRequest refuses any version but 1 with ProtocolError UnsupportedVersion (vector 2 add 1 2) |
| REQ-002 | operation is other | unknown-operation | src/Calculator.lex.tex: parseOperation knows only Add, Subtract, Multiply and Divide; anything else is ProtocolError UnknownOperation (vector 1 mod 1 2) |
| REQ-003 | operation is divide and right is zero | division-by-zero | src/Calculator.lex.tex: calculate answers CalculatorError DivisionByZero for a zero divisor (vector 1 divide 1 0) |
| REQ-004 | range is beyond | overflow | src/Calculator.lex.tex: checkedResult answers CalculatorError Overflow outside the i64 range (vectors at 9223372036854775807 and -9223372036854775808) |
| otherwise | no rule matches | ok | src/Calculator.lex.tex: calculate_correct proves the exact result is returned when it is in range |
Properties Lean proves
Each property is a theorem about the same definitions the app is built from. It is proved for every request, not only the tested ones.
| Property | Statement | Theorem | Why |
|---|---|---|---|
| INV-001 | It never answers ok when operation is divide and right is zero. | CalculatorProtocolProofs::inv001Holds | a division by zero has no result |
| INV-002 | It never answers ok when range is beyond. | CalculatorProtocolProofs::inv002Holds | a result outside i64 is never wrapped or truncated |
| INV-003 | It never answers ok when version differs from 1. | CalculatorProtocolProofs::inv003Holds | an unsupported version is never interpreted as version 1 |
| INV-004 | It always answers unknown-operation when version equals 1 and operation is other. | CalculatorProtocolProofs::inv004Holds | an undefined operation is a typed protocol error |
Architecture
Stakeholders and the concerns each one views the app through (ISO/IEC/IEEE 42010).
| Stakeholder | Who they are | Concerns |
|---|---|---|
| Calculator user | Enters two operands and an operation in the Pages view and needs an exact result or a typed error, never a wrapped number. | Correct answers, Proved guarantees |
| Service operator | Runs the A/B service releases and needs every protocol error typed and covered by a negative vector. | Refused malformed requests, Proved guarantees |
| Verifier | Anyone who loads the holo, checks its fingerprint and replays its acceptance vectors before trusting an answer. | Integrity of the published app, Refused malformed requests, Proved guarantees |
Concerns
What the stakeholders care about, and the model each is viewed in.
| Concern | What it means | Model |
|---|---|---|
| Correct answers | Every well-formed request is answered by the first rule that matches it, or ok when none does, as the spec states. | quality |
| Integrity of the published app | What a visitor runs is the holo the build verified, with its fingerprint and signed provenance beside it. | security |
| Proved guarantees | Each of the 4 properties of the spec holds for every request, proved by the Lean kernel. | quality |
| Refused malformed requests | A request that is not the 4 fields in order, or is longer than 112 bytes, is answered invalid and never guessed. | security |
Components
8 components and 11 edges between them.
| Component | Kind | What it is |
|---|---|---|
| Browser | externalSystem | The visitor's web browser, which loads the page and runs the Calculator protocol guest. |
| Calculator Pages view | staticSite | The portable Pages application at https://uor-foundation.github.io/calculator-example/. |
| Calculator protocol guest | service | The Core-Wasm guest built from the model: it answers one request of at most 112 bytes with one answer of at most 64. |
| Calculator protocol page | staticSite | The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors. |
| Calculator service release | service | The A and B service releases prismpm pushes, deploys and rolls back. |
| GitHub Pages | externalSystem | Serves the page and the holo from the repository Pages workflow. |
| Prism build | cliAdapter | prismpm verify in the SDK image prismpm.lock pins: it checks every theorem, builds the guest and replays every vector. |
| Source repository | externalSystem | The repository that holds the prompt, the model and its gate. |
Design views
The SDK checks each view against the system model and draws it as OPL and PlantUML.
| View | Diagram | Viewpoint |
|---|---|---|
| Deciding a Calculator protocol request | opmObjectProcess | Calculator user: Correct answers |
| Components of Calculator protocol | umlComponent | Verifier: Integrity of the published app |
| Answering a Calculator protocol request | umlSequence | Calculator user: Correct answers |
| States of the Calculator protocol guest | umlStateMachine | Service operator: Refused malformed requests |
Features and journeys
10 features. Each names the definitions that do the work and the tests that accept it. Each stakeholder has one journey.
Features and journeys 10 rows
| Feature | Calls | Accepted by |
|---|---|---|
| When version differs from 1, the answer is unsupported-version. | CalculatorProtocol::rule1, CalculatorProtocol::judge | CalculatorProtocol::application |
| When operation is other, the answer is unknown-operation. | CalculatorProtocol::rule2, CalculatorProtocol::judge | CalculatorProtocol::application |
| When operation is divide and right is zero, the answer is division-by-zero. | CalculatorProtocol::rule3, CalculatorProtocol::judge | CalculatorProtocol::application |
| When range is beyond, the answer is overflow. | CalculatorProtocol::rule4, CalculatorProtocol::judge | CalculatorProtocol::application |
| When no rule matches, the answer is ok. | CalculatorProtocol::judge | CalculatorProtocol::application |
| A request that is not version, operation, right, range in order, separated by single spaces, or is over 112 bytes, is answered invalid. | CalculatorProtocol::dispatch, CalculatorProtocol::decodeField1 | CalculatorProtocol::application |
| It never answers ok when operation is divide and right is zero. | CalculatorProtocol::judge | CalculatorProtocolProofs::inv001Holds |
| It never answers ok when range is beyond. | CalculatorProtocol::judge | CalculatorProtocolProofs::inv002Holds |
| It never answers ok when version differs from 1. | CalculatorProtocol::judge | CalculatorProtocolProofs::inv003Holds |
| It always answers unknown-operation when version equals 1 and operation is other. | CalculatorProtocol::judge | CalculatorProtocolProofs::inv004Holds |
Journeys
The ordered features each stakeholder takes.
| Stakeholder | Steps |
|---|---|
| Calculator user | otherwise → REQ-003 → REQ-004 → INV-001 → INV-002 |
| Service operator | REQ-001 → REQ-002 → INV-003 → INV-004 → refuse |
| Verifier | refuse → INV-001 → INV-002 → INV-003 → INV-004 |
Security and threat model
13 threats against 4 assets. Each has a STRIDE category, and either a control with evidence or a risk that is accepted on purpose.
Security and threat model 13 rows
| Threat | STRIDE | Asset | Risk | Answered by |
|---|---|---|---|---|
| Answer that breaks INV-001 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-001: proof CalculatorProtocolProofs::inv001Holds |
| Answer that breaks INV-002 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-002: proof CalculatorProtocolProofs::inv002Holds |
| Answer that breaks INV-003 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-003: proof CalculatorProtocolProofs::inv003Holds |
| Answer that breaks INV-004 | repudiation | Answer | medium likelihood, critical impact | Proof of INV-004: proof CalculatorProtocolProofs::inv004Holds |
| Division by zero answered | denialOfService | Answer | medium likelihood, major impact | Typed division error: proof CalculatorProtocolProofs::inv001Holds |
| Granted capability | informationDisclosure | Answer | low likelihood, major impact | No capability granted: gate prism-code check refuses an ungranted guest import |
| Malformed request | tampering | Request bytes | high likelihood, major impact | Strict decoder: gate malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify |
| Oversized request | denialOfService | Request bytes | medium likelihood, minor impact | Bounded request: gate acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify |
| Silent overflow | tampering | Answer | medium likelihood, critical impact | Checked result: proof CalculatorProtocolProofs::inv002Holds; gate UOR-Foundation/calculator-example src/Calculator.lex.tex acceptance vectors at the i64 bounds |
| Substituted holo | spoofing | Published holo | low likelihood, critical impact | Fingerprint and provenance: gate actions/attest-build-provenance in the pages workflow; gate prism-code check of the holo identities in the page |
| Substituted host | spoofing | Published holo | low likelihood, critical impact | accepted: A page cannot defend against its own host. The holo carries signed build provenance a visitor can check, and the app can be rebuilt from its prompt. |
| Tampered model | tampering | Model source | low likelihood, major impact | Regenerated from the prompt: gate prismpm verify in the SDK image prismpm.lock pins; review app/prompt.json |
| Version downgrade | spoofing | Request bytes | low likelihood, major impact | Only version 1: proof CalculatorProtocolProofs::inv003Holds |
Quality
ISO/IEC 25010:2023 requirements. Each has a measure and a threshold that a theorem pins.
Quality 8 rows
| Requirement | Characteristic | Measure | Threshold |
|---|---|---|---|
| Bounded allocation: The guest allocates at most 224 bytes for one request. | Performance efficiency: Resource utilization | Guest allocation bytes | 224 |
| Bounded request: A request over 112 bytes is refused before any field is read. | Performance efficiency: Time behaviour | Request bytes read | 112 |
| Every error typed: Every CalculatorError and every ProtocolError but MalformedRequest, which the decoder answers invalid, is an answer. | Reliability: Fault tolerance | Untyped errors | 0 |
| Every operation modeled: Each of the four Operation constructors is a value of the operation field. | Functional suitability: Functional completeness | Operations modeled | 4 |
| Every property proved: All 4 properties are theorems the Lean kernel checks. | Security: Integrity | Unproved properties | 0 |
| Every request answered: Every request gets an answer: a rule, ok otherwise, or invalid. | Functional suitability: Functional completeness | Unanswered requests | 0 |
| Every vector replays: All 44 acceptance vectors replay in the compiled guest, the shortest 0 bytes long. | Reliability: Faultlessness | Failed vectors | 0 |
| Examples answered as stated: Every one of the 7 examples of the spec is answered as it states. | Functional suitability: Functional correctness | Example mismatches | 0 |
Compliance
One obligation per standard, each naming its evidence.
| Standard | Subject | Evidence |
|---|---|---|
| ISO/IEC/IEEE 42010:2022 | Architecture description | Architecture::architectureDescriptionHolds |
| ISO/PAS 19450:2015 and OMG UML 2.5.1 | Design views | Design::viewOpmDecide, Design::viewUmlComponents, Design::viewUmlRequest, Design::viewUmlStates |
| ISO/IEC 25010:2023 | Product quality | Quality::qualityModelHolds |
| ISO/IEC 27034-1:2011 and ISO/IEC 27005:2022 | Application security and risk | Security::controlSet |
| OMG DMN 1.5, hit policy FIRST | Decision table | CalculatorProtocol::judge |
| OpenSpec | Requirements | CalculatorProtocol::application |
| SPDX MIT OR Apache-2.0 | Licensing | CalculatorProtocol::application |
Rendered design views
Written by the SDK from the design records when it verified the app.
design/Design.viewOpmDecide.opl
View: Design::viewOpmDecide
Title: Deciding a Calculator protocol request
Viewpoint: Architecture::viewpointCalculatorUserCorrectAnswers
Notation: ISO/PAS 19450:2015 OPM, Prism OPL profile
componentBrowser is an object.
componentCalculatorProtocolGuest is an object.
componentCalculatorProtocolGuest can be stateDeciding or stateIdle.
processDecide is a process.
processEncodeAnswer is a process.
processJudge is a process.
processParseRequest is a process.
componentCalculatorProtocolGuest handles processDecide.
processParseRequest requires componentBrowser.
processEncodeAnswer affects componentBrowser.
processJudge invokes processEncodeAnswer.
processParseRequest invokes processJudge.
processDecide zooms into processParseRequest, processJudge, and processEncodeAnswer, in that sequence.
design/Design.viewUmlComponents.puml
@startuml
' UML 2.5.1 component diagram
' view: Design::viewUmlComponents
' viewpoint: Architecture::viewpointVerifierIntegrityOfThePublishedApp
title Components of Calculator protocol
component "componentBrowser" as c0
component "componentCalculatorPagesView" as c1
component "componentCalculatorProtocolGuest" as c2
component "componentCalculatorProtocolPage" as c3
component "componentCalculatorServiceRelease" as c4
component "componentGitHubPages" as c5
component "componentPrismBuild" as c6
component "componentSourceRepository" as c7
c0 --> c2 : edgeBrowserToCalculatorProtocolGuest
c1 --> c2 : edgeCalculatorPagesViewToCalculatorProtocolGuest
c2 --> c0 : edgeCalculatorProtocolGuestToBrowser
c2 --> c1 : edgeCalculatorProtocolGuestToCalculatorPagesView
c2 --> c4 : edgeCalculatorProtocolGuestToCalculatorServiceRelease
c3 --> c5 : edgeCalculatorProtocolPageToGitHubPages
c4 --> c2 : edgeCalculatorServiceReleaseToCalculatorProtocolGuest
c5 --> c0 : edgeGitHubPagesToBrowser
c6 --> c2 : edgePrismBuildToCalculatorProtocolGuest
c6 --> c3 : edgePrismBuildToCalculatorProtocolPage
c7 --> c6 : edgeSourceRepositoryToPrismBuild
@enduml
design/Design.viewUmlRequest.puml
@startuml
' UML 2.5.1 sequence diagram
' view: Design::viewUmlRequest
' viewpoint: Architecture::viewpointCalculatorUserCorrectAnswers
title Answering a Calculator protocol request
participant "componentBrowser" as p0
participant "componentCalculatorProtocolGuest" as p1
p0 -> p1 : processDecide
p1 --> p0 : processDecide
@enduml
design/Design.viewUmlStates.puml
@startuml
' UML 2.5.1 state machine diagram
' view: Design::viewUmlStates
' viewpoint: Architecture::viewpointServiceOperatorRefusedMalformedRequests
title States of the Calculator protocol guest
state "stateAnsweredDivisionByZero" as s0
state "stateAnsweredOk" as s1
state "stateAnsweredOverflow" as s2
state "stateAnsweredUnknownOperation" as s3
state "stateAnsweredUnsupportedVersion" as s4
state "stateDeciding" as s5
state "stateIdle" as s6
state "stateRefused" as s7
[*] --> s6
s6 --> s5 : processParseRequest
s6 --> s7 : processParseRequest
s5 --> s4 : processRule1
s5 --> s3 : processRule2
s5 --> s0 : processRule3
s5 --> s2 : processRule4
s5 --> s1 : processOtherwise
s1 --> s6 : processEncodeAnswer
s2 --> s6 : processEncodeAnswer
s0 --> s6 : processEncodeAnswer
s4 --> s6 : processEncodeAnswer
s3 --> s6 : processEncodeAnswer
s7 --> s6 : processEncodeAnswer
@enduml
Prism source
Every file the builder wrote, laid out as a repository created from UOR-Foundation/template. The language packages and Foundation modules every app shares are in the download.
app/src/Architecture.lex.tex 406 lines
\begin{lexlean}{Architecture}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Foundation.Arch}
\title{architectural component}
\begin{semanticmodule}
definition{
name: standardIso25010,
parameters: [],
result: Foundation.Arch::StandardReference,
body: (record Foundation.Arch::StandardReference {standardIndex := 0, editionIndex := 0, standardId := "ISO-25010-2023", edition := "2023"})
}
definition{
name: standardIso27005,
parameters: [],
result: Foundation.Arch::StandardReference,
body: (record Foundation.Arch::StandardReference {standardIndex := 1, editionIndex := 0, standardId := "ISO-27005-2022", edition := "2022"})
}
definition{
name: standardIso27034,
parameters: [],
result: Foundation.Arch::StandardReference,
body: (record Foundation.Arch::StandardReference {standardIndex := 2, editionIndex := 0, standardId := "ISO-27034-1-2011", edition := "2011"})
}
definition{
name: standardIso42010,
parameters: [],
result: Foundation.Arch::StandardReference,
body: (record Foundation.Arch::StandardReference {standardIndex := 4, editionIndex := 0, standardId := "ISO-42010-2022", edition := "2022"})
}
definition{
name: stakeholderCalculatorUser,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 0, name := "Calculator user", text := "Enters two operands and an operation in the Pages view and needs an exact result or a typed error, never a wrapped number."})
}
definition{
name: stakeholderServiceOperator,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 1, name := "Service operator", text := "Runs the A/B service releases and needs every protocol error typed and covered by a negative vector."})
}
definition{
name: stakeholderVerifier,
parameters: [],
result: Foundation.Arch::Stakeholder,
body: (record Foundation.Arch::Stakeholder {index := 2, name := "Verifier", text := "Anyone who loads the holo, checks its fingerprint and replays its acceptance vectors before trusting an answer."})
}
definition{
name: concernCorrectAnswers,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 0, name := "Correct answers", text := "Every well-formed request is answered by the first rule that matches it, or ok when none does, as the spec states."})
}
definition{
name: concernIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 1, name := "Integrity of the published app", text := "What a visitor runs is the holo the build verified, with its fingerprint and signed provenance beside it."})
}
definition{
name: concernProvedGuarantees,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 2, name := "Proved guarantees", text := "Each of the 4 properties of the spec holds for every request, proved by the Lean kernel."})
}
definition{
name: concernRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Concern,
body: (record Foundation.Arch::Concern {index := 3, name := "Refused malformed requests", text := "A request that is not the 4 fields in order, or is longer than 112 bytes, is answered invalid and never guessed."})
}
definition{
name: componentBrowser,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 0, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Browser", text := "The visitor's web browser, which loads the page and runs the Calculator protocol guest."})
}
definition{
name: componentCalculatorPagesView,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 1, kind := (ctor Foundation.Arch::ComponentKind.staticSite), name := "Calculator Pages view", text := "The portable Pages application at https://uor-foundation.github.io/calculator-example/."})
}
definition{
name: componentCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 2, kind := (ctor Foundation.Arch::ComponentKind.service), name := "Calculator protocol guest", text := "The Core-Wasm guest built from the model: it answers one request of at most 112 bytes with one answer of at most 64."})
}
definition{
name: componentCalculatorProtocolPage,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 3, kind := (ctor Foundation.Arch::ComponentKind.staticSite), name := "Calculator protocol page", text := "The page the template publishes: the holo, its fingerprint, its provenance and its acceptance vectors."})
}
definition{
name: componentCalculatorServiceRelease,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 4, kind := (ctor Foundation.Arch::ComponentKind.service), name := "Calculator service release", text := "The A and B service releases prismpm pushes, deploys and rolls back."})
}
definition{
name: componentGitHubPages,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 5, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "GitHub Pages", text := "Serves the page and the holo from the repository Pages workflow."})
}
definition{
name: componentPrismBuild,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 6, kind := (ctor Foundation.Arch::ComponentKind.cliAdapter), name := "Prism build", text := "prismpm verify in the SDK image prismpm.lock pins: it checks every theorem, builds the guest and replays every vector."})
}
definition{
name: componentSourceRepository,
parameters: [],
result: Foundation.Arch::Component,
body: (record Foundation.Arch::Component {index := 7, kind := (ctor Foundation.Arch::ComponentKind.externalSystem), name := "Source repository", text := "The repository that holds the prompt, the model and its gate."})
}
definition{
name: edgeBrowserToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 0, fromIndex := 0, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeCalculatorPagesViewToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 1, fromIndex := 1, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeCalculatorProtocolGuestToBrowser,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 2, fromIndex := 2, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeCalculatorProtocolGuestToCalculatorPagesView,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 3, fromIndex := 2, toIndex := 1, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeCalculatorProtocolGuestToCalculatorServiceRelease,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 4, fromIndex := 2, toIndex := 4, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeCalculatorProtocolPageToGitHubPages,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 5, fromIndex := 3, toIndex := 5, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeCalculatorServiceReleaseToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 6, fromIndex := 4, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeGitHubPagesToBrowser,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 7, fromIndex := 5, toIndex := 0, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgePrismBuildToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 8, fromIndex := 6, toIndex := 2, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgePrismBuildToCalculatorProtocolPage,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 9, fromIndex := 6, toIndex := 3, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: edgeSourceRepositoryToPrismBuild,
parameters: [],
result: Foundation.Arch::Edge,
body: (record Foundation.Arch::Edge {index := 10, fromIndex := 7, toIndex := 6, kind := (ctor Foundation.Arch::EdgeKind.dataFlow)})
}
definition{
name: viewpointCalculatorUserCorrectAnswers,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 0, stakeholderIndex := 0, concernIndex := 0, modelKindIndex := 1})
}
definition{
name: viewpointCalculatorUserProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 1, stakeholderIndex := 0, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointServiceOperatorProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 2, stakeholderIndex := 1, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointServiceOperatorRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 3, stakeholderIndex := 1, concernIndex := 3, modelKindIndex := 2})
}
definition{
name: viewpointVerifierIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 4, stakeholderIndex := 2, concernIndex := 1, modelKindIndex := 2})
}
definition{
name: viewpointVerifierProvedGuarantees,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 5, stakeholderIndex := 2, concernIndex := 2, modelKindIndex := 1})
}
definition{
name: viewpointVerifierRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::Viewpoint,
body: (record Foundation.Arch::Viewpoint {index := 6, stakeholderIndex := 2, concernIndex := 3, modelKindIndex := 2})
}
definition{
name: viewCalculatorUserCorrectAnswers,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 0, viewpointIndex := 0, modelKindIndex := 1})
}
definition{
name: viewCalculatorUserProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 1, viewpointIndex := 1, modelKindIndex := 1})
}
definition{
name: viewServiceOperatorProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 2, viewpointIndex := 2, modelKindIndex := 1})
}
definition{
name: viewServiceOperatorRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 3, viewpointIndex := 3, modelKindIndex := 2})
}
definition{
name: viewVerifierIntegrityOfThePublishedApp,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 4, viewpointIndex := 4, modelKindIndex := 2})
}
definition{
name: viewVerifierProvedGuarantees,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 5, viewpointIndex := 5, modelKindIndex := 1})
}
definition{
name: viewVerifierRefusedMalformedRequests,
parameters: [],
result: Foundation.Arch::View,
body: (record Foundation.Arch::View {index := 6, viewpointIndex := 6, modelKindIndex := 2})
}
definition{
name: componentRecords,
parameters: [],
result: (List Foundation.Arch::Component),
body: (cons (componentBrowser) (cons (componentCalculatorPagesView) (cons (componentCalculatorProtocolGuest) (cons (componentCalculatorProtocolPage) (cons (componentCalculatorServiceRelease) (cons (componentGitHubPages) (cons (componentPrismBuild) (cons (componentSourceRepository) (nil Foundation.Arch::Component)))))))))
}
definition{
name: edgeRecords,
parameters: [],
result: (List Foundation.Arch::Edge),
body: (cons (edgeBrowserToCalculatorProtocolGuest) (cons (edgeCalculatorPagesViewToCalculatorProtocolGuest) (cons (edgeCalculatorProtocolGuestToBrowser) (cons (edgeCalculatorProtocolGuestToCalculatorPagesView) (cons (edgeCalculatorProtocolGuestToCalculatorServiceRelease) (cons (edgeCalculatorProtocolPageToGitHubPages) (cons (edgeCalculatorServiceReleaseToCalculatorProtocolGuest) (cons (edgeGitHubPagesToBrowser) (cons (edgePrismBuildToCalculatorProtocolGuest) (cons (edgePrismBuildToCalculatorProtocolPage) (cons (edgeSourceRepositoryToPrismBuild) (nil Foundation.Arch::Edge))))))))))))
}
definition{
name: viewpointRecords,
parameters: [],
result: (List Foundation.Arch::Viewpoint),
body: (cons (viewpointCalculatorUserCorrectAnswers) (cons (viewpointCalculatorUserProvedGuarantees) (cons (viewpointServiceOperatorProvedGuarantees) (cons (viewpointServiceOperatorRefusedMalformedRequests) (cons (viewpointVerifierIntegrityOfThePublishedApp) (cons (viewpointVerifierProvedGuarantees) (cons (viewpointVerifierRefusedMalformedRequests) (nil Foundation.Arch::Viewpoint))))))))
}
definition{
name: viewRecords,
parameters: [],
result: (List Foundation.Arch::View),
body: (cons (viewCalculatorUserCorrectAnswers) (cons (viewCalculatorUserProvedGuarantees) (cons (viewServiceOperatorProvedGuarantees) (cons (viewServiceOperatorRefusedMalformedRequests) (cons (viewVerifierIntegrityOfThePublishedApp) (cons (viewVerifierProvedGuarantees) (cons (viewVerifierRefusedMalformedRequests) (nil Foundation.Arch::View))))))))
}
definition{
name: edgesKnown,
parameters: [count : Nat, records : (List Foundation.Arch::Edge)],
result: Bool,
body: (match records
| List.nil => true
| List.cons edge rest => (((project edge fromIndex) <? count) && (((project edge toIndex) <? count) && (edgesKnown count rest)))),
recursive_argument: records
}
definition{
name: viewpointsKnown,
parameters: [
stakeholderCount : Nat,
concernCount : Nat,
records : (List Foundation.Arch::Viewpoint)
],
result: Bool,
body: (match records
| List.nil => true
| List.cons viewpoint rest => (((project viewpoint stakeholderIndex) <? stakeholderCount) && (((project viewpoint concernIndex) <? concernCount) && (((project viewpoint modelKindIndex) <? 3) && (viewpointsKnown stakeholderCount concernCount rest))))),
recursive_argument: records
}
definition{
name: viewMatches,
parameters: [view : Foundation.Arch::View, viewpoints : (List Foundation.Arch::Viewpoint)],
result: Bool,
body: (match viewpoints
| List.nil => false
| List.cons viewpoint rest => ((((project viewpoint index) =? (project view viewpointIndex)) && ((project viewpoint modelKindIndex) =? (project view modelKindIndex))) || (viewMatches view rest))),
recursive_argument: viewpoints
}
definition{
name: viewsConform,
parameters: [
viewpoints : (List Foundation.Arch::Viewpoint),
records : (List Foundation.Arch::View)
],
result: Bool,
body: (match records
| List.nil => true
| List.cons view rest => ((viewMatches view viewpoints) && (viewsConform viewpoints rest))),
recursive_argument: records
}
definition{
name: architectureValid,
parameters: [],
result: Bool,
body: ((edgesKnown 8 (edgeRecords)) && ((viewpointsKnown 3 4 (viewpointRecords)) && (viewsConform (viewpointRecords) (viewRecords))))
}
theorem{
name: architectureDescriptionHolds,
parameters: [],
statement: ((architectureValid) = true),
proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Compliance.lex.tex 56 lines
\begin{lexlean}{Compliance}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Architecture}
\importmodule{Design}
\importmodule{Quality}
\importmodule{Security}
\importmodule{CalculatorProtocol}
\title{standards reference}
\begin{semanticmodule}
structure{
name: Obligation,
type_parameters: [],
parameters: [],
fields: [
{name: index, type: Nat},
{name: standard, type: String},
{name: subject, type: String},
{name: text, type: String},
{name: evidence, type: (List String)}
]
}
definition{
name: obligations,
parameters: [],
result: (List Obligation),
body: (cons (record Obligation {index := 0, standard := "ISO/IEC/IEEE 42010:2022", subject := "Architecture description", text := "Stakeholders, concerns, viewpoints and views are declared and their references resolve.", evidence := (cons "Architecture::architectureDescriptionHolds" (nil String))}) (cons (record Obligation {index := 1, standard := "ISO/PAS 19450:2015 and OMG UML 2.5.1", subject := "Design views", text := "Every design view is checked by the SDK against the system model before it is rendered.", evidence := (cons "Design::viewOpmDecide" (cons "Design::viewUmlComponents" (cons "Design::viewUmlRequest" (cons "Design::viewUmlStates" (nil String)))))}) (cons (record Obligation {index := 2, standard := "ISO/IEC 25010:2023", subject := "Product quality", text := "Characteristics, subcharacteristics, requirements and measures are numbered and their parents resolve.", evidence := (cons "Quality::qualityModelHolds" (nil String))}) (cons (record Obligation {index := 3, standard := "ISO/IEC 27034-1:2011 and ISO/IEC 27005:2022", subject := "Application security and risk", text := "Every threat has a STRIDE category and a mapped control with evidence, or an accepted risk with its rationale.", evidence := (cons "Security::controlSet" (nil String))}) (cons (record Obligation {index := 4, standard := "OMG DMN 1.5, hit policy FIRST", subject := "Decision table", text := "The 4 rules are tried in order and the first that matches gives the answer; otherwise ok.", evidence := (cons "CalculatorProtocol::judge" (nil String))}) (cons (record Obligation {index := 5, standard := "OpenSpec", subject := "Requirements", text := "Every rule and property of the spec is a requirement with a scenario in openspec/specs.", evidence := (cons "CalculatorProtocol::application" (nil String))}) (cons (record Obligation {index := 6, standard := "SPDX MIT OR Apache-2.0", subject := "Licensing", text := "The application and its model are offered under MIT OR Apache-2.0.", evidence := (cons "CalculatorProtocol::application" (nil String))}) (nil Obligation))))))))
}
definition{
name: obligationsEvidenced,
parameters: [position : Nat, items : (List Obligation)],
result: Bool,
body: (match items
| List.nil => true
| List.cons item rest => (((project item index) =? position) && (match{
branches: [
{body: false, binders: [], constructor: List.nil},
{body: true, binders: [first, others], constructor: List.cons}
],
scrutinee: (project item evidence)
} && (obligationsEvidenced (position + 1) rest)))),
recursive_argument: items
}
theorem{
name: everyObligationEvidenced,
parameters: [],
statement: ((obligationsEvidenced 0 (obligations)) = true),
proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Design.lex.tex 591 lines
\begin{lexlean}{Design}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{design view}
\begin{semanticmodule}
definition{
name: processSendRequest,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentBrowser"})
}
definition{
name: processDecide,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processParseRequest,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processJudge,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processEncodeAnswer,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processBuildAndVerify,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentPrismBuild"})
}
definition{
name: processRule1,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processRule2,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processRule3,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processRule4,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: processOtherwise,
parameters: [],
result: Foundation.Arch::SystemProcess,
body: (record Foundation.Arch::SystemProcess {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateIdle,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateDeciding,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateRefused,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateAnsweredOk,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateAnsweredOverflow,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateAnsweredDivisionByZero,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateAnsweredUnsupportedVersion,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: stateAnsweredUnknownOperation,
parameters: [],
result: Foundation.Arch::SystemState,
body: (record Foundation.Arch::SystemState {owner := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: viewOpmDecide,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Deciding a Calculator protocol request", viewpoint := "Architecture::viewpointCalculatorUserCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.opmObjectProcess)})
}
definition{
name: viewUmlComponents,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Components of Calculator protocol", viewpoint := "Architecture::viewpointVerifierIntegrityOfThePublishedApp", diagram := (ctor Foundation.Arch::DesignDiagram.umlComponent)})
}
definition{
name: viewUmlRequest,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "Answering a Calculator protocol request", viewpoint := "Architecture::viewpointCalculatorUserCorrectAnswers", diagram := (ctor Foundation.Arch::DesignDiagram.umlSequence)})
}
definition{
name: viewUmlStates,
parameters: [],
result: Foundation.Arch::DesignView,
body: (record Foundation.Arch::DesignView {title := "States of the Calculator protocol guest", viewpoint := "Architecture::viewpointServiceOperatorRefusedMalformedRequests", diagram := (ctor Foundation.Arch::DesignDiagram.umlStateMachine)})
}
definition{
name: opmBrowser,
parameters: [],
result: Foundation.Arch::OpmThing,
body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.object), subject := "Architecture::componentBrowser"})
}
definition{
name: opmGuest,
parameters: [],
result: Foundation.Arch::OpmThing,
body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.object), subject := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: opmDecide,
parameters: [],
result: Foundation.Arch::OpmThing,
body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processDecide"})
}
definition{
name: opmParseRequest,
parameters: [],
result: Foundation.Arch::OpmThing,
body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processParseRequest"})
}
definition{
name: opmJudge,
parameters: [],
result: Foundation.Arch::OpmThing,
body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processJudge"})
}
definition{
name: opmEncodeAnswer,
parameters: [],
result: Foundation.Arch::OpmThing,
body: (record Foundation.Arch::OpmThing {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmThingKind.process), subject := "Design::processEncodeAnswer"})
}
definition{
name: opmGuestIdle,
parameters: [],
result: Foundation.Arch::OpmState,
body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentCalculatorProtocolGuest", state := "Design::stateIdle"})
}
definition{
name: opmGuestDeciding,
parameters: [],
result: Foundation.Arch::OpmState,
body: (record Foundation.Arch::OpmState {view := "Design::viewOpmDecide", thing := "Architecture::componentCalculatorProtocolGuest", state := "Design::stateDeciding"})
}
definition{
name: opmGuestAgent,
parameters: [],
result: Foundation.Arch::OpmLink,
body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.agent), source := "Architecture::componentCalculatorProtocolGuest", target := "Design::processDecide"})
}
definition{
name: opmBrowserInstrument,
parameters: [],
result: Foundation.Arch::OpmLink,
body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.instrument), source := "Architecture::componentBrowser", target := "Design::processParseRequest"})
}
definition{
name: opmParseInvokesJudge,
parameters: [],
result: Foundation.Arch::OpmLink,
body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.invocation), source := "Design::processParseRequest", target := "Design::processJudge"})
}
definition{
name: opmJudgeInvokesEncode,
parameters: [],
result: Foundation.Arch::OpmLink,
body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.invocation), source := "Design::processJudge", target := "Design::processEncodeAnswer"})
}
definition{
name: opmEncodeAffectsBrowser,
parameters: [],
result: Foundation.Arch::OpmLink,
body: (record Foundation.Arch::OpmLink {view := "Design::viewOpmDecide", kind := (ctor Foundation.Arch::OpmLinkKind.effect), source := "Architecture::componentBrowser", target := "Design::processEncodeAnswer"})
}
definition{
name: opmZoomParseRequest,
parameters: [],
result: Foundation.Arch::OpmZoom,
body: (record Foundation.Arch::OpmZoom {view := "Design::viewOpmDecide", process := "Design::processDecide", subprocess := "Design::processParseRequest", order := 0})
}
definition{
name: opmZoomJudge,
parameters: [],
result: Foundation.Arch::OpmZoom,
body: (record Foundation.Arch::OpmZoom {view := "Design::viewOpmDecide", process := "Design::processDecide", subprocess := "Design::processJudge", order := 1})
}
definition{
name: opmZoomEncodeAnswer,
parameters: [],
result: Foundation.Arch::OpmZoom,
body: (record Foundation.Arch::OpmZoom {view := "Design::viewOpmDecide", process := "Design::processDecide", subprocess := "Design::processEncodeAnswer", order := 2})
}
definition{
name: umlBrowser,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentBrowser"})
}
definition{
name: umlCalculatorPagesView,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentCalculatorPagesView"})
}
definition{
name: umlCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentCalculatorProtocolGuest"})
}
definition{
name: umlCalculatorProtocolPage,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentCalculatorProtocolPage"})
}
definition{
name: umlCalculatorServiceRelease,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentCalculatorServiceRelease"})
}
definition{
name: umlGitHubPages,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentGitHubPages"})
}
definition{
name: umlPrismBuild,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentPrismBuild"})
}
definition{
name: umlSourceRepository,
parameters: [],
result: Foundation.Arch::UmlComponent,
body: (record Foundation.Arch::UmlComponent {view := "Design::viewUmlComponents", component := "Architecture::componentSourceRepository"})
}
definition{
name: umlBrowserToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeBrowserToCalculatorProtocolGuest"})
}
definition{
name: umlCalculatorPagesViewToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCalculatorPagesViewToCalculatorProtocolGuest"})
}
definition{
name: umlCalculatorProtocolGuestToBrowser,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCalculatorProtocolGuestToBrowser"})
}
definition{
name: umlCalculatorProtocolGuestToCalculatorPagesView,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCalculatorProtocolGuestToCalculatorPagesView"})
}
definition{
name: umlCalculatorProtocolGuestToCalculatorServiceRelease,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCalculatorProtocolGuestToCalculatorServiceRelease"})
}
definition{
name: umlCalculatorProtocolPageToGitHubPages,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCalculatorProtocolPageToGitHubPages"})
}
definition{
name: umlCalculatorServiceReleaseToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeCalculatorServiceReleaseToCalculatorProtocolGuest"})
}
definition{
name: umlGitHubPagesToBrowser,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeGitHubPagesToBrowser"})
}
definition{
name: umlPrismBuildToCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToCalculatorProtocolGuest"})
}
definition{
name: umlPrismBuildToCalculatorProtocolPage,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgePrismBuildToCalculatorProtocolPage"})
}
definition{
name: umlSourceRepositoryToPrismBuild,
parameters: [],
result: Foundation.Arch::UmlConnector,
body: (record Foundation.Arch::UmlConnector {view := "Design::viewUmlComponents", edge := "Architecture::edgeSourceRepositoryToPrismBuild"})
}
definition{
name: seqBrowser,
parameters: [],
result: Foundation.Arch::UmlLifeline,
body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentBrowser", order := 0})
}
definition{
name: seqCalculatorProtocolGuest,
parameters: [],
result: Foundation.Arch::UmlLifeline,
body: (record Foundation.Arch::UmlLifeline {view := "Design::viewUmlRequest", component := "Architecture::componentCalculatorProtocolGuest", order := 1})
}
definition{
name: seqRequest,
parameters: [],
result: Foundation.Arch::UmlMessage,
body: (record Foundation.Arch::UmlMessage {view := "Design::viewUmlRequest", kind := (ctor Foundation.Arch::UmlMessageKind.synchronous), order := 0, source := "Architecture::componentBrowser", target := "Architecture::componentCalculatorProtocolGuest", process := "Design::processDecide"})
}
definition{
name: seqReply,
parameters: [],
result: Foundation.Arch::UmlMessage,
body: (record Foundation.Arch::UmlMessage {view := "Design::viewUmlRequest", kind := (ctor Foundation.Arch::UmlMessageKind.reply), order := 1, source := "Architecture::componentCalculatorProtocolGuest", target := "Architecture::componentBrowser", process := "Design::processDecide"})
}
definition{
name: stIdle,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateIdle", initial := true})
}
definition{
name: stDeciding,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateDeciding", initial := false})
}
definition{
name: stRefused,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateRefused", initial := false})
}
definition{
name: stAnsweredOk,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredOk", initial := false})
}
definition{
name: stAnsweredOverflow,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredOverflow", initial := false})
}
definition{
name: stAnsweredDivisionByZero,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredDivisionByZero", initial := false})
}
definition{
name: stAnsweredUnsupportedVersion,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredUnsupportedVersion", initial := false})
}
definition{
name: stAnsweredUnknownOperation,
parameters: [],
result: Foundation.Arch::UmlState,
body: (record Foundation.Arch::UmlState {view := "Design::viewUmlStates", state := "Design::stateAnsweredUnknownOperation", initial := false})
}
definition{
name: trAccept,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 0, source := "Design::stateIdle", target := "Design::stateDeciding", trigger := "Design::processParseRequest"})
}
definition{
name: trRefuse,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 1, source := "Design::stateIdle", target := "Design::stateRefused", trigger := "Design::processParseRequest"})
}
definition{
name: trRule1,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 2, source := "Design::stateDeciding", target := "Design::stateAnsweredUnsupportedVersion", trigger := "Design::processRule1"})
}
definition{
name: trRule2,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 3, source := "Design::stateDeciding", target := "Design::stateAnsweredUnknownOperation", trigger := "Design::processRule2"})
}
definition{
name: trRule3,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 4, source := "Design::stateDeciding", target := "Design::stateAnsweredDivisionByZero", trigger := "Design::processRule3"})
}
definition{
name: trRule4,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 5, source := "Design::stateDeciding", target := "Design::stateAnsweredOverflow", trigger := "Design::processRule4"})
}
definition{
name: trOtherwise,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 6, source := "Design::stateDeciding", target := "Design::stateAnsweredOk", trigger := "Design::processOtherwise"})
}
definition{
name: trResetOk,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 7, source := "Design::stateAnsweredOk", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetOverflow,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 8, source := "Design::stateAnsweredOverflow", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetDivisionByZero,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 9, source := "Design::stateAnsweredDivisionByZero", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetUnsupportedVersion,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 10, source := "Design::stateAnsweredUnsupportedVersion", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetUnknownOperation,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 11, source := "Design::stateAnsweredUnknownOperation", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
definition{
name: trResetRefused,
parameters: [],
result: Foundation.Arch::UmlTransition,
body: (record Foundation.Arch::UmlTransition {view := "Design::viewUmlStates", order := 12, source := "Design::stateRefused", target := "Design::stateIdle", trigger := "Design::processEncodeAnswer"})
}
\end{semanticmodule}
\end{lexlean}
app/src/Features.lex.tex 130 lines
\begin{lexlean}{Features}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{CalculatorProtocol}
\importmodule{Architecture}
\importmodule{Foundation.Arch}
\title{feature}
\begin{semanticmodule}
definition{
name: acceptINV001,
parameters: [],
result: String,
body: "CalculatorProtocolProofs::inv001Holds"
}
definition{
name: acceptINV002,
parameters: [],
result: String,
body: "CalculatorProtocolProofs::inv002Holds"
}
definition{
name: acceptINV003,
parameters: [],
result: String,
body: "CalculatorProtocolProofs::inv003Holds"
}
definition{
name: acceptINV004,
parameters: [],
result: String,
body: "CalculatorProtocolProofs::inv004Holds"
}
definition{
name: featureRule1,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When version differs from 1, the answer is unsupported-version.", calls := (cons "CalculatorProtocol::rule1" (cons "CalculatorProtocol::judge" (nil String))), acceptance := (cons "CalculatorProtocol::application" (nil String))})
}
definition{
name: featureRule2,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When operation is other, the answer is unknown-operation.", calls := (cons "CalculatorProtocol::rule2" (cons "CalculatorProtocol::judge" (nil String))), acceptance := (cons "CalculatorProtocol::application" (nil String))})
}
definition{
name: featureRule3,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When operation is divide and right is zero, the answer is division-by-zero.", calls := (cons "CalculatorProtocol::rule3" (cons "CalculatorProtocol::judge" (nil String))), acceptance := (cons "CalculatorProtocol::application" (nil String))})
}
definition{
name: featureRule4,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When range is beyond, the answer is overflow.", calls := (cons "CalculatorProtocol::rule4" (cons "CalculatorProtocol::judge" (nil String))), acceptance := (cons "CalculatorProtocol::application" (nil String))})
}
definition{
name: featureOtherwise,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "When no rule matches, the answer is ok.", calls := (cons "CalculatorProtocol::judge" (nil String)), acceptance := (cons "CalculatorProtocol::application" (nil String))})
}
definition{
name: featureRefuseMalformed,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "A request that is not version, operation, right, range in order, separated by single spaces, or is over 112 bytes, is answered invalid.", calls := (cons "CalculatorProtocol::dispatch" (cons "CalculatorProtocol::decodeField1" (nil String))), acceptance := (cons "CalculatorProtocol::application" (nil String))})
}
definition{
name: featureINV001,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers ok when operation is divide and right is zero.", calls := (cons "CalculatorProtocol::judge" (nil String)), acceptance := (cons "Features::acceptINV001" (nil String))})
}
definition{
name: featureINV002,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers ok when range is beyond.", calls := (cons "CalculatorProtocol::judge" (nil String)), acceptance := (cons "Features::acceptINV002" (nil String))})
}
definition{
name: featureINV003,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It never answers ok when version differs from 1.", calls := (cons "CalculatorProtocol::judge" (nil String)), acceptance := (cons "Features::acceptINV003" (nil String))})
}
definition{
name: featureINV004,
parameters: [],
result: Foundation.Arch::Feature,
body: (record Foundation.Arch::Feature {statement := "It always answers unknown-operation when version equals 1 and operation is other.", calls := (cons "CalculatorProtocol::judge" (nil String)), acceptance := (cons "Features::acceptINV004" (nil String))})
}
definition{
name: journeyCalculatorUser,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderCalculatorUser", steps := (cons "Features::featureOtherwise" (cons "Features::featureRule3" (cons "Features::featureRule4" (cons "Features::featureINV001" (cons "Features::featureINV002" (nil String))))))})
}
definition{
name: journeyServiceOperator,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderServiceOperator", steps := (cons "Features::featureRule1" (cons "Features::featureRule2" (cons "Features::featureINV003" (cons "Features::featureINV004" (cons "Features::featureRefuseMalformed" (nil String))))))})
}
definition{
name: journeyVerifier,
parameters: [],
result: Foundation.Arch::Journey,
body: (record Foundation.Arch::Journey {actor := "Architecture::stakeholderVerifier", steps := (cons "Features::featureRefuseMalformed" (cons "Features::featureINV001" (cons "Features::featureINV002" (cons "Features::featureINV003" (cons "Features::featureINV004" (nil String))))))})
}
\end{semanticmodule}
\end{lexlean}
app/src/Quality.lex.tex 375 lines
\begin{lexlean}{Quality}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\useglossary{prism.qual@1.0.0}
\importmodule{Foundation.Qual}
\title{quality measure}
\begin{semanticmodule}
structure{
name: Named,
type_parameters: [],
parameters: [],
fields: [{name: index, type: Nat}, {name: name, type: String}, {name: text, type: String}]
}
definition{
name: characteristicFunctionalSuitability,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 0})
}
definition{
name: characteristicPerformanceEfficiency,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 1})
}
definition{
name: characteristicReliability,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 2})
}
definition{
name: characteristicSecurity,
parameters: [],
result: Foundation.Qual::ProductQualityCharacteristic,
body: (record Foundation.Qual::ProductQualityCharacteristic {index := 3})
}
definition{
name: subcharacteristicFaultTolerance,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 0, characteristicIndex := 2})
}
definition{
name: subcharacteristicFaultlessness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 1, characteristicIndex := 2})
}
definition{
name: subcharacteristicFunctionalCompleteness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 2, characteristicIndex := 0})
}
definition{
name: subcharacteristicFunctionalCorrectness,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 3, characteristicIndex := 0})
}
definition{
name: subcharacteristicIntegrity,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 4, characteristicIndex := 3})
}
definition{
name: subcharacteristicResourceUtilization,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 5, characteristicIndex := 1})
}
definition{
name: subcharacteristicTimeBehaviour,
parameters: [],
result: Foundation.Qual::QualitySubcharacteristic,
body: (record Foundation.Qual::QualitySubcharacteristic {index := 6, characteristicIndex := 1})
}
definition{
name: requirementBoundedAllocation,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 0, subcharacteristicIndex := 5})
}
definition{
name: requirementBoundedRequest,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 1, subcharacteristicIndex := 6})
}
definition{
name: requirementEveryErrorTyped,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 2, subcharacteristicIndex := 0})
}
definition{
name: requirementEveryOperationModeled,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 3, subcharacteristicIndex := 2})
}
definition{
name: requirementEveryPropertyProved,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 4, subcharacteristicIndex := 4})
}
definition{
name: requirementEveryRequestAnswered,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 5, subcharacteristicIndex := 2})
}
definition{
name: requirementEveryVectorReplays,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 6, subcharacteristicIndex := 1})
}
definition{
name: requirementExamplesAnsweredAsStated,
parameters: [],
result: Foundation.Qual::QualityRequirement,
body: (record Foundation.Qual::QualityRequirement {index := 7, subcharacteristicIndex := 3})
}
definition{
name: measureExampleMismatches,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 0, requirementIndex := 7, threshold := 0})
}
definition{
name: measureFailedVectors,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 1, requirementIndex := 6, threshold := 0})
}
definition{
name: measureGuestAllocationBytes,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 2, requirementIndex := 0, threshold := 224})
}
definition{
name: measureOperationsModeled,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 3, requirementIndex := 3, threshold := 4})
}
definition{
name: measureRequestBytesRead,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 4, requirementIndex := 1, threshold := 112})
}
definition{
name: measureUnansweredRequests,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 5, requirementIndex := 5, threshold := 0})
}
definition{
name: measureUnprovedProperties,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 6, requirementIndex := 4, threshold := 0})
}
definition{
name: measureUntypedErrors,
parameters: [],
result: Foundation.Qual::QualityMeasure,
body: (record Foundation.Qual::QualityMeasure {index := 7, requirementIndex := 2, threshold := 0})
}
definition{
name: characteristicNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Functional suitability", text := "Functional suitability, as ISO/IEC 25010:2023 defines it, for Calculator protocol."}) (cons (record Named {index := 1, name := "Performance efficiency", text := "Performance efficiency, as ISO/IEC 25010:2023 defines it, for Calculator protocol."}) (cons (record Named {index := 2, name := "Reliability", text := "Reliability, as ISO/IEC 25010:2023 defines it, for Calculator protocol."}) (cons (record Named {index := 3, name := "Security", text := "Security, as ISO/IEC 25010:2023 defines it, for Calculator protocol."}) (nil Named)))))
}
definition{
name: subcharacteristicNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Fault tolerance", text := "Reliability: Fault tolerance."}) (cons (record Named {index := 1, name := "Faultlessness", text := "Reliability: Faultlessness."}) (cons (record Named {index := 2, name := "Functional completeness", text := "Functional suitability: Functional completeness."}) (cons (record Named {index := 3, name := "Functional correctness", text := "Functional suitability: Functional correctness."}) (cons (record Named {index := 4, name := "Integrity", text := "Security: Integrity."}) (cons (record Named {index := 5, name := "Resource utilization", text := "Performance efficiency: Resource utilization."}) (cons (record Named {index := 6, name := "Time behaviour", text := "Performance efficiency: Time behaviour."}) (nil Named))))))))
}
definition{
name: requirementNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Bounded allocation", text := "The guest allocates at most 224 bytes for one request."}) (cons (record Named {index := 1, name := "Bounded request", text := "A request over 112 bytes is refused before any field is read."}) (cons (record Named {index := 2, name := "Every error typed", text := "Every CalculatorError and every ProtocolError but MalformedRequest, which the decoder answers invalid, is an answer."}) (cons (record Named {index := 3, name := "Every operation modeled", text := "Each of the four Operation constructors is a value of the operation field."}) (cons (record Named {index := 4, name := "Every property proved", text := "All 4 properties are theorems the Lean kernel checks."}) (cons (record Named {index := 5, name := "Every request answered", text := "Every request gets an answer: a rule, ok otherwise, or invalid."}) (cons (record Named {index := 6, name := "Every vector replays", text := "All 44 acceptance vectors replay in the compiled guest, the shortest 0 bytes long."}) (cons (record Named {index := 7, name := "Examples answered as stated", text := "Every one of the 7 examples of the spec is answered as it states."}) (nil Named)))))))))
}
definition{
name: measureNames,
parameters: [],
result: (List Named),
body: (cons (record Named {index := 0, name := "Example mismatches", text := "Examples the guest answers otherwise than they state."}) (cons (record Named {index := 1, name := "Failed vectors", text := "Acceptance vectors whose replay differs from the model."}) (cons (record Named {index := 2, name := "Guest allocation bytes", text := "Most bytes the guest allocates for one request."}) (cons (record Named {index := 3, name := "Operations modeled", text := "Operation constructors of src/Calculator.lex.tex the app distinguishes."}) (cons (record Named {index := 4, name := "Request bytes read", text := "Longest request the guest decodes, in bytes."}) (cons (record Named {index := 5, name := "Unanswered requests", text := "Acceptance vectors the guest does not answer."}) (cons (record Named {index := 6, name := "Unproved properties", text := "Properties of the spec without a checked theorem."}) (cons (record Named {index := 7, name := "Untyped errors", text := "Error constructors with no answer and no invalid refusal."}) (nil Named)))))))))
}
definition{
name: subcharacteristicRecords,
parameters: [],
result: (List Foundation.Qual::QualitySubcharacteristic),
body: (cons (subcharacteristicFaultTolerance) (cons (subcharacteristicFaultlessness) (cons (subcharacteristicFunctionalCompleteness) (cons (subcharacteristicFunctionalCorrectness) (cons (subcharacteristicIntegrity) (cons (subcharacteristicResourceUtilization) (cons (subcharacteristicTimeBehaviour) (nil Foundation.Qual::QualitySubcharacteristic))))))))
}
definition{
name: requirementRecords,
parameters: [],
result: (List Foundation.Qual::QualityRequirement),
body: (cons (requirementBoundedAllocation) (cons (requirementBoundedRequest) (cons (requirementEveryErrorTyped) (cons (requirementEveryOperationModeled) (cons (requirementEveryPropertyProved) (cons (requirementEveryRequestAnswered) (cons (requirementEveryVectorReplays) (cons (requirementExamplesAnsweredAsStated) (nil Foundation.Qual::QualityRequirement)))))))))
}
definition{
name: measureRecords,
parameters: [],
result: (List Foundation.Qual::QualityMeasure),
body: (cons (measureExampleMismatches) (cons (measureFailedVectors) (cons (measureGuestAllocationBytes) (cons (measureOperationsModeled) (cons (measureRequestBytesRead) (cons (measureUnansweredRequests) (cons (measureUnprovedProperties) (cons (measureUntypedErrors) (nil Foundation.Qual::QualityMeasure)))))))))
}
definition{
name: namesNumbered,
parameters: [position : Nat, names : (List Named)],
result: Bool,
body: (match names
| List.nil => true
| List.cons item rest => (((project item index) =? position) && (namesNumbered (position + 1) rest))),
recursive_argument: names
}
definition{
name: parentsKnown,
parameters: [count : Nat, records : (List Foundation.Qual::QualitySubcharacteristic)],
result: Bool,
body: (match records
| List.nil => true
| List.cons item rest => (((project item characteristicIndex) <? count) && (parentsKnown count rest))),
recursive_argument: records
}
definition{
name: requirementsKnown,
parameters: [count : Nat, records : (List Foundation.Qual::QualityRequirement)],
result: Bool,
body: (match records
| List.nil => true
| List.cons item rest => (((project item subcharacteristicIndex) <? count) && (requirementsKnown count rest))),
recursive_argument: records
}
definition{
name: measuresKnown,
parameters: [count : Nat, records : (List Foundation.Qual::QualityMeasure)],
result: Bool,
body: (match records
| List.nil => true
| List.cons item rest => (((project item requirementIndex) <? count) && (measuresKnown count rest))),
recursive_argument: records
}
definition{
name: thresholdOf,
parameters: [wanted : Nat, records : (List Foundation.Qual::QualityMeasure)],
result: Nat,
body: (match records
| List.nil => 0
| List.cons head rest => (if ((project head index) =? wanted) then (project head threshold) else (thresholdOf wanted rest))),
recursive_argument: records
}
definition{
name: qualityValid,
parameters: [],
result: Bool,
body: ((namesNumbered 0 (characteristicNames)) && ((namesNumbered 0 (subcharacteristicNames)) && ((namesNumbered 0 (requirementNames)) && ((namesNumbered 0 (measureNames)) && ((parentsKnown 4 (subcharacteristicRecords)) && ((requirementsKnown 7 (requirementRecords)) && (measuresKnown 8 (measureRecords))))))))
}
theorem{
name: qualityModelHolds,
parameters: [],
statement: ((qualityValid) = true),
proof: decide{}
}
theorem{
name: measureExampleMismatchesThreshold,
parameters: [],
statement: ((thresholdOf 0 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureFailedVectorsThreshold,
parameters: [],
statement: ((thresholdOf 1 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureGuestAllocationBytesThreshold,
parameters: [],
statement: ((thresholdOf 2 (measureRecords)) = 224),
proof: decide{}
}
theorem{
name: measureOperationsModeledThreshold,
parameters: [],
statement: ((thresholdOf 3 (measureRecords)) = 4),
proof: decide{}
}
theorem{
name: measureRequestBytesReadThreshold,
parameters: [],
statement: ((thresholdOf 4 (measureRecords)) = 112),
proof: decide{}
}
theorem{
name: measureUnansweredRequestsThreshold,
parameters: [],
statement: ((thresholdOf 5 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureUnprovedPropertiesThreshold,
parameters: [],
statement: ((thresholdOf 6 (measureRecords)) = 0),
proof: decide{}
}
theorem{
name: measureUntypedErrorsThreshold,
parameters: [],
statement: ((thresholdOf 7 (measureRecords)) = 0),
proof: decide{}
}
\end{semanticmodule}
\end{lexlean}
app/src/Security.lex.tex 607 lines
\begin{lexlean}{Security}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\useglossary{prism.sec@1.0.0}
\importmodule{Foundation.Sec}
\importmodule{Production.ThreatModel}
\importmodule{Architecture}
\title{security threat}
\begin{semanticmodule}
definition{
name: assetAnswer,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 0, componentIndex := 2})
}
definition{
name: assetModelSource,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 1, componentIndex := 7})
}
definition{
name: assetPublishedHolo,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 2, componentIndex := 3})
}
definition{
name: assetRequestBytes,
parameters: [],
result: Foundation.Sec::Asset,
body: (record Foundation.Sec::Asset {index := 3, componentIndex := 2})
}
definition{
name: threatAnswerThatBreaksINV001,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 0})
}
definition{
name: threatAnswerThatBreaksINV002,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 1})
}
definition{
name: threatAnswerThatBreaksINV003,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 2})
}
definition{
name: threatAnswerThatBreaksINV004,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 3})
}
definition{
name: threatDivisionByZeroAnswered,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 4})
}
definition{
name: threatGrantedCapability,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 5})
}
definition{
name: threatMalformedRequest,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 6})
}
definition{
name: threatOversizedRequest,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 7})
}
definition{
name: threatSilentOverflow,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 8})
}
definition{
name: threatSubstitutedHolo,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 9})
}
definition{
name: threatSubstitutedHost,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 10})
}
definition{
name: threatTamperedModel,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 11})
}
definition{
name: threatVersionDowngrade,
parameters: [],
result: Foundation.Sec::Threat,
body: (record Foundation.Sec::Threat {index := 12})
}
definition{
name: riskAnswerThatBreaksINV001,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 0, assetIndex := 0, threatIndex := 0, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskAnswerThatBreaksINV002,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 1, assetIndex := 0, threatIndex := 1, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskAnswerThatBreaksINV003,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 2, assetIndex := 0, threatIndex := 2, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskAnswerThatBreaksINV004,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 3, assetIndex := 0, threatIndex := 3, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskDivisionByZeroAnswered,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 4, assetIndex := 0, threatIndex := 4, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskGrantedCapability,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 5, assetIndex := 0, threatIndex := 5, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskMalformedRequest,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 6, assetIndex := 3, threatIndex := 6, likelihood := (ctor Foundation.Sec::Likelihood.high), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskOversizedRequest,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 7, assetIndex := 3, threatIndex := 7, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.minor)})
}
definition{
name: riskSilentOverflow,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 8, assetIndex := 0, threatIndex := 8, likelihood := (ctor Foundation.Sec::Likelihood.medium), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskSubstitutedHolo,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 9, assetIndex := 2, threatIndex := 9, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskSubstitutedHost,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 10, assetIndex := 2, threatIndex := 10, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.critical)})
}
definition{
name: riskTamperedModel,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 11, assetIndex := 1, threatIndex := 11, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: riskVersionDowngrade,
parameters: [],
result: Foundation.Sec::Risk,
body: (record Foundation.Sec::Risk {index := 12, assetIndex := 3, threatIndex := 12, likelihood := (ctor Foundation.Sec::Likelihood.low), impact := (ctor Foundation.Sec::Impact.major)})
}
definition{
name: controlBoundedRequest,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 0, riskIndex := 7})
}
definition{
name: controlCheckedResult,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 1, riskIndex := 8})
}
definition{
name: controlFingerprintAndProvenance,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 2, riskIndex := 9})
}
definition{
name: controlNoCapabilityGranted,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 3, riskIndex := 5})
}
definition{
name: controlOnlyVersion1,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 4, riskIndex := 12})
}
definition{
name: controlProofOfINV001,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 5, riskIndex := 0})
}
definition{
name: controlProofOfINV002,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 6, riskIndex := 1})
}
definition{
name: controlProofOfINV003,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 7, riskIndex := 2})
}
definition{
name: controlProofOfINV004,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 8, riskIndex := 3})
}
definition{
name: controlRegeneratedFromThePrompt,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 9, riskIndex := 11})
}
definition{
name: controlStrictDecoder,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 10, riskIndex := 6})
}
definition{
name: controlTypedDivisionError,
parameters: [],
result: Foundation.Sec::ApplicationSecurityControl,
body: (record Foundation.Sec::ApplicationSecurityControl {index := 11, riskIndex := 4})
}
definition{
name: controlSet,
parameters: [],
result: Production.ThreatModel::ControlSet,
body: (record Production.ThreatModel::ControlSet {title := "Calculator protocol security controls", text := "Calculator protocol answers one request with one answer in a Core-Wasm guest granted no capability. Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers.", version := "0.1.0", lastModified := "2026-11-12T18:44:38Z"})
}
definition{
name: modeledAssetAnswer,
parameters: [],
result: Production.ThreatModel::ModeledAsset,
body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetAnswer", name := "Answer", text := "The answer the guest returns: one of ok, overflow, division-by-zero, unsupported-version, unknown-operation, or invalid."})
}
definition{
name: modeledAssetModelSource,
parameters: [],
result: Production.ThreatModel::ModeledAsset,
body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetModelSource", name := "Model source", text := "The prompt, the spec and the LexLean model in the repository, from which the holo is built."})
}
definition{
name: modeledAssetPublishedHolo,
parameters: [],
result: Production.ThreatModel::ModeledAsset,
body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetPublishedHolo", name := "Published holo", text := "The holo and page the Pages workflow publishes, with its fingerprint and signed provenance."})
}
definition{
name: modeledAssetRequestBytes,
parameters: [],
result: Production.ThreatModel::ModeledAsset,
body: (record Production.ThreatModel::ModeledAsset {asset := "Security::assetRequestBytes", name := "Request bytes", text := "The bytes a caller sends, at most 112 of them."})
}
definition{
name: modeledThreatAnswerThatBreaksINV001,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV001", name := "Answer that breaks INV-001", text := "The guest answers ok although operation is divide and right is zero, which matters because a division by zero has no result.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatAnswerThatBreaksINV002,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV002", name := "Answer that breaks INV-002", text := "The guest answers ok although range is beyond, which matters because a result outside i64 is never wrapped or truncated.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatAnswerThatBreaksINV003,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV003", name := "Answer that breaks INV-003", text := "The guest answers ok although version differs from 1, which matters because an unsupported version is never interpreted as version 1.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatAnswerThatBreaksINV004,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatAnswerThatBreaksINV004", name := "Answer that breaks INV-004", text := "The guest answers unknown-operation not when version equals 1 and operation is other, which matters because an undefined operation is a typed protocol error.", category := (ctor Production.ThreatModel::Stride.repudiation)})
}
definition{
name: modeledThreatDivisionByZeroAnswered,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatDivisionByZeroAnswered", name := "Division by zero answered", text := "A zero divisor yields a number or a trap instead of a typed error.", category := (ctor Production.ThreatModel::Stride.denialOfService)})
}
definition{
name: modeledThreatGrantedCapability,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatGrantedCapability", name := "Granted capability", text := "The guest reads, stores or sends data beyond the request it answers.", category := (ctor Production.ThreatModel::Stride.informationDisclosure)})
}
definition{
name: modeledThreatMalformedRequest,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatMalformedRequest", name := "Malformed request", text := "A request with a missing, extra, unknown or badly written field is answered as if it were well formed.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
definition{
name: modeledThreatOversizedRequest,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatOversizedRequest", name := "Oversized request", text := "A request longer than 112 bytes makes the guest parse or allocate without bound.", category := (ctor Production.ThreatModel::Stride.denialOfService)})
}
definition{
name: modeledThreatSilentOverflow,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSilentOverflow", name := "Silent overflow", text := "An out-of-range sum or product is wrapped and answered as ok.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
definition{
name: modeledThreatSubstitutedHolo,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSubstitutedHolo", name := "Substituted holo", text := "A holo other than the one the build verified is served under the app address.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}
definition{
name: modeledThreatSubstitutedHost,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatSubstitutedHost", name := "Substituted host", text := "Something other than the repository Pages workflow serves pages under its address.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}
definition{
name: modeledThreatTamperedModel,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatTamperedModel", name := "Tampered model", text := "The model the holo is built from differs from the reviewed prompt and spec.", category := (ctor Production.ThreatModel::Stride.tampering)})
}
definition{
name: modeledThreatVersionDowngrade,
parameters: [],
result: Production.ThreatModel::ModeledThreat,
body: (record Production.ThreatModel::ModeledThreat {threat := "Security::threatVersionDowngrade", name := "Version downgrade", text := "A client sends another protocol version hoping it is read as version 1.", category := (ctor Production.ThreatModel::Stride.spoofing)})
}
definition{
name: modeledControlBoundedRequest,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlBoundedRequest", name := "Bounded request", text := "dispatch answers invalid for a request over 112 bytes before reading a field, and the guest allocates at most 224.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "acceptance vectors at the request bound, one byte over it, and at the guest allocation bound, replayed by prismpm verify"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlCheckedResult,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlCheckedResult", name := "Checked result", text := "A result beyond i64 is answered overflow.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv002Holds"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "UOR-Foundation/calculator-example src/Calculator.lex.tex acceptance vectors at the i64 bounds"}) (nil Production.ThreatModel::Evidence)))})
}
definition{
name: modeledControlFingerprintAndProvenance,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlFingerprintAndProvenance", name := "Fingerprint and provenance", text := "The page verifies the holo digests before it runs, and the build signs its provenance as the repository workflow.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "actions/attest-build-provenance in the pages workflow"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prism-code check of the holo identities in the page"}) (nil Production.ThreatModel::Evidence)))})
}
definition{
name: modeledControlNoCapabilityGranted,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlNoCapabilityGranted", name := "No capability granted", text := "prism.toml grants the holo nothing and the model declares capabilitiesEmpty, so a guest import of any host capability is refused.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prism-code check refuses an ungranted guest import"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlOnlyVersion1,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlOnlyVersion1", name := "Only version 1", text := "Any version but 1 is unsupported-version.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv003Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlProofOfINV001,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV001", name := "Proof of INV-001", text := "It never answers ok when operation is divide and right is zero. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv001Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlProofOfINV002,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV002", name := "Proof of INV-002", text := "It never answers ok when range is beyond. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv002Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlProofOfINV003,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV003", name := "Proof of INV-003", text := "It never answers ok when version differs from 1. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv003Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlProofOfINV004,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlProofOfINV004", name := "Proof of INV-004", text := "It always answers unknown-operation when version equals 1 and operation is other. The Lean kernel proves it for every request.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv004Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlRegeneratedFromThePrompt,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlRegeneratedFromThePrompt", name := "Regenerated from the prompt", text := "The model is written from the prompt by the builder, and the build checks every theorem and replays every vector in the pinned SDK.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "prismpm verify in the SDK image prismpm.lock pins"}) (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.review), reference := "app/prompt.json"}) (nil Production.ThreatModel::Evidence)))})
}
definition{
name: modeledControlStrictDecoder,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlStrictDecoder", name := "Strict decoder", text := "Every field is decoded exactly: choices from their list, numbers as plain decimal digits within their bounds, single spaces between fields; anything else is invalid.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.gate), reference := "malformed-request acceptance vectors, replayed in the compiled guest by prismpm verify"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: modeledControlTypedDivisionError,
parameters: [],
result: Production.ThreatModel::ModeledControl,
body: (record Production.ThreatModel::ModeledControl {control := "Security::controlTypedDivisionError", name := "Typed division error", text := "A zero divisor is answered division-by-zero.", evidence := (cons (record Production.ThreatModel::Evidence {kind := (ctor Production.ThreatModel::EvidenceKind.proof), reference := "CalculatorProtocolProofs::inv001Holds"}) (nil Production.ThreatModel::Evidence))})
}
definition{
name: mappingOversizedRequest,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatOversizedRequest", controls := (cons "Security::controlBoundedRequest" (nil String))})
}
definition{
name: mappingSilentOverflow,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatSilentOverflow", controls := (cons "Security::controlCheckedResult" (nil String))})
}
definition{
name: mappingSubstitutedHolo,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatSubstitutedHolo", controls := (cons "Security::controlFingerprintAndProvenance" (nil String))})
}
definition{
name: mappingGrantedCapability,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatGrantedCapability", controls := (cons "Security::controlNoCapabilityGranted" (nil String))})
}
definition{
name: mappingVersionDowngrade,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatVersionDowngrade", controls := (cons "Security::controlOnlyVersion1" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV001,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV001", controls := (cons "Security::controlProofOfINV001" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV002,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV002", controls := (cons "Security::controlProofOfINV002" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV003,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV003", controls := (cons "Security::controlProofOfINV003" (nil String))})
}
definition{
name: mappingAnswerThatBreaksINV004,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatAnswerThatBreaksINV004", controls := (cons "Security::controlProofOfINV004" (nil String))})
}
definition{
name: mappingTamperedModel,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatTamperedModel", controls := (cons "Security::controlRegeneratedFromThePrompt" (nil String))})
}
definition{
name: mappingMalformedRequest,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatMalformedRequest", controls := (cons "Security::controlStrictDecoder" (nil String))})
}
definition{
name: mappingDivisionByZeroAnswered,
parameters: [],
result: Production.ThreatModel::ThreatMapping,
body: (record Production.ThreatModel::ThreatMapping {threat := "Security::threatDivisionByZeroAnswered", controls := (cons "Security::controlTypedDivisionError" (nil String))})
}
definition{
name: acceptedSubstitutedHost,
parameters: [],
result: Production.ThreatModel::AcceptedRisk,
body: (record Production.ThreatModel::AcceptedRisk {threat := "Security::threatSubstitutedHost", rationale := "A page cannot defend against its own host. The holo carries signed build provenance a visitor can check, and the app can be rebuilt from its prompt."})
}
\end{semanticmodule}
\end{lexlean}
app/src/CalculatorProtocol.lex.tex 243 lines
\begin{lexlean}{CalculatorProtocol}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{Foundation.Bytes}
\importmodule{Foundation.View.Text.V1.Model}
\title{Text application model}
\begin{semanticmodule}
definition{name: operationAdd, parameters: [], result: Nat, body: 0}
definition{name: operationSubtract, parameters: [], result: Nat, body: 1}
definition{name: operationMultiply, parameters: [], result: Nat, body: 2}
definition{name: operationDivide, parameters: [], result: Nat, body: 3}
definition{name: operationOther, parameters: [], result: Nat, body: 4}
definition{name: rightZero, parameters: [], result: Nat, body: 0}
definition{name: rightNonzero, parameters: [], result: Nat, body: 1}
definition{name: rangeWithin, parameters: [], result: Nat, body: 0}
definition{name: rangeBeyond, parameters: [], result: Nat, body: 1}
definition{name: answerOk, parameters: [], result: Nat, body: 0}
definition{name: answerOverflow, parameters: [], result: Nat, body: 1}
definition{name: answerDivisionByZero, parameters: [], result: Nat, body: 2}
definition{name: answerUnsupportedVersion, parameters: [], result: Nat, body: 3}
definition{name: answerUnknownOperation, parameters: [], result: Nat, body: 4}
structure{
name: Request,
type_parameters: [],
parameters: [],
fields: [
{name: version, type: Nat},
{name: operation, type: Nat},
{name: right, type: Nat},
{name: range, type: Nat}
]
}
definition{
name: byteAt,
parameters: [s : Bytes, i : Nat],
result: (Option Nat),
body: (match (prim index s i : (Option UInt8))
| Option.none => (ctor Option.none [Nat])
| Option.some b => (ctor Option.some [Nat] (prim to_nat b : Nat))),
axioms: [Quot.sound, propext]
}
definition{
name: digitsValue,
parameters: [s : Bytes, i : Nat, acc : Nat, fuel : Nat],
result: (Option Nat),
body: (match fuel
| Nat.zero => (ctor Option.some [Nat] acc)
| Nat.succ rest => (match (byteAt s i)
| Option.none => (ctor Option.none [Nat])
| Option.some d => (if ((d <? 48) || (57 <? d)) then (ctor Option.none [Nat]) else (digitsValue s (i + 1) ((prim multiply acc 10 : Nat) + (prim subtract d 48 : Nat)) rest)))),
axioms: [Quot.sound, propext],
recursive_argument: fuel
}
definition{
name: parseDigits,
parameters: [s : Bytes],
result: (Option Nat),
body: (if ((Foundation.Bytes::byteLength s) =? 0) then (ctor Option.none [Nat]) else (if (18 <? (Foundation.Bytes::byteLength s)) then (ctor Option.none [Nat]) else (match (byteAt s 0)
| Option.none => (ctor Option.none [Nat])
| Option.some lead => (if ((lead =? 48) && (1 <? (Foundation.Bytes::byteLength s))) then (ctor Option.none [Nat]) else (digitsValue s 0 0 (Foundation.Bytes::byteLength s)))))),
axioms: [Quot.sound, propext]
}
definition{
name: parseNumber,
parameters: [value : Bytes],
result: (Option Nat),
body: (parseDigits value),
axioms: [Quot.sound, propext]
}
definition{
name: parseVersion,
parameters: [value : Bytes],
result: (Option Nat),
body: (match (parseNumber value)
| Option.none => (ctor Option.none [Nat])
| Option.some parsed => (if (9 <? parsed) then (ctor Option.none [Nat]) else (ctor Option.some [Nat] parsed))),
axioms: [Quot.sound, propext]
}
definition{
name: parseOperation,
parameters: [value : Bytes],
result: (Option Nat),
body: (if (prim equal value 0x616464 : Bool) then (ctor Option.some [Nat] (operationAdd)) else (if (prim equal value 0x7375627472616374 : Bool) then (ctor Option.some [Nat] (operationSubtract)) else (if (prim equal value 0x6d756c7469706c79 : Bool) then (ctor Option.some [Nat] (operationMultiply)) else (if (prim equal value 0x646976696465 : Bool) then (ctor Option.some [Nat] (operationDivide)) else (if (prim equal value 0x6f74686572 : Bool) then (ctor Option.some [Nat] (operationOther)) else (ctor Option.none [Nat]))))))
}
definition{
name: parseRight,
parameters: [value : Bytes],
result: (Option Nat),
body: (if (prim equal value 0x7a65726f : Bool) then (ctor Option.some [Nat] (rightZero)) else (if (prim equal value 0x6e6f6e7a65726f : Bool) then (ctor Option.some [Nat] (rightNonzero)) else (ctor Option.none [Nat])))
}
definition{
name: parseRange,
parameters: [value : Bytes],
result: (Option Nat),
body: (if (prim equal value 0x77697468696e : Bool) then (ctor Option.some [Nat] (rangeWithin)) else (if (prim equal value 0x6265796f6e64 : Bool) then (ctor Option.some [Nat] (rangeBeyond)) else (ctor Option.none [Nat])))
}
definition{
name: sliceOf,
parameters: [s : Bytes, start : Nat, count : Nat],
result: Bytes,
body: (match (prim slice s start count : (Option Bytes))
| Option.none => 0x
| Option.some part => part)
}
definition{
name: fieldEnd,
parameters: [s : Bytes, i : Nat, fuel : Nat],
result: Nat,
body: (match fuel
| Nat.zero => i
| Nat.succ rest => (match (byteAt s i)
| Option.none => i
| Option.some d => (if (d =? 32) then i else (fieldEnd s (i + 1) rest)))),
axioms: [Quot.sound, propext],
recursive_argument: fuel
}
definition{
name: decodeField4,
parameters: [s : Bytes, start : Nat, v1 : Nat, v2 : Nat, v3 : Nat],
result: (Option Request),
body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseRange (sliceOf s start (prim subtract e start : Nat)))
| Option.none => (ctor Option.none [Request])
| Option.some v4 => (if (e =? (Foundation.Bytes::byteLength s)) then (ctor Option.some [Request] (record Request {version := v1, operation := v2, right := v3, range := v4})) else (ctor Option.none [Request])))),
axioms: [Quot.sound, propext]
}
definition{
name: decodeField3,
parameters: [s : Bytes, start : Nat, v1 : Nat, v2 : Nat],
result: (Option Request),
body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseRight (sliceOf s start (prim subtract e start : Nat)))
| Option.none => (ctor Option.none [Request])
| Option.some v3 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField4 s (e + 1) v1 v2 v3) else (ctor Option.none [Request])))),
axioms: [Quot.sound, propext]
}
definition{
name: decodeField2,
parameters: [s : Bytes, start : Nat, v1 : Nat],
result: (Option Request),
body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseOperation (sliceOf s start (prim subtract e start : Nat)))
| Option.none => (ctor Option.none [Request])
| Option.some v2 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField3 s (e + 1) v1 v2) else (ctor Option.none [Request])))),
axioms: [Quot.sound, propext]
}
definition{
name: decodeField1,
parameters: [s : Bytes, start : Nat],
result: (Option Request),
body: (let e : Nat := (fieldEnd s start (Foundation.Bytes::byteLength s)); (match (parseVersion (sliceOf s start (prim subtract e start : Nat)))
| Option.none => (ctor Option.none [Request])
| Option.some v1 => (if (e <? (Foundation.Bytes::byteLength s)) then (decodeField2 s (e + 1) v1) else (ctor Option.none [Request])))),
axioms: [Quot.sound, propext]
}
definition{
name: rule1,
parameters: [request : Request],
result: Bool,
body: (not ((project request version) =? 1))
}
definition{
name: rule2,
parameters: [request : Request],
result: Bool,
body: ((project request operation) =? (operationOther))
}
definition{
name: rule3,
parameters: [request : Request],
result: Bool,
body: (((project request operation) =? (operationDivide)) && ((project request right) =? (rightZero)))
}
definition{
name: rule4,
parameters: [request : Request],
result: Bool,
body: ((project request range) =? (rangeBeyond))
}
definition{
name: judge,
parameters: [request : Request],
result: Nat,
body: (if (rule1 request) then (answerUnsupportedVersion) else (if (rule2 request) then (answerUnknownOperation) else (if (rule3 request) then (answerDivisionByZero) else (if (rule4 request) then (answerOverflow) else (answerOk)))))
}
definition{
name: encodeAnswer,
parameters: [code : Nat],
result: Bytes,
body: (if (code =? (answerOk)) then 0x6f6b else (if (code =? (answerOverflow)) then 0x6f766572666c6f77 else (if (code =? (answerDivisionByZero)) then 0x6469766973696f6e2d62792d7a65726f else (if (code =? (answerUnsupportedVersion)) then 0x756e737570706f727465642d76657273696f6e else (if (code =? (answerUnknownOperation)) then 0x756e6b6e6f776e2d6f7065726174696f6e else 0x696e76616c6964)))))
}
definition{
name: dispatch,
parameters: [value : Bytes],
result: Bytes,
body: (if (112 <? (Foundation.Bytes::byteLength value)) then 0x696e76616c6964 else (match (decodeField1 value 0)
| Option.none => 0x696e76616c6964
| Option.some request => (encodeAnswer (judge request)))),
axioms: [Quot.sound, propext]
}
definition{
name: application,
parameters: [],
result: Foundation.View.Text.V1.Model::TextApplication,
body: (record Foundation.View.Text.V1.Model::TextApplication {profile := "prismpm/text-application/1", name := "Calculator protocol", cargoName := "prism-calculator-protocol", cargoVersion := "0.1.0", cargoDescription := "Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed e", cargoRepository := "https://github.com/UOR-Foundation/PrismPM", cargoHomepage := "https://github.com/UOR-Foundation/PrismPM", libraryRoots := (cons "PrismCalculatorProtocol.CalculatorProtocol.dispatch" (nil String)), acceptanceVectors := (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120616464206e6f6e7a65726f2077697468696e, response := 0x6f6b}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120616464206e6f6e7a65726f206265796f6e64, response := 0x6f766572666c6f77}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120646976696465207a65726f2077697468696e, response := 0x6469766973696f6e2d62792d7a65726f}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120646976696465206e6f6e7a65726f206265796f6e64, response := 0x6f766572666c6f77}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3220616464206e6f6e7a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x31206f74686572206e6f6e7a65726f2077697468696e, response := 0x756e6b6e6f776e2d6f7065726174696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x31206d756c7469706c79207a65726f2077697468696e, response := 0x6f6b}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464207a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464207a65726f206265796f6e64, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464206e6f6e7a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464206e6f6e7a65726f206265796f6e64, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020646976696465207a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020646976696465207a65726f206265796f6e64, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020646976696465206e6f6e7a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020646976696465206e6f6e7a65726f206265796f6e64, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30206f74686572207a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30206f74686572207a65726f206265796f6e64, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30206f74686572206e6f6e7a65726f2077697468696e, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30206f74686572206e6f6e7a65726f206265796f6e64, response := 0x756e737570706f727465642d76657273696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120616464207a65726f2077697468696e, response := 0x6f6b}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120616464207a65726f206265796f6e64, response := 0x6f766572666c6f77}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120646976696465207a65726f206265796f6e64, response := 0x6469766973696f6e2d62792d7a65726f}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3120646976696465206e6f6e7a65726f2077697468696e, response := 0x6f6b}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x31206f74686572207a65726f2077697468696e, response := 0x756e6b6e6f776e2d6f7065726174696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x31206f74686572207a65726f206265796f6e64, response := 0x756e6b6e6f776e2d6f7065726174696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x31206f74686572206e6f6e7a65726f206265796f6e64, response := 0x756e6b6e6f776e2d6f7065726174696f6e}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0xff, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464207a65726f, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464207a65726f2077697468696e2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x30202061646420207a65726f202077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x303720616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x2d3120616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x2b3120616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3130303030303030303030303030303030303020616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0xd9a120616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7820616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x313020616464207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020756e6b6e6f776e207a65726f2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x302061646420756e6b6e6f776e2077697468696e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x3020616464207a65726f20756e6b6e6f776e, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x78787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (cons (record Foundation.View.Text.V1.Model::AcceptanceVector {request := 0x7878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878787878, response := 0x696e76616c6964}) (nil Foundation.View.Text.V1.Model::AcceptanceVector))))))))))))))))))))))))))))))))))))))))))))), entryRoot := "PrismCalculatorProtocol.CalculatorProtocol.dispatch", coreContract := "hologram:guest/core-wasm@1", requestMaximum := (112 : UInt32), responseMaximum := (64 : UInt32), guestAllocationMaximum := (224 : UInt32), capabilitiesEmpty := true, fatArchive := true, primaryLayer := (0 : UInt8), viewLayer := (1 : UInt8), view := (record Foundation.View.Text.V1.Model::TextView {title := "Calculator protocol", heading := "Calculator protocol", inputLabel := "Request: version operation right range", submitLabel := "Decide", outputLabel := "Answer", inputError := "Invalid request", responseError := "Invalid response"})})
}
\end{semanticmodule}
\end{lexlean}
app/src/CalculatorProtocolProofs.lex.tex 161 lines
\begin{lexlean}{CalculatorProtocolProofs}
\useglossary{lexlean.std.bool@1.2.0}
\useglossary{lexlean.std.nat@1.2.0}
\useglossary{prism.arch@1.0.0}
\importmodule{CalculatorProtocol}
\title{Text application model}
\begin{semanticmodule}
definition{
name: breaksInv001,
parameters: [request : CalculatorProtocol::Request],
result: Bool,
body: ((((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && ((project request operation) =? (CalculatorProtocol::operationDivide))) && ((project request right) =? (CalculatorProtocol::rightZero))) && ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerOk)))
}
theorem{
name: inv001Holds,
parameters: [request : CalculatorProtocol::Request],
statement: ((breaksInv001 request) = false),
proof: linear_arithmetic{
definitions: [
CalculatorProtocol::answerDivisionByZero,
CalculatorProtocol::answerOk,
CalculatorProtocol::answerOverflow,
CalculatorProtocol::answerUnknownOperation,
CalculatorProtocol::answerUnsupportedVersion,
CalculatorProtocol::judge,
CalculatorProtocol::operationAdd,
CalculatorProtocol::operationDivide,
CalculatorProtocol::operationMultiply,
CalculatorProtocol::operationOther,
CalculatorProtocol::operationSubtract,
CalculatorProtocol::rangeBeyond,
CalculatorProtocol::rangeWithin,
CalculatorProtocol::rightNonzero,
CalculatorProtocol::rightZero,
CalculatorProtocol::rule1,
CalculatorProtocol::rule2,
CalculatorProtocol::rule3,
CalculatorProtocol::rule4,
breaksInv001
]
},
axioms: [Classical.choice, Quot.sound, propext]
}
definition{
name: breaksInv002,
parameters: [request : CalculatorProtocol::Request],
result: Bool,
body: (((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && ((project request range) =? (CalculatorProtocol::rangeBeyond))) && ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerOk)))
}
theorem{
name: inv002Holds,
parameters: [request : CalculatorProtocol::Request],
statement: ((breaksInv002 request) = false),
proof: linear_arithmetic{
definitions: [
CalculatorProtocol::answerDivisionByZero,
CalculatorProtocol::answerOk,
CalculatorProtocol::answerOverflow,
CalculatorProtocol::answerUnknownOperation,
CalculatorProtocol::answerUnsupportedVersion,
CalculatorProtocol::judge,
CalculatorProtocol::operationAdd,
CalculatorProtocol::operationDivide,
CalculatorProtocol::operationMultiply,
CalculatorProtocol::operationOther,
CalculatorProtocol::operationSubtract,
CalculatorProtocol::rangeBeyond,
CalculatorProtocol::rangeWithin,
CalculatorProtocol::rightNonzero,
CalculatorProtocol::rightZero,
CalculatorProtocol::rule1,
CalculatorProtocol::rule2,
CalculatorProtocol::rule3,
CalculatorProtocol::rule4,
breaksInv002
]
},
axioms: [Quot.sound, propext]
}
definition{
name: breaksInv003,
parameters: [request : CalculatorProtocol::Request],
result: Bool,
body: (((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && (not ((project request version) =? 1))) && ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerOk)))
}
theorem{
name: inv003Holds,
parameters: [request : CalculatorProtocol::Request],
statement: ((breaksInv003 request) = false),
proof: linear_arithmetic{
definitions: [
CalculatorProtocol::answerDivisionByZero,
CalculatorProtocol::answerOk,
CalculatorProtocol::answerOverflow,
CalculatorProtocol::answerUnknownOperation,
CalculatorProtocol::answerUnsupportedVersion,
CalculatorProtocol::judge,
CalculatorProtocol::operationAdd,
CalculatorProtocol::operationDivide,
CalculatorProtocol::operationMultiply,
CalculatorProtocol::operationOther,
CalculatorProtocol::operationSubtract,
CalculatorProtocol::rangeBeyond,
CalculatorProtocol::rangeWithin,
CalculatorProtocol::rightNonzero,
CalculatorProtocol::rightZero,
CalculatorProtocol::rule1,
CalculatorProtocol::rule2,
CalculatorProtocol::rule3,
CalculatorProtocol::rule4,
breaksInv003
]
},
axioms: [Classical.choice, Quot.sound, propext]
}
definition{
name: breaksInv004,
parameters: [request : CalculatorProtocol::Request],
result: Bool,
body: ((((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && ((project request version) =? 1)) && ((project request operation) =? (CalculatorProtocol::operationOther))) && (not ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerUnknownOperation))))
}
theorem{
name: inv004Holds,
parameters: [request : CalculatorProtocol::Request],
statement: ((breaksInv004 request) = false),
proof: linear_arithmetic{
definitions: [
CalculatorProtocol::answerDivisionByZero,
CalculatorProtocol::answerOk,
CalculatorProtocol::answerOverflow,
CalculatorProtocol::answerUnknownOperation,
CalculatorProtocol::answerUnsupportedVersion,
CalculatorProtocol::judge,
CalculatorProtocol::operationAdd,
CalculatorProtocol::operationDivide,
CalculatorProtocol::operationMultiply,
CalculatorProtocol::operationOther,
CalculatorProtocol::operationSubtract,
CalculatorProtocol::rangeBeyond,
CalculatorProtocol::rangeWithin,
CalculatorProtocol::rightNonzero,
CalculatorProtocol::rightZero,
CalculatorProtocol::rule1,
CalculatorProtocol::rule2,
CalculatorProtocol::rule3,
CalculatorProtocol::rule4,
breaksInv004
]
},
axioms: [Classical.choice, Quot.sound, propext]
}
\end{semanticmodule}
\end{lexlean}
app/lexlean.toml 43 lines
spec = "lexlean/project/1"
name = "prism-calculator-protocol"
language = "1.2"
module_prefix = "PrismCalculatorProtocol"
source_roots = ["src"]
entrypoints = ["src/Architecture.lex.tex", "src/CalculatorProtocol.lex.tex", "src/CalculatorProtocolProofs.lex.tex", "src/Compliance.lex.tex", "src/Design.lex.tex", "src/Features.lex.tex", "src/Quality.lex.tex", "src/Security.lex.tex"]
build_root = ".lexlean"
lockfile = "lexlean.lock"
lean_workspace = "."
lean_toolchain = "leanprover/lean4:v4.32.1"
[[lexicon_source]]
package = "lexlean.std.nat"
kind = "builtin"
[[lexicon_source]]
package = "prism.arch"
kind = "path"
path = "language/prism.arch"
[[lexicon_source]]
package = "prism.qual"
kind = "path"
path = "language/prism.qual"
[[lexicon_source]]
package = "prism.sec"
kind = "path"
path = "language/prism.sec"
[limits]
max_file_bytes = 4194304
max_total_source_bytes = 67108864
max_primitive_atoms = 2000000
max_token_lattice_edges = 4000000
max_parse_states = 4000000
max_ir_nodes = 2000000
max_scope_depth = 1024
max_import_depth = 128
max_diagnostics = 256
max_child_output_bytes = 16777216
child_timeout_ms = 300000
app/prompt.json 359 lines
{
"schema": "prism/prompt/1",
"pattern": "decisionTable",
"goal": "Sort a Calculator request by the kind of answer it gets. A bad, unknown or too-large request never gets a number back.",
"repository": "UOR-Foundation/calculator-example",
"app": {
"name": "calculator-protocol",
"title": "Calculator protocol",
"purpose": "Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers.",
"fields": [
{
"name": "version",
"kind": "number",
"min": 0,
"max": 9,
"means": "the protocol version the request names; the product speaks version 1"
},
{
"name": "operation",
"kind": "choice",
"values": [
"add",
"subtract",
"multiply",
"divide",
"other"
],
"means": "the operation name; other is any name the protocol does not define, such as mod"
},
{
"name": "right",
"kind": "choice",
"values": [
"zero",
"nonzero"
],
"means": "whether the right operand is 0"
},
{
"name": "range",
"kind": "choice",
"values": [
"within",
"beyond"
],
"means": "whether the exact mathematical result lies within the signed 64-bit range"
}
],
"outcomes": [
"ok",
"overflow",
"division-by-zero",
"unsupported-version",
"unknown-operation"
],
"meanings": {
"ok": "1 ok and the exact result",
"overflow": "1 error overflow: the CalculatorError Overflow",
"division-by-zero": "1 error division-by-zero: the CalculatorError DivisionByZero",
"unsupported-version": "1 error unsupported-version: the ProtocolError UnsupportedVersion",
"unknown-operation": "1 error unknown-operation: the ProtocolError UnknownOperation"
},
"rules": [
{
"when": [
{
"field": "version",
"op": "!=",
"value": 1
}
],
"then": "unsupported-version",
"why": "src/Calculator.lex.tex: decodeRequest refuses any version but 1 with ProtocolError UnsupportedVersion (vector 2 add 1 2)"
},
{
"when": [
{
"field": "operation",
"op": "is",
"value": "other"
}
],
"then": "unknown-operation",
"why": "src/Calculator.lex.tex: parseOperation knows only Add, Subtract, Multiply and Divide; anything else is ProtocolError UnknownOperation (vector 1 mod 1 2)"
},
{
"when": [
{
"field": "operation",
"op": "is",
"value": "divide"
},
{
"field": "right",
"op": "is",
"value": "zero"
}
],
"then": "division-by-zero",
"why": "src/Calculator.lex.tex: calculate answers CalculatorError DivisionByZero for a zero divisor (vector 1 divide 1 0)"
},
{
"when": [
{
"field": "range",
"op": "is",
"value": "beyond"
}
],
"then": "overflow",
"why": "src/Calculator.lex.tex: checkedResult answers CalculatorError Overflow outside the i64 range (vectors at 9223372036854775807 and -9223372036854775808)"
}
],
"otherwise": "ok",
"otherwiseWhy": "src/Calculator.lex.tex: calculate_correct proves the exact result is returned when it is in range",
"properties": [
{
"kind": "never",
"when": [
{
"field": "operation",
"op": "is",
"value": "divide"
},
{
"field": "right",
"op": "is",
"value": "zero"
}
],
"then": "ok",
"why": "a division by zero has no result"
},
{
"kind": "never",
"when": [
{
"field": "range",
"op": "is",
"value": "beyond"
}
],
"then": "ok",
"why": "a result outside i64 is never wrapped or truncated"
},
{
"kind": "never",
"when": [
{
"field": "version",
"op": "!=",
"value": 1
}
],
"then": "ok",
"why": "an unsupported version is never interpreted as version 1"
},
{
"kind": "always",
"when": [
{
"field": "version",
"op": "=",
"value": 1
},
{
"field": "operation",
"op": "is",
"value": "other"
}
],
"then": "unknown-operation",
"why": "an undefined operation is a typed protocol error"
}
],
"examples": [
{
"request": "1 add nonzero within",
"response": "ok"
},
{
"request": "1 add nonzero beyond",
"response": "overflow"
},
{
"request": "1 divide zero within",
"response": "division-by-zero"
},
{
"request": "1 divide nonzero beyond",
"response": "overflow"
},
{
"request": "2 add nonzero within",
"response": "unsupported-version"
},
{
"request": "1 other nonzero within",
"response": "unknown-operation"
},
{
"request": "1 multiply zero within",
"response": "ok"
}
]
},
"stakeholders": [
{
"name": "Calculator user",
"text": "Enters two operands and an operation in the Pages view and needs an exact result or a typed error, never a wrapped number.",
"concerns": [
"Correct answers",
"Proved guarantees"
]
},
{
"name": "Service operator",
"text": "Runs the A/B service releases and needs every protocol error typed and covered by a negative vector.",
"concerns": [
"Refused malformed requests",
"Proved guarantees"
]
}
],
"components": [
{
"name": "Calculator Pages view",
"text": "The portable Pages application at https://uor-foundation.github.io/calculator-example/.",
"kind": "staticSite"
},
{
"name": "Calculator service release",
"text": "The A and B service releases prismpm pushes, deploys and rolls back.",
"kind": "service"
}
],
"threats": [
{
"name": "Silent overflow",
"text": "An out-of-range sum or product is wrapped and answered as ok.",
"stride": "tampering",
"asset": "answer",
"likelihood": "medium",
"impact": "critical",
"control": {
"name": "Checked result",
"text": "A result beyond i64 is answered overflow.",
"evidence": [
{
"kind": "proof",
"reference": "CalculatorProtocolProofs::inv002Holds"
},
{
"kind": "gate",
"reference": "UOR-Foundation/calculator-example src/Calculator.lex.tex acceptance vectors at the i64 bounds"
}
]
}
},
{
"name": "Division by zero answered",
"text": "A zero divisor yields a number or a trap instead of a typed error.",
"stride": "denialOfService",
"asset": "answer",
"likelihood": "medium",
"impact": "major",
"control": {
"name": "Typed division error",
"text": "A zero divisor is answered division-by-zero.",
"evidence": [
{
"kind": "proof",
"reference": "CalculatorProtocolProofs::inv001Holds"
}
]
}
},
{
"name": "Version downgrade",
"text": "A client sends another protocol version hoping it is read as version 1.",
"stride": "spoofing",
"asset": "request",
"likelihood": "low",
"impact": "major",
"control": {
"name": "Only version 1",
"text": "Any version but 1 is unsupported-version.",
"evidence": [
{
"kind": "proof",
"reference": "CalculatorProtocolProofs::inv003Holds"
}
]
}
}
],
"quality": [
{
"characteristic": "Functional suitability",
"subcharacteristic": "Functional completeness",
"requirement": "Every operation modeled",
"text": "Each of the four Operation constructors is a value of the operation field.",
"measure": "Operations modeled",
"measureText": "Operation constructors of src/Calculator.lex.tex the app distinguishes.",
"threshold": 4
},
{
"characteristic": "Reliability",
"subcharacteristic": "Fault tolerance",
"requirement": "Every error typed",
"text": "Every CalculatorError and every ProtocolError but MalformedRequest, which the decoder answers invalid, is an answer.",
"measure": "Untyped errors",
"measureText": "Error constructors with no answer and no invalid refusal.",
"threshold": 0
}
],
"journeys": [
{
"stakeholder": "Calculator user",
"steps": [
"otherwise",
"REQ-003",
"REQ-004",
"INV-001",
"INV-002"
]
},
{
"stakeholder": "Service operator",
"steps": [
"REQ-001",
"REQ-002",
"INV-003",
"INV-004",
"refuse"
]
}
],
"axioms": {
"inv001Holds": [
"Classical.choice",
"Quot.sound",
"propext"
],
"inv003Holds": [
"Classical.choice",
"Quot.sound",
"propext"
],
"inv004Holds": [
"Classical.choice",
"Quot.sound",
"propext"
]
},
"concerns": [],
"license": "MIT OR Apache-2.0"
}
model/ids.toml 65 lines
# model/ids.toml --- the conformance ID register.
#
# Every ID this repository claims, in one place, so that nothing is referenced
# without being defined. `CONFORMANCE.md` is generated from this file. A test
# whose name ends in an ID not listed here fails `check-model`, and an ID listed
# here with no scenario and no test fails it too (CM-02).
#
# `level` is the honesty level (R2):
# some-true a fact reproduced from an authority; not established here
# build constructed here and validated against its oracle
# open measured and reported, never asserted
#
# Every row here has a scenario in `features/suites/` and a test whose name ends
# in the ID, lowercased with underscores (R3, CM-02). There is no "pending"
# state: a capability that is not built does not get a row, and every row in this
# file is built.
#
# The first row is the template's own Prism application in `app/` (TC-01).
# A capability starts with a row here; `just new-capability` writes the row,
# its scenario and its failing test in the order `AGENTS.md` sets out.
spec = "template/1"
[[id]]
id = "CP-01"
level = "build"
suite = "calculator_protocol"
statement = "The app never answers ok when operation is divide and right is zero"
[[id]]
id = "CP-02"
level = "build"
suite = "calculator_protocol"
statement = "The app never answers ok when range is beyond"
[[id]]
id = "CP-03"
level = "build"
suite = "calculator_protocol"
statement = "The app never answers ok when version differs from 1"
[[id]]
id = "CP-04"
level = "build"
suite = "calculator_protocol"
statement = "The app always answers unknown-operation when version equals 1 and operation is other"
[[id]]
id = "CP-05"
level = "build"
suite = "calculator_protocol"
statement = "The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references"
[[id]]
id = "CP-06"
level = "build"
suite = "calculator_protocol"
statement = "The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared"
[[id]]
id = "CP-07"
level = "build"
suite = "calculator_protocol"
statement = "Every compliance obligation is numbered in order and names its evidence"
features/suites/calculator_protocol.feature 44 lines
Feature: calculator_protocol
This repository's Prism application, in app/, generated by prism-code from its
spec: Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers.
@CP-01 @build
Scenario: The app never answers ok when operation is divide and right is zero
Given the model in app/src/CalculatorProtocol.lex.tex
When the Lean kernel checks inv001Holds during prismpm verify
Then no request meets breaksInv001
@CP-02 @build
Scenario: The app never answers ok when range is beyond
Given the model in app/src/CalculatorProtocol.lex.tex
When the Lean kernel checks inv002Holds during prismpm verify
Then no request meets breaksInv002
@CP-03 @build
Scenario: The app never answers ok when version differs from 1
Given the model in app/src/CalculatorProtocol.lex.tex
When the Lean kernel checks inv003Holds during prismpm verify
Then no request meets breaksInv003
@CP-04 @build
Scenario: The app always answers unknown-operation when version equals 1 and operation is other
Given the model in app/src/CalculatorProtocol.lex.tex
When the Lean kernel checks inv004Holds during prismpm verify
Then no request meets breaksInv004
@CP-05 @build
Scenario: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
Given the model in app/src/Architecture.lex.tex
When the Lean kernel checks architectureDescriptionHolds during prismpm verify
Then the architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
@CP-06 @build
Scenario: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
Given the model in app/src/Quality.lex.tex
When the Lean kernel checks qualityModelHolds during prismpm verify
Then the ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
@CP-07 @build
Scenario: Every compliance obligation is numbered in order and names its evidence
Given the model in app/src/Compliance.lex.tex
When the Lean kernel checks everyObligationEvidenced during prismpm verify
Then every compliance obligation is numbered in order and names its evidence
crates/conformance/tests/calculator_protocol.rs 132 lines
//! The `calculator_protocol` suite: one test per scenario in `features/suites/calculator_protocol.feature`.
//!
//! Written by the Prism-DevRel builder from the app's prompt. The theorems are
//! checked by the Lean kernel when `just vv` runs `prismpm verify` on `app/`.
//! What these tests hold fixed is what each theorem is about, so a weakened
//! statement that still verifies fails the gate.
use std::path::PathBuf;
fn root() -> PathBuf {
PathBuf::from(env!("CARGO_MANIFEST_DIR"))
.ancestors()
.nth(2)
.expect("crates/conformance is two below the root")
.to_path_buf()
}
/// The body of the top-level declaration named `name`, up to its closing brace.
fn declaration<'a>(model: &'a str, name: &str) -> &'a str {
let start = model
.find(&format!("\n name: {name},\n"))
.unwrap_or_else(|| panic!("{name} is not declared"));
let end = model[start..]
.find("\n}\n")
.unwrap_or_else(|| panic!("{name} is not closed"));
&model[start..start + end]
}
fn module(path: &str) -> String {
std::fs::read_to_string(root().join(path)).expect("the module")
}
/// The condition no request may meet, and the theorem that says none does.
fn pinned(breaks: &str, condition: &str, theorem: &str) {
let model = module("app/src/CalculatorProtocolProofs.lex.tex");
let found = declaration(&model, breaks);
assert!(
found.contains(condition),
"the condition of {breaks} changed:\n{found}"
);
let holds = declaration(&model, theorem);
let statement = format!("statement: (({breaks} request) = false),");
assert!(
holds.contains(&statement),
"{theorem} must state that no request meets {breaks}:\n{holds}"
);
}
/// A facet theorem: proved by `decide`, about exactly this predicate.
fn holds(path: &str, theorem: &str, statement: &str) {
let model = module(path);
let found = declaration(&model, theorem);
assert!(
found.contains(&format!("statement: {statement},")),
"{theorem} must state {statement}:\n{found}"
);
assert!(
found.contains("proof: decide{}"),
"{theorem} is proved by decide"
);
}
/// `CP-01`: The app never answers ok when operation is divide and right is zero
#[test]
fn calculator_protocol_cp_01() {
pinned(
"breaksInv001",
"body: ((((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && ((project request operation) =? (CalculatorProtocol::operationDivide))) && ((project request right) =? (CalculatorProtocol::rightZero))) && ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerOk)))",
"inv001Holds",
);
}
/// `CP-02`: The app never answers ok when range is beyond
#[test]
fn calculator_protocol_cp_02() {
pinned(
"breaksInv002",
"body: (((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && ((project request range) =? (CalculatorProtocol::rangeBeyond))) && ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerOk)))",
"inv002Holds",
);
}
/// `CP-03`: The app never answers ok when version differs from 1
#[test]
fn calculator_protocol_cp_03() {
pinned(
"breaksInv003",
"body: (((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && (not ((project request version) =? 1))) && ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerOk)))",
"inv003Holds",
);
}
/// `CP-04`: The app always answers unknown-operation when version equals 1 and operation is other
#[test]
fn calculator_protocol_cp_04() {
pinned(
"breaksInv004",
"body: ((((((((project request version) <=? 9) && ((project request operation) <? 5)) && ((project request right) <? 2)) && ((project request range) <? 2)) && ((project request version) =? 1)) && ((project request operation) =? (CalculatorProtocol::operationOther))) && (not ((CalculatorProtocol::judge request) =? (CalculatorProtocol::answerUnknownOperation))))",
"inv004Holds",
);
}
/// `CP-05`: The architecture description declares every stakeholder, concern, component, edge, viewpoint and view it references
#[test]
fn calculator_protocol_cp_05() {
holds(
"app/src/Architecture.lex.tex",
"architectureDescriptionHolds",
"((architectureValid) = true)",
);
}
/// `CP-06`: The ISO/IEC 25010 quality model numbers every characteristic, subcharacteristic, requirement and measure, and every parent it names is declared
#[test]
fn calculator_protocol_cp_06() {
holds(
"app/src/Quality.lex.tex",
"qualityModelHolds",
"((qualityValid) = true)",
);
}
/// `CP-07`: Every compliance obligation is numbered in order and names its evidence
#[test]
fn calculator_protocol_cp_07() {
holds(
"app/src/Compliance.lex.tex",
"everyObligationEvidenced",
"((obligationsEvidenced 0 (obligations)) = true)",
);
}
site/app.json 115 lines
{
"name": "Calculator protocol",
"shortName": "Calculator",
"live": "https://uor-foundation.github.io/calculator-example/",
"purpose": "Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers. Send version, operation, right or range, separated by spaces; it answers ok, overflow, division-by-zero, unsupported-version or unknown-operation, and invalid request for anything else.",
"inputLabel": "Request: version operation right range",
"placeholder": "1 add nonzero within",
"submitLabel": "Decide",
"outputLabel": "Answer",
"answers": {
"positive": [
"ok"
],
"negative": [
"overflow",
"division-by-zero",
"unsupported-version",
"unknown-operation"
],
"refusal": "invalid request"
},
"promise": {
"headline": "Says conformant exactly when every policy file matches its lock.",
"detail": "Each of the six universal policy files is compared with the digest the lock records, and any file that drifted is named."
},
"claim": "CP-01: the app never answers ok when operation is divide and right is zero. CP-02: the app never answers ok when range is beyond. CP-03: the app never answers ok when version differs from 1. CP-04: the app always answers unknown-operation when version equals 1 and operation is other.",
"proposition": {
"name": "judge",
"text": "judge request :=\n version differs from 1 → unsupported-version\n operation is other → unknown-operation\n operation is divide and right is zero → division-by-zero\n range is beyond → overflow\n otherwise → ok",
"plain": "Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers."
},
"theorems": [
{
"name": "inv001Holds",
"statement": "no request meets breaksInv001: the app never answers ok when operation is divide and right is zero",
"how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
"where": "app/src/CalculatorProtocolProofs.lex.tex"
},
{
"name": "inv002Holds",
"statement": "no request meets breaksInv002: the app never answers ok when range is beyond",
"how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
"where": "app/src/CalculatorProtocolProofs.lex.tex"
},
{
"name": "inv003Holds",
"statement": "no request meets breaksInv003: the app never answers ok when version differs from 1",
"how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
"where": "app/src/CalculatorProtocolProofs.lex.tex"
},
{
"name": "inv004Holds",
"statement": "no request meets breaksInv004: the app always answers unknown-operation when version equals 1 and operation is other",
"how": "Proved by linear arithmetic, checked by the Lean kernel on the UOR MCP server and again by prismpm verify in CI",
"where": "app/src/CalculatorProtocolProofs.lex.tex"
}
],
"pinned": [
{
"name": "calculator_protocol_cp_01",
"what": "CP-01's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
"where": "crates/conformance/tests/calculator_protocol.rs"
},
{
"name": "calculator_protocol_cp_02",
"what": "CP-02's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
"where": "crates/conformance/tests/calculator_protocol.rs"
},
{
"name": "calculator_protocol_cp_03",
"what": "CP-03's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
"where": "crates/conformance/tests/calculator_protocol.rs"
},
{
"name": "calculator_protocol_cp_04",
"what": "CP-04's condition and the theorem that no request meets it. A string-matching test, not a theorem: a planted defect fails it.",
"where": "crates/conformance/tests/calculator_protocol.rs"
}
],
"trusted": [
{
"name": "SDK image",
"value": "the digest prismpm.lock pins; see the bootstrap workflow's log"
},
{
"name": "Lean toolchain",
"value": "leanprover/lean4:v4.32.1"
},
{
"name": "LexLean compiler semantics",
"value": "5262e5b4c8b5668ae7066ad686757a6bb7f80c941d515fb9d586894fbc7de69a"
},
{
"name": "prism-code runtime, vendored",
"value": "0.2.0, see try/vendor/prism-code/VENDOR.md"
},
{
"name": "Your browser",
"value": "runs the WebAssembly guest and this page"
}
],
"attestations": {
"proof": {
"id": "not recorded: the proof ran in the SDK image, not on the UOR MCP server",
"url": "https://github.com/UOR-Foundation/calculator-example/actions/workflows/bootstrap.yml"
},
"build": {
"id": "printed by prismpm verify in every pages run",
"url": "https://github.com/UOR-Foundation/calculator-example/actions/workflows/pages.yml"
}
},
"repository": "https://github.com/UOR-Foundation/calculator-example",
"report": "https://github.com/UOR-Foundation/calculator-example/blob/main/TEMPLATE-VERIFICATION.md"
}
openspec/specs/calculator-protocol/spec.md 174 lines
# calculator-protocol Specification
<!-- Generated by Prism from prism/spec.json. Change the app through your agent with /prism, not by editing this file. -->
## Purpose
Calculator protocol: Classify one Calculator protocol request, from its protocol version, its operation, whether the right operand is zero and whether the exact result fits a signed 64-bit integer, as ok or as the typed error the reference product answers.
## Requirements
### Requirement: Never ok when operation is divide and right is zero
The app SHALL NOT answer `ok` when operation is divide and right is zero, because a division by zero has no result.
Verified: to be proved by Lean for every request (INV-001, theorem `inv001Holds`).
#### Scenario: INV-001 holds
- **WHEN** the request is `1 divide zero within` (an acceptance example)
- **THEN** the answer SHALL NOT be `ok`
- **AND** the app answers `division-by-zero`, decided by REQ-003
### Requirement: Never ok when range is beyond
The app SHALL NOT answer `ok` when range is beyond, because a result outside i64 is never wrapped or truncated.
Verified: to be proved by Lean for every request (INV-002, theorem `inv002Holds`).
#### Scenario: INV-002 holds
- **WHEN** the request is `1 add nonzero beyond` (an acceptance example)
- **THEN** the answer SHALL NOT be `ok`
- **AND** the app answers `overflow`, decided by REQ-004
### Requirement: Never ok when version differs from 1
The app SHALL NOT answer `ok` when version differs from 1, because an unsupported version is never interpreted as version 1.
Verified: to be proved by Lean for every request (INV-003, theorem `inv003Holds`).
#### Scenario: INV-003 holds
- **WHEN** the request is `2 add nonzero within` (an acceptance example)
- **THEN** the answer SHALL NOT be `ok`
- **AND** the app answers `unsupported-version`, decided by REQ-001
### Requirement: Always unknown-operation when version equals 1 and operation is other
The app SHALL answer `unknown-operation` when version equals 1 and operation is other, because an undefined operation is a typed protocol error.
Verified: to be proved by Lean for every request (INV-004, theorem `inv004Holds`).
#### Scenario: INV-004 holds
- **WHEN** the request is `1 other nonzero within` (an acceptance example)
- **THEN** the answer SHALL be `unknown-operation`
- **AND** the app answers `unknown-operation`, decided by REQ-002
### Requirement: REQ-001 unsupported-version when version differs from 1
The app SHALL answer `unsupported-version` when version differs from 1, because src/Calculator.lex.tex: decodeRequest refuses any version but 1 with ProtocolError UnsupportedVersion (vector 2 add 1 2).
Verified: tested by the acceptance vectors (`rule1`).
#### Scenario: REQ-001 decides
- **WHEN** the request is `2 add nonzero within` (an acceptance example)
- **THEN** the answer SHALL be `unsupported-version`, decided by REQ-001
### Requirement: REQ-002 unknown-operation when operation is other
The app SHALL answer `unknown-operation` when operation is other and no earlier rule matches, because src/Calculator.lex.tex: parseOperation knows only Add, Subtract, Multiply and Divide; anything else is ProtocolError UnknownOperation (vector 1 mod 1 2).
Verified: tested by the acceptance vectors (`rule2`).
#### Scenario: REQ-002 decides
- **WHEN** the request is `1 other nonzero within` (an acceptance example)
- **THEN** the answer SHALL be `unknown-operation`, decided by REQ-002
### Requirement: REQ-003 division-by-zero when operation is divide and right is zero
The app SHALL answer `division-by-zero` when operation is divide and right is zero and no earlier rule matches, because src/Calculator.lex.tex: calculate answers CalculatorError DivisionByZero for a zero divisor (vector 1 divide 1 0).
Verified: tested by the acceptance vectors (`rule3`).
#### Scenario: REQ-003 decides
- **WHEN** the request is `1 divide zero within` (an acceptance example)
- **THEN** the answer SHALL be `division-by-zero`, decided by REQ-003
### Requirement: REQ-004 overflow when range is beyond
The app SHALL answer `overflow` when range is beyond and no earlier rule matches, because src/Calculator.lex.tex: checkedResult answers CalculatorError Overflow outside the i64 range (vectors at 9223372036854775807 and -9223372036854775808).
Verified: tested by the acceptance vectors (`rule4`).
#### Scenario: REQ-004 decides
- **WHEN** the request is `1 add nonzero beyond` (an acceptance example)
- **THEN** the answer SHALL be `overflow`, decided by REQ-004
### Requirement: Otherwise ok
The app SHALL answer `ok` when no rule matches, because src/Calculator.lex.tex: calculate_correct proves the exact result is returned when it is in range.
Verified: tested by the acceptance vectors.
#### Scenario: No rule matches
- **WHEN** the request is `1 add nonzero within` (an acceptance example)
- **THEN** the answer SHALL be `ok`
### Requirement: The first matching rule decides
The app SHALL try REQ-001, REQ-002, REQ-003, REQ-004 in that order, and the first rule that matches SHALL decide.
Verified: tested by the acceptance vectors.
#### Scenario: Two rules match
- **WHEN** the request is `0 add zero beyond`
- **THEN** the answer SHALL be `unsupported-version`, decided by REQ-001, the earlier rule
### Requirement: Request and answers
The app SHALL read one request as one line of 4 fields separated by single spaces, in this order, and SHALL answer exactly one of `ok`, `overflow`, `division-by-zero`, `unsupported-version`, `unknown-operation`, or `invalid` for anything else.
| Field | Accepts | Means |
| --- | --- | --- |
| `version` | whole number from 0 up to 9 | the protocol version the request names; the product speaks version 1 |
| `operation` | `add`, `subtract`, `multiply`, `divide`, `other` | the operation name; other is any name the protocol does not define, such as mod |
| `right` | `zero`, `nonzero` | whether the right operand is 0 |
| `range` | `within`, `beyond` | whether the exact mathematical result lies within the signed 64-bit range |
| Answer | Means |
| --- | --- |
| `ok` | 1 ok and the exact result |
| `overflow` | 1 error overflow: the CalculatorError Overflow |
| `division-by-zero` | 1 error division-by-zero: the CalculatorError DivisionByZero |
| `unsupported-version` | 1 error unsupported-version: the ProtocolError UnsupportedVersion |
| `unknown-operation` | 1 error unknown-operation: the ProtocolError UnknownOperation |
| `invalid` | the request is malformed |
Verified: reading a request is tested, not proved.
#### Scenario: A malformed request is invalid
- **WHEN** the request is not 4 fields in this order
- **THEN** the answer SHALL be `invalid`
## Examples
- `1 add nonzero within` gives `ok`
- `1 add nonzero beyond` gives `overflow`
- `1 divide zero within` gives `division-by-zero`
- `1 divide nonzero beyond` gives `overflow`
- `2 add nonzero within` gives `unsupported-version`
- `1 other nonzero within` gives `unknown-operation`
- `1 multiply zero within` gives `ok`
## What is proved and what is tested
Lean proves each property marked proved above, for every request that decodes, with no exceptions and no sampling. The proof is about `judge`, the function the WebAssembly guest runs, because both come from the same model.
The parsing of requests is tested, not proved: the acceptance vectors in the app replay through the built guest, including malformed and oversized requests.
Nothing here says the rules are the right rules. That is the part only you can judge.
## Files
- `prism/spec.json` is this spec as data.
- `src/CalculatorProtocol.lex.tex` is the LexLean model generated from it. It is the single source of the app.
Words on this page 6
- record
- One entry in a facet: a component, a threat, a measure or a journey step, with the place in the source it came from.
- Lean kernel
- The small checker at the heart of the Lean prover. It accepts a proof only if every step follows the rules.
- theorem
- A statement about the model that the Lean kernel has checked, so it holds for every input, not only the ones tested.
- SDK
- Software development kit. Here, the PrismPM container image that builds, checks and verifies Prism models.
- stakeholder
- A person or group with an interest in the system, as ISO/IEC/IEEE 42010 defines it.
- decision table
- A table of rules, as in OMG DMN 1.5: each row says which inputs lead to which outcome.