FRINK Linked Data Fragments server

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

• W2213886569 abstract "Formal design verification is a methodology for detecting logical errors in systems. In formal design verification, the designer describes a system in a language with a mathematical semantics, and then the system description is analyzed against various correctness requirements. The paradigm is called model checking when the analysis is performed automatically by exhaustive state-sparce exploration. A correctness requirement is usually specified either as a formula expressed in temporal logic, or as an abstract design expressed in the system's description language. If the requirement is specified as an abstract design, the verification problem is called refinement checking . This thesis extends the state-of-art by increasing both the class, and the size of systems on which automatic and semi-automatic refinement checking are viable. Refinement checking problems are formulated in the form Impl p Spec, where Impl is a description of the system, Spec is the requirement, and p is a preorder over system descriptions. Depending on the properties we ascribe to the p preorder, we get different notions of refinement. Three orthogonal property classes characterize the refinement preorder, namely, (1) linear and branching views of time, (2) finite and fair views of system behaviors, and (3) spatial and temporal abstraction of the requirement. We develop the theory of fair branching refinements, and give an efficient algorithm to check such refinements. We propose a novel and efficient algorithm to check refinements involving temporal abstractions. Refinement checking algorithms usually explore and analyze the state space of the system. As we seek to enhance the applicability of model checking to complex designs, we are faced with the so-called state-explosion problem: the size of the state space grows exponentially with the size of the system description, making exhaustive state-space exploration infeasible. Scalable approaches to refinement checking make use of the compositional structure of both implementation and specification, and divide the verification task at hand into simpler subtasks. Each such subtask involves checking if an implementation-component refines its corresponding specification-component. Discharging such subtasks requires assumptions about inputs to the implementation-component. These assumptions are taken into account by the assume-guarantee approach, which uses the specification for the inputs as assumptions on the inputs (the apparent circularity in such proofs is resolved by an induction over time). We prove soundness of the assume-guarantee rule when applied to branching refinements (both finite and fair cases). We propose a new assume-guarantee proof rule for checking refinements of implementations against requirements that are both spatially and temporally abstract. The techniques have been implemented in a new verification tool called MOCHA. MOCHA has been used successfully to detect and fix elusive bugs in a signal-processing chip that has 6 million transistors." @default.
• W2213886569 created "2016-06-24" @default.
• W2213886569 creator A5076139746 @default.
• W2213886569 creator A5080555605 @default.
• W2213886569 date "1999-01-01" @default.
• W2213886569 modified "2023-10-18" @default.
• W2213886569 title "New directions in refinement checking" @default.
• W2213886569 hasPublicationYear "1999" @default.
• W2213886569 type Work @default.
• W2213886569 sameAs 2213886569 @default.
• W2213886569 citedByCount "5" @default.
• W2213886569 crossrefType "journal-article" @default.
• W2213886569 hasAuthorship W2213886569A5076139746 @default.
• W2213886569 hasAuthorship W2213886569A5080555605 @default.
• W2213886569 hasConcept C110251889 @default.
• W2213886569 hasConcept C111472728 @default.
• W2213886569 hasConcept C111498074 @default.
• W2213886569 hasConcept C11413529 @default.
• W2213886569 hasConcept C116253237 @default.
• W2213886569 hasConcept C118615104 @default.
• W2213886569 hasConcept C124304363 @default.
• W2213886569 hasConcept C138885662 @default.
• W2213886569 hasConcept C184337299 @default.
• W2213886569 hasConcept C198008173 @default.
• W2213886569 hasConcept C199360897 @default.
• W2213886569 hasConcept C2333172 @default.
• W2213886569 hasConcept C25016198 @default.
• W2213886569 hasConcept C30888246 @default.
• W2213886569 hasConcept C33923547 @default.
• W2213886569 hasConcept C41008148 @default.
• W2213886569 hasConcept C4777664 @default.
• W2213886569 hasConcept C55439883 @default.
• W2213886569 hasConcept C80444323 @default.
• W2213886569 hasConceptScore W2213886569C110251889 @default.
• W2213886569 hasConceptScore W2213886569C111472728 @default.
• W2213886569 hasConceptScore W2213886569C111498074 @default.
• W2213886569 hasConceptScore W2213886569C11413529 @default.
• W2213886569 hasConceptScore W2213886569C116253237 @default.
• W2213886569 hasConceptScore W2213886569C118615104 @default.
• W2213886569 hasConceptScore W2213886569C124304363 @default.
• W2213886569 hasConceptScore W2213886569C138885662 @default.
• W2213886569 hasConceptScore W2213886569C184337299 @default.
• W2213886569 hasConceptScore W2213886569C198008173 @default.
• W2213886569 hasConceptScore W2213886569C199360897 @default.
• W2213886569 hasConceptScore W2213886569C2333172 @default.
• W2213886569 hasConceptScore W2213886569C25016198 @default.
• W2213886569 hasConceptScore W2213886569C30888246 @default.
• W2213886569 hasConceptScore W2213886569C33923547 @default.
• W2213886569 hasConceptScore W2213886569C41008148 @default.
• W2213886569 hasConceptScore W2213886569C4777664 @default.
• W2213886569 hasConceptScore W2213886569C55439883 @default.
• W2213886569 hasConceptScore W2213886569C80444323 @default.
• W2213886569 hasLocation W22138865691 @default.
• W2213886569 hasOpenAccess W2213886569 @default.
• W2213886569 hasPrimaryLocation W22138865691 @default.
• W2213886569 hasRelatedWork W1518096547 @default.
• W2213886569 hasRelatedWork W1551406732 @default.
• W2213886569 hasRelatedWork W1583497532 @default.
• W2213886569 hasRelatedWork W1644782203 @default.
• W2213886569 hasRelatedWork W1671661949 @default.
• W2213886569 hasRelatedWork W17300578 @default.
• W2213886569 hasRelatedWork W1801993675 @default.
• W2213886569 hasRelatedWork W186611154 @default.
• W2213886569 hasRelatedWork W2105172619 @default.
• W2213886569 hasRelatedWork W2111223667 @default.
• W2213886569 hasRelatedWork W2185715623 @default.
• W2213886569 hasRelatedWork W2260592993 @default.
• W2213886569 hasRelatedWork W2272690707 @default.
• W2213886569 hasRelatedWork W2502580831 @default.
• W2213886569 hasRelatedWork W2596310084 @default.
• W2213886569 hasRelatedWork W2597775210 @default.
• W2213886569 hasRelatedWork W2963343085 @default.
• W2213886569 hasRelatedWork W3049479974 @default.
• W2213886569 hasRelatedWork W3131940921 @default.
• W2213886569 hasRelatedWork W98168214 @default.
• W2213886569 isParatext "false" @default.
• W2213886569 isRetracted "false" @default.
• W2213886569 magId "2213886569" @default.
• W2213886569 workType "article" @default.