Büchi, Lindenbaum, Tarski: A Program Analysis Appetizer
Authors: Vijay D’Silva, Caterina Urban
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We describe a research programme to establish precise, mathematical correspondences between these approaches and to develop new analyzers using these results. The theoretical tools we use are the theorems of B uchi that relate automata and logic and a construction of Lindenbaum and Tarski for generating lattices from logics. |
| Researcher Affiliation | Collaboration | Vijay D Silva Google Inc., San Francisco; Caterina Urban ETH Z urich, Zurich |
| Pseudocode | No | The paper contains logical formulas and tables, but no structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any explicit statements about releasing source code or links to a code repository for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not describe experiments using datasets, thus no information on dataset availability is provided. |
| Dataset Splits | No | The paper is theoretical and does not present empirical experiments, so it does not discuss dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper describes theoretical research and does not mention any specific hardware used for experiments. |
| Software Dependencies | No | The paper describes theoretical concepts related to program analysis but does not specify any software dependencies with version numbers. |
| Experiment Setup | No | The paper describes theoretical research and does not include details on an experimental setup or hyperparameters. |