Sökning: onr:"swepub:oai:DiVA.org:uu-130930" >
Monotonic Abstracti...
Monotonic Abstraction : on Efficient Verification of Parameterized Systems
-
- Abdulla, Aziz (författare)
- Uppsala universitet,Datorteknik
-
Delzanno, Giorgio (författare)
-
- Henda, Ben (författare)
- Uppsala universitet,Datorteknik
-
visa fler...
-
Rezine, Ahmed (författare)
-
visa färre...
-
(creator_code:org_t)
- 2009
- 2009
- Engelska.
-
Ingår i: International Journal of Foundations of Computer Science. - 0129-0541. ; 20:5, s. 779-801
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- We introduce the simple and efficient method of monotonic abstraction to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton, where the transitions are guarded by both local and global conditions. Processes may communicate via broadcast, rendez-vous and shared variables over finite domains. The method of monotonic abstraction derives an over-approximation of the induced transition system that allows the use of a simple class of regular expressions as a symbolic representation. Compared to traditional regular model checking methods, the analysis does not require the manipulation of transducers, and hence its simplicity and efficiency. We have implemented a prototype that works well on several mutual exclusion algorithms and cache coherence protocols
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- TECHNOLOGY
- TEKNIKVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas