Year: 1999
Type: conference-paper
Abstract: To verify hardware designs by model checking, circuit specifications are commonly expressed in the temporal logic CTL. Automatic conversion of English to CTL requires the definition of an appropriately restricted subset of English. We show how the limited semantic expressibility of CTL can be exploited to derive a hierarchy of subsets. Our strategy avoids potential difficulties with approaches that take existing computational semantic analyses of English as their starting point---such as the need to ensure that all sentences in the subset possess a CTL translation.
Authors: Alexander Holt, Ewan Klein
Institution: University of Edinburgh
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder: University of Glasgow
OpenAlex ID: W2118215721