Track B: Automata, Logic, Semantics and Theory of Programming
E433422
Track B: Automata, Logic, Semantics and Theory of Programming is a main research track of the International Colloquium on Automata, Languages and Programming focusing on theoretical foundations of computation, programming languages, and formal methods.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Track B: Automata, Logic, Semantics and Theory of Programming canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4348676 — 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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Track B: Automata, Logic, Semantics and Theory of Programming Context triple: [International Colloquium on Automata, Languages and Programming, hasTrack, Track B: Automata, Logic, Semantics and Theory of Programming]
-
A.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
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.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
D.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
E.
Program Verification: Approaches and Tools
"Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Track B: Automata, Logic, Semantics and Theory of Programming Target entity description: Track B: Automata, Logic, Semantics and Theory of Programming is a main research track of the International Colloquium on Automata, Languages and Programming focusing on theoretical foundations of computation, programming languages, and formal methods.
-
A.
The Logic of Computer Programming
The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
-
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.
Logical Methods in Computer Science
Logical Methods in Computer Science is a peer-reviewed open-access journal focusing on theoretical computer science, particularly logic and its applications to computer science.
-
D.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
E.
Program Verification: Approaches and Tools
"Program Verification: Approaches and Tools" is a foundational work in computer science that systematically presents methods and practical techniques for proving the correctness of software programs.
- F. None of above. chosen
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
conference track
ⓘ
research track ⓘ |
| associatedWith | ICALP NERFINISHED ⓘ |
| audience |
researchers in formal methods
ⓘ
researchers in programming languages ⓘ researchers in theoretical computer science ⓘ |
| eventType | academic conference track ⓘ |
| field | theoretical computer science ⓘ |
| focusesOn |
abstract interpretation
ⓘ
automata on infinite objects ⓘ automata theory ⓘ computational logic ⓘ concurrency theory ⓘ denotational semantics ⓘ formal methods ⓘ formal specification ⓘ game semantics ⓘ higher-order computation ⓘ lambda calculus ⓘ logic and automata connections ⓘ logic in computer science ⓘ logical methods in program construction ⓘ model checking ⓘ operational semantics ⓘ process calculi ⓘ program logics ⓘ program verification ⓘ proof theory in computer science ⓘ semantics of programming languages ⓘ semantics-based program analysis ⓘ temporal logics ⓘ theoretical foundations of computation ⓘ theory of programming ⓘ type systems ⓘ verification of concurrent and distributed systems ⓘ verification of infinite-state systems ⓘ |
| hasLetter | B ⓘ |
| language | English ⓘ |
| partOf | International Colloquium on Automata, Languages and Programming NERFINISHED ⓘ |
| relatedTo |
Track A: Algorithms, Complexity and Games
NERFINISHED
ⓘ
Track C: Foundations of Networked Computation NERFINISHED ⓘ |
| shortName | Track B ⓘ |
| topicOf | research papers ⓘ |
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.
Instruction
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.
Input
Subject: Track B: Automata, Logic, Semantics and Theory of Programming Description of subject: Track B: Automata, Logic, Semantics and Theory of Programming is a main research track of the International Colloquium on Automata, Languages and Programming focusing on theoretical foundations of computation, programming languages, and formal methods.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
International Colloquium on Automata, Languages and Programming
→
hasTrack
→
Track B: Automata, Logic, Semantics and Theory of Programming
ⓘ