FRINK Linked Data Fragments server

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

• W38594721 abstract "Asynchronous reactive systems find applications in a wide range of software systems such as communication protocols, embedded software systems, etc. It is highly desirable to rigorously show that these systems are correctly designed, because a correct design is vital to providing services of high quality. However, formal approaches to the verification of these systems, such as model checking, are often difficult because these systems usually possess extremely large or even infinite state spaces. In fact, in case of infinite state systems, many interesting verification problems become undecidable and traditional finite state model checking techniques cannot be applied to those systems. We propose an Integer Linear Program (ILP) solving based verification framework that concentrates on the local analysis of the cyclic behavior of each individual component of a system. This way we avoid the exploration of the huge or even infinite state space of the system. More precisely, we use automated abstraction techniques to transform an original system into a set of local control flow cycles and over-approximate the message passing effects of these cycles. Then, we derive a necessary condition for the violation of the considered property on the message passing effects of cycles. We further encode the necessary condition into an ILP problem whose solution space represents the property violating behavior. The infeasibility of the ILP problem then establishes the satisfaction of the property by the system. Moreover, the resulting ILP problem can be checked in polynomial time. We have applied our framework to the verification of the buffer boundedness and livelock freedom properties, both of which are undecidable for asynchronous reactive systems with an infinite state space. On one hand, the verification framework that we propose is efficient since it needs not to consider an exponential number of all possible interleavings of the executions of the system components. Instead, it maintains the locality of the analysis of each component and reduces the original verification problem into a polynomial-time solvable problem. On the other hand, our framework is incomplete: it either proves the satisfaction of a property, or returns an inconclusive verdict “UNKNOWN”. In the latter case, the property may or may not be satisfied by the system under scrutiny. This imprecision comes from the potential coarseness of the abstractions that our verification framework employs. After all, the incompleteness of the framework is inevitable since the properties that we check are undecidable. While the precision of our framework remains an issue, we propose a counterexample guided abstraction refinement procedure based on the discovery of dependencies among control flow cycles. The discovered cycle dependencies can be efficiently encoded into linear inequalities that are used to augment the constraint set of the original property determination ILP problem. The newly added constraints may rule out certain spurious behavior that violates the property, and thus refine the abstraction. The cycle dependency discovery methods that we devise are also incomplete. This means that some spurious property violating behavior may never be eliminated by any cycle dependencies that we can discover. We make the verification methods applicable to two widely used modeling languages, namely Promela and UML RT, by devising tailored code abstraction techniques. These techniques address abstraction issues concerning specific fea-" @default.
• W38594721 created "2016-06-24" @default.
• W38594721 creator A5003799076 @default.
• W38594721 date "2008-01-01" @default.
• W38594721 modified "2023-09-24" @default.
• W38594721 title "Incomplete Property Checking for Asynchronous Reactive Systems" @default.
• W38594721 cites W1487391476 @default.
• W38594721 cites W1503170978 @default.
• W38594721 cites W1505355949 @default.
• W38594721 cites W1506588809 @default.
• W38594721 cites W1515260872 @default.
• W38594721 cites W1521601620 @default.
• W38594721 cites W1526786777 @default.
• W38594721 cites W1527705380 @default.
• W38594721 cites W1530375435 @default.
• W38594721 cites W1541144457 @default.
• W38594721 cites W1553858749 @default.
• W38594721 cites W1574242732 @default.
• W38594721 cites W1575647584 @default.
• W38594721 cites W1579648875 @default.
• W38594721 cites W1582068322 @default.
• W38594721 cites W1592840252 @default.
• W38594721 cites W1604959559 @default.
• W38594721 cites W1608856655 @default.
• W38594721 cites W182448688 @default.
• W38594721 cites W1943502734 @default.
• W38594721 cites W1963547452 @default.
• W38594721 cites W1964711453 @default.
• W38594721 cites W1984478483 @default.
• W38594721 cites W1996109622 @default.
• W38594721 cites W2002644257 @default.
• W38594721 cites W2033040247 @default.
• W38594721 cites W2036265926 @default.
• W38594721 cites W2039025680 @default.
• W38594721 cites W2044858512 @default.
• W38594721 cites W2047375390 @default.
• W38594721 cites W2059530928 @default.
• W38594721 cites W2079157601 @default.
• W38594721 cites W2091364465 @default.
• W38594721 cites W2101743103 @default.
• W38594721 cites W2102657262 @default.
• W38594721 cites W2102890180 @default.
• W38594721 cites W2106001218 @default.
• W38594721 cites W2118496081 @default.
• W38594721 cites W2119494075 @default.
• W38594721 cites W2121817468 @default.
• W38594721 cites W2132334337 @default.
• W38594721 cites W2132661148 @default.
• W38594721 cites W2137740677 @default.
• W38594721 cites W2146928461 @default.
• W38594721 cites W2153063501 @default.
• W38594721 cites W2155890429 @default.
• W38594721 cites W2169073289 @default.
• W38594721 cites W2175982508 @default.
• W38594721 cites W2394903686 @default.
• W38594721 cites W2489810575 @default.
• W38594721 cites W303139982 @default.
• W38594721 cites W3145128584 @default.
• W38594721 cites W1590200750 @default.
• W38594721 cites W2527288790 @default.
• W38594721 hasPublicationYear "2008" @default.
• W38594721 type Work @default.
• W38594721 sameAs 38594721 @default.
• W38594721 citedByCount "1" @default.
• W38594721 crossrefType "dissertation" @default.
• W38594721 hasAuthorship W38594721A5003799076 @default.
• W38594721 hasConcept C105795698 @default.
• W38594721 hasConcept C110251889 @default.
• W38594721 hasConcept C111472728 @default.
• W38594721 hasConcept C111498074 @default.
• W38594721 hasConcept C11413529 @default.
• W38594721 hasConcept C120314980 @default.
• W38594721 hasConcept C124304363 @default.
• W38594721 hasConcept C134652429 @default.
• W38594721 hasConcept C137059387 @default.
• W38594721 hasConcept C138885662 @default.
• W38594721 hasConcept C151319957 @default.
• W38594721 hasConcept C153269930 @default.
• W38594721 hasConcept C177264268 @default.
• W38594721 hasConcept C189950617 @default.
• W38594721 hasConcept C192034797 @default.
• W38594721 hasConcept C199360897 @default.
• W38594721 hasConcept C31258907 @default.
• W38594721 hasConcept C33923547 @default.
• W38594721 hasConcept C41008148 @default.
• W38594721 hasConcept C42196554 @default.
• W38594721 hasConcept C48103436 @default.
• W38594721 hasConcept C72434380 @default.
• W38594721 hasConcept C76155785 @default.
• W38594721 hasConcept C7923308 @default.
• W38594721 hasConcept C80444323 @default.
• W38594721 hasConceptScore W38594721C105795698 @default.
• W38594721 hasConceptScore W38594721C110251889 @default.
• W38594721 hasConceptScore W38594721C111472728 @default.
• W38594721 hasConceptScore W38594721C111498074 @default.
• W38594721 hasConceptScore W38594721C11413529 @default.
• W38594721 hasConceptScore W38594721C120314980 @default.
• W38594721 hasConceptScore W38594721C124304363 @default.
• W38594721 hasConceptScore W38594721C134652429 @default.
• W38594721 hasConceptScore W38594721C137059387 @default.

• next