Cluster-Based I/O-Efficient LTL Model Checking

I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity RAM. On the other hand, parallel algorithms are used to accelerate the computation and their usage may significantly increase the amount of avai...

Full description

Saved in:
Bibliographic Details
Published in:2009 IEEE/ACM International Conference on Automated Software Engineering pp. 635 - 639
Main Authors: Barnat, J., Brim, L., Simecek, P.
Format: Conference Proceeding
Language:English
Published: IEEE 01.11.2009
Subjects:
Acceleration
Clustering algorithms
Computer industry
Computer networks
Concurrent computing
I/O-efficient model checking
Large-scale systems
LTL
Parallel algorithms
parallel model checking
Random access memory
Read-write memory
State-space methods
ISBN:1424452597, 9781424452590
ISSN:1938-4300
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity RAM. On the other hand, parallel algorithms are used to accelerate the computation and their usage may significantly increase the amount of available RAM memory if clusters of computers are involved. Since both the large amount of memory and high speed computation are desired in verification of large-scale industrial systems, extending I/O-efficient model checking to work over a network of computers can bring substantial benefits. In this paper we propose an explicit state cluster-based I/O efficient LTL model checking algorithm that is capable to verify systems with approximately 10 10 states within hours.
AbstractList I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity RAM. On the other hand, parallel algorithms are used to accelerate the computation and their usage may significantly increase the amount of available RAM memory if clusters of computers are involved. Since both the large amount of memory and high speed computation are desired in verification of large-scale industrial systems, extending I/O-efficient model checking to work over a network of computers can bring substantial benefits. In this paper we propose an explicit state cluster-based I/O efficient LTL model checking algorithm that is capable to verify systems with approximately 10 10 states within hours.
Author Simecek, P.
Barnat, J.
Brim, L.
Author_xml – sequence: 1
  givenname: J.
  surname: Barnat
  fullname: Barnat, J.
  organization: Fac. of Inf., Masaryk Univ., Brno, Czech Republic
– sequence: 2
  givenname: L.
  surname: Brim
  fullname: Brim, L.
  organization: Fac. of Inf., Masaryk Univ., Brno, Czech Republic
– sequence: 3
  givenname: P.
  surname: Simecek
  fullname: Simecek, P.
  organization: Fac. of Inf., Masaryk Univ., Brno, Czech Republic
BookMark eNotjj9PwzAUxI0oEm3JxMiSL-DUz3-w31iiAJWCOlDmKrGfIRBSlISBb48luOV0up9Ot2KL4TQQY9cgCgCBm-1zVUghsFDyjGVonbC3aJRD0OdsBVpqbaRBu2BLQOW4VkJcsmya3kVS6tDBkhVl_z3NNPK7ZqKQ7zZ7XsXY-Y6GOa8Pdf50CtTn5Rv5j254vWIXseknyv59zV7uq0P5yOv9w67c1ryRCmcerG5sGyKqqHxrdCNbn4IGZyMGaGPbeiNUTDcCSnCJk5QoCughWlJrdvO32xHR8WvsPpvx52i0AgtO_QKIFkVZ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ASE.2009.32
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780769538914
0769538916
EndPage 639
ExternalDocumentID 5431718
Genre orig-research
GroupedDBID 29I
6IE
6IF
6IH
6IK
6IL
6IM
6IN
6J9
AAJGR
AAWTH
ABLEC
ACREN
ADYOE
ADZIZ
AFYQB
ALMA_UNASSIGNED_HOLDINGS
AMTXH
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
ID FETCH-LOGICAL-a239t-d74a7bdf93f3cb54a2bcf934187f9d1bfbbc503f045d921893f2e4a2ed9c1f7e3
IEDL.DBID RIE
ISBN 1424452597
9781424452590
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000278137400068&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1938-4300
IngestDate Wed Aug 27 08:36:24 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a239t-d74a7bdf93f3cb54a2bcf934187f9d1bfbbc503f045d921893f2e4a2ed9c1f7e3
PageCount 5
ParticipantIDs ieee_primary_5431718
PublicationCentury 2000
PublicationDate 2009-Nov.
PublicationDateYYYYMMDD 2009-11-01
PublicationDate_xml – month: 11
  year: 2009
  text: 2009-Nov.
