FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W188509945> ?p ?o ?g. }

• W188509945 abstract "Temporal logic is a formalism that is well suited to describing the behaviour of ongoing concurrent programs. There has been much interest in automating reasoning about the correctness of such programs using the satisfiability and validity problems of temporal logic. However, the complexity of these problems is exponential time or worse for all extant temporal logics. In this thesis, we consider temporal logics with a restricted syntax and show that useful mechanical reasoning can be done efficiently.We exhibit a temporal logic, SCTL (Simplified Computation Tree Logic), whose satisfiability problem is efficiently decidable, in quadratic time, and which is useful for reasoning about an interesting class of programs, the history-free ones. It follows from our results that the method proposed by Emerson & Clarke to mechanically synthesize concurrent programs from temporal specifications is decidable in polynomial time for history-free programs. We go on to present a quadratic time algorithm for the validity of inference problem for SCTL and show how it can be used to automate the verification of program correctness properties.We also study the limits of efficient temporal reasoning for arbitrary programs. We consider temporal logics which permit conjunctions of such important kinds of program assertions as initiality, safety, liveness, succession, and precedence. By suppressing the role the boolean connectives play in determining lower bounds on the complexity of decision procedures for temporal logics, we show that some of these classes of programs properties are efficiently decidable in general. However, a finite line separates such tractable classes from intractable ones, and there are certain combinations of temporal operators which cannot be efficiently decided.Finally, we extend SCTL to an indexed temporal logic, Indexed SCTL, which permits quantifications over the constituent processes of a program. Thus, we can specify programs with arbitrarily many similar processes. With a view to automating the synthesis of such programs, we pose two new decision problems for indexed temporal logics: almost always satisfiability and almost always unsatisfiability. We show that both these problems can be decided in exponential time for Indexed SCTL, and, in fact, every Indexed SCTL specification is either almost always satisfiable, i.e., it can be realized by a concurrent program with arbitrarily many processes, or is almost always unsatisfiable, i.e., no program with more than a certain number (which is determined by our decision procedure) of processes can realize the specification. We also show how these results could be used to automate the synthesis of a program that meets a desired Indexed SCTL specification which is almost always satisfiable." @default.
• W188509945 created "2016-06-24" @default.
• W188509945 creator A5029895205 @default.
• W188509945 date "1992-01-01" @default.
• W188509945 modified "2023-09-26" @default.
• W188509945 title "Reasoning about concurrent programs with simplified temporal logics" @default.
• W188509945 hasPublicationYear "1992" @default.
• W188509945 type Work @default.
• W188509945 sameAs 188509945 @default.
• W188509945 citedByCount "0" @default.
• W188509945 crossrefType "journal-article" @default.
• W188509945 hasAuthorship W188509945A5029895205 @default.
• W188509945 hasConcept C102993220 @default.
• W188509945 hasConcept C11413529 @default.
• W188509945 hasConcept C153269930 @default.
• W188509945 hasConcept C162670838 @default.
• W188509945 hasConcept C168773769 @default.
• W188509945 hasConcept C198008173 @default.
• W188509945 hasConcept C199360897 @default.
• W188509945 hasConcept C25016198 @default.
• W188509945 hasConcept C311688 @default.
• W188509945 hasConcept C41008148 @default.
• W188509945 hasConcept C4777664 @default.
• W188509945 hasConcept C55439883 @default.
• W188509945 hasConcept C6943359 @default.
• W188509945 hasConcept C80444323 @default.
• W188509945 hasConceptScore W188509945C102993220 @default.
• W188509945 hasConceptScore W188509945C11413529 @default.
• W188509945 hasConceptScore W188509945C153269930 @default.
• W188509945 hasConceptScore W188509945C162670838 @default.
• W188509945 hasConceptScore W188509945C168773769 @default.
• W188509945 hasConceptScore W188509945C198008173 @default.
• W188509945 hasConceptScore W188509945C199360897 @default.
• W188509945 hasConceptScore W188509945C25016198 @default.
• W188509945 hasConceptScore W188509945C311688 @default.
• W188509945 hasConceptScore W188509945C41008148 @default.
• W188509945 hasConceptScore W188509945C4777664 @default.
• W188509945 hasConceptScore W188509945C55439883 @default.
• W188509945 hasConceptScore W188509945C6943359 @default.
• W188509945 hasConceptScore W188509945C80444323 @default.
• W188509945 hasLocation W1885099451 @default.
• W188509945 hasOpenAccess W188509945 @default.
• W188509945 hasPrimaryLocation W1885099451 @default.
• W188509945 hasRelatedWork W112239219 @default.
• W188509945 hasRelatedWork W1484584685 @default.
• W188509945 hasRelatedWork W1504299768 @default.
• W188509945 hasRelatedWork W1520431822 @default.
• W188509945 hasRelatedWork W1523736181 @default.
• W188509945 hasRelatedWork W1692871243 @default.
• W188509945 hasRelatedWork W1973827570 @default.
• W188509945 hasRelatedWork W1994179113 @default.
• W188509945 hasRelatedWork W2005277728 @default.
• W188509945 hasRelatedWork W2037668023 @default.
• W188509945 hasRelatedWork W207722629 @default.
• W188509945 hasRelatedWork W2144102501 @default.
• W188509945 hasRelatedWork W2149320266 @default.
• W188509945 hasRelatedWork W2162357200 @default.
• W188509945 hasRelatedWork W22612880 @default.
• W188509945 hasRelatedWork W2889187308 @default.
• W188509945 hasRelatedWork W3100037762 @default.
• W188509945 hasRelatedWork W3102573003 @default.
• W188509945 hasRelatedWork W3123850752 @default.
• W188509945 hasRelatedWork W3190302205 @default.
• W188509945 isParatext "false" @default.
• W188509945 isRetracted "false" @default.
• W188509945 magId "188509945" @default.
• W188509945 workType "article" @default.