semantics of C in Isabelle/HOL
E850682
The "semantics of C in Isabelle/HOL" is a formal, machine-checked specification of the C programming language within the Isabelle/HOL proof assistant, used to rigorously verify C programs and systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| semantics of C in Isabelle/HOL canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10216161 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: semantics of C in Isabelle/HOL Context triple: [Gerwin Klein, contributedTo, semantics of C in Isabelle/HOL]
-
A.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
B.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
C.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
D.
Isabelle/ML
Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
-
E.
Isar proof language
The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: semantics of C in Isabelle/HOL Target entity description: The "semantics of C in Isabelle/HOL" is a formal, machine-checked specification of the C programming language within the Isabelle/HOL proof assistant, used to rigorously verify C programs and systems.
-
A.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
B.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
C.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
D.
Isabelle/ML
Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
-
E.
Isar proof language
The Isar proof language is a human-readable, structured language for writing formal proofs within the Isabelle/HOL proof assistant.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
Isabelle/HOL development
ⓘ
formal semantics ⓘ machine-checked specification ⓘ |
| aimsTo |
enable end-to-end verification from C source to implementation
ⓘ
model realistic C code used in systems software ⓘ |
| belongsTo | Isabelle/HOL ecosystem ⓘ |
| defines |
operational semantics for C constructs
ⓘ
state transition rules for C execution ⓘ |
| enables |
linking C-level proofs with higher-level specifications
ⓘ
proofs of absence of certain runtime errors ⓘ proofs of functional correctness of C programs ⓘ proofs of memory safety properties ⓘ |
| formalisedIn | Isabelle/HOL NERFINISHED ⓘ |
| hasComponent |
C expression semantics
ⓘ
C memory model NERFINISHED ⓘ C statement semantics ⓘ type system model for C ⓘ |
| hasProperty |
deep embedding of C
ⓘ
executable semantics ⓘ machine-checked ⓘ mechanised ⓘ supports automation ⓘ supports interactive proofs ⓘ |
| isPartOf | C verification environment in Isabelle/HOL ⓘ |
| models |
C arrays
ⓘ
C pointers ⓘ C structs ⓘ C unions ⓘ control flow in C ⓘ integer arithmetic in C ⓘ |
| relatedTo |
C verification framework in Isabelle
NERFINISHED
ⓘ
Hoare logic for C in Isabelle NERFINISHED ⓘ Isabelle C parser NERFINISHED ⓘ |
| represents | C programs as Isabelle/HOL datatypes ⓘ |
| supports |
Hoare logic reasoning for C
ⓘ
machine-checked proofs ⓘ refinement proofs ⓘ symbolic execution of C programs ⓘ verification condition generation ⓘ |
| targetsLanguage | C programming language NERFINISHED ⓘ |
| usedBy |
formal methods researchers
ⓘ
systems verification engineers ⓘ |
| usedFor |
formal reasoning about C code
ⓘ
verification of C programs ⓘ verification of operating systems ⓘ verification of systems software ⓘ |
| usedIn |
seL4 microkernel verification
ⓘ
verification of safety-critical software ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: semantics of C in Isabelle/HOL Description of subject: The "semantics of C in Isabelle/HOL" is a formal, machine-checked specification of the C programming language within the Isabelle/HOL proof assistant, used to rigorously verify C programs and systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.