PublicationDecade 2000
PublicationTitle 2009 IEEE/ACM International Conference on Automated Software Engineering
PublicationTitleAbbrev ASE
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000452981
ssj0051577
ssj0001130041
Score 1.7619928
Snippet I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity...
SourceID ieee
SourceType Publisher
StartPage 635
SubjectTerms Acceleration
Clustering algorithms
Computer industry
Computer networks
Concurrent computing
I/O-efficient model checking
Large-scale systems
LTL
Parallel algorithms
parallel model checking
Random access memory
Read-write memory
State-space methods
Title Cluster-Based I/O-Efficient LTL Model Checking
URI https://ieeexplore.ieee.org/document/5431718
WOSCitedRecordID wos000278137400068&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4B4sETKhh_ZwePFtja0fWoBKIJQRLRcCNr-xpNCBAE_35fy4YevHhbt6Zp17Tfy2u_7wO45SJTFjFhFH1Y5tVRmJImZipFGTttDQ-3Ld6GcjTKplM1rsDdnguDiOHyGbb8YzjLt0uz9amytudt015ahaqU3R1Xa59P8dLgquBQhvxKHLSkyl2ZYDu4MFK8kjFBn0qSV0rxvyy1n4pypyDyxR3Vvn_p71QtvUHJLwOWgD-D-v96fgTNHyJfNN5D1DFUcHEC9dLJISoWdgNavfnWKyawBwI1Gz21n1k_aEtQq9FwMoy8Zdo86r2j8an1JrwO-pPeIyucFFiecLVhVopcausUd9zoVOSJNlSgqZFO2Vg7rU3a4Y5-olUE-lQvQaqFVpnYSeSnUFssF3gGkcptYmSMAvNUOFq9QhmKMtIuF8JlWp5Dww9_ttqJZcyKkV_8_foSDsPxTCD3XUFts97iNRyYr83H5_omzPA3Cmqb0Q
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGP2CaKInVDD-dgePFra1s-tRCQTiRBLRcCNr-zWaEDAI_v22ZUMPXrytW7Osbdr37WvfewDXlKVCI8bERh-aOHUUIriKiEiQR0ZqRf1pi9eMDwbpeCyGFbjZcGEQ0R8-w6a79Hv5eq5WLlXWcrxtu5ZuwXbCWByu2VqbjIoTBxcFi9JnWCKvJlWuyxa4vQ-jjVhSwuyjkuaV2D8AXqo_FeWwoPJFoWjdPXfWupbOouSXBYtHoG7tf9--D40fKl8w3IDUAVRwdgi10sshKKZ2HZrt6cppJpB7C2s66LeeSMerS9i3BtkoC5xp2jRov6FyyfUGvHQ7o3aPFF4KJI-pWBLNWc6lNoIaqmTC8lgqW7CDw43QkTRSqiSkxnaiFhb2bb0YbS3UQkWGIz2C6mw-w2MIRK5jxSNkmCfM2PnLhLJxRnJLGTOp5CdQd82ffKzlMiZFy0__vn0Fu73RYzbJ-oOHM9jzmzWe6ncO1eVihRewo76W75-LSz_a32Fknxg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+IEEE%2FACM+International+Conference+on+Automated+Software+Engineering&rft.atitle=Cluster-Based+I%2FO-Efficient+LTL+Model+Checking&rft.au=Barnat%2C+J.&rft.au=Brim%2C+L.&rft.au=Simecek%2C+P.&rft.date=2009-11-01&rft.pub=IEEE&rft.isbn=9781424452590&rft.issn=1938-4300&rft.spage=635&rft.epage=639&rft_id=info:doi/10.1109%2FASE.2009.32&rft.externalDocID=5431718
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1938-4300&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1938-4300&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1938-4300&client=summon