1,253 Hits in 2.8 sec

Automated Verification of Parallel Nested DFS [chapter]

Wytse Oortwijn, Marieke Huisman, Sebastiaan J. C. Joosten, Jaco van de Pol
2020 Lecture Notes in Computer Science  
As far as we are aware, this is the first automated deductive verification of a multi-core model checking algorithm.  ...  We also demonstrate how having a mechanised proof supports the easy verification of various optimisations of parallel NDFS.  ...  Automated Verification of Parallel Nested DFS  ... 
doi:10.1007/978-3-030-45190-5_14 fatcat:mxlh3zbyl5ehtjtfhskpv3cwn4

Distribution of Explicit-State LTL Model-Checking

Luboš Brim, Jiří Barnat
2003 Electronical Notes in Theoretical Computer Science  
Distribution and parallelization of verification algorithms is one of the current key research themes in the laboratory.  ...  We give a brief summary of recent achievements in the Parallel and Distributed Systems Laboratory at the Faculty of Informatics in Brno that are related to the distribution of explicit-state LTL model-checking  ...  The other research performed in the laboratory aims at the development of new original methods and techniques for the automated verification of largescale industrial critical systems, with emphasis on  ... 
doi:10.1016/s1571-0661(04)80825-9 fatcat:nzawpinu7ffuxlcxbqhgexyfxu

Platform Dependent Verification: On Engineering Verification Tools for 21st Century

Luboš Brim, Jiří Barnat
2011 Electronic Proceedings in Theoretical Computer Science  
Figure 1 : 1 Overview of complexities and on-the-fly processing ability of Nested DFS and parallel algorithms for accepting cycle detection.  ...  Nested Depth First Search algorithm (Nested DFS) and other algorithms relying on dept-first search stack cannot be used in distributedmemory setting as the distributed and parallel maintenance of the depth-first  ... 
doi:10.4204/eptcs.72.1 fatcat:d6qzv6x6pbfmbnur472wf3lvwe

A simulation-based software design framework for network-centric and parallel systems

Hussain M. J. Almohri, Osman Balci
2010 Programming Support Innovations for Emerging Distributed Applications on - PSI EtA '10  
Instead of producing static design documents in the form of UML diagrams, we propose automatic generation of a visual simulation model, which represents the target system design.  ...  We discuss a design environment that is responsible for the generation and execution of the simulation model.  ...  These two elements of our DF will assist in enabling verification and validation of the design as well as planning for an accurate code-level implementation of the design.  ... 
doi:10.1145/1940747.1940752 dblp:conf/oopsla/AlmohriB10 fatcat:j44l32dmqndfjl4nne5sxrweii

A Time-Optimal On-the-Fly Parallel Algorithm for Model Checking of Weak LTL Properties [chapter]

Jiří Barnat, Luboš Brim, Petr Ročkai
2009 Lecture Notes in Computer Science  
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity.  ...  We propose an algorithm that has the required properties for a very rich subset of LTL properties, namely those expressible by weak Büchi automata.  ...  On-The-Fly Verification In automated verification, parallel techniques both for symbolic and explicit state approaches have been considered.  ... 
doi:10.1007/978-3-642-10373-5_21 fatcat:nb5cavpfurgp7jqjotqwtiioju

Distributed Verification: Exploring the Power of Raw Computing Power [chapter]

Luboš Brim
2007 Lecture Notes in Computer Science  
The idea of parallel verification appeared already in the very early years of the formal verification era.  ...  Various techniques for automated and semi-automated analysis and verification have been successfully applied to real-life computer systems.  ...  As a matter of fact, interest in parallel verification has been revived.  ... 
doi:10.1007/978-3-540-70952-7_2 fatcat:tkirbwllp5eenptwi2zk2f6cma

LTL Model Checking of LLVM Bitcode with Symbolic Data [chapter]

Petr Bauch, Vojtěch Havel, Jiří Barnat
2014 Lecture Notes in Computer Science  
The correctness of parallel and reactive programs is often easier specified using formulae of temporal logics.  ...  This paper reports on the development of a generic framework for automatic verification of linear temporal logic specifications for programs in LLVM bitcode.  ...  The Nested-DFS (Algorithm 2) shows how bounded reachability can be used to generate a part of the state space on which an unbounded Nested-DFS is run.  ... 
doi:10.1007/978-3-319-14896-0_5 fatcat:kuzyxu6h5nb2xcghzv3syqsxli

On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties

Jiří Barnat, Luboš Brim, Petr Ročkai
2012 Science of Computer Programming  
One of the most important open problems of parallel LTL model checking is to design an onthe-fly scalable parallel algorithm with linear time complexity.  ...  In addition to the previous version of the paper (Barnat et al., 2009) [1], we demonstrate how our new algorithm can be efficiently combined with a particular parallel technique for Partial Order Reduction  ...  On-the-fly verification In automated verification, parallel techniques both for symbolic and explicit-state approaches have been considered.  ... 
doi:10.1016/j.scico.2011.03.001 fatcat:5gyybcbttfdbnepbl53q2umlgu

Accepting Predecessors Are Better than Back Edges in Distributed LTL Model-Checking [chapter]

Luboš Brim, Ivana Černá, Pavel Moravec, Jiří Šimša
2004 Lecture Notes in Computer Science  
Several optimizations of the basic algorithm are presented and the influence of the ordering on the algorithm performance is discussed.  ...  Experimental implementation of the algorithm shows promising results.  ...  Introduction Model-checking has become a very practical technique for automated verification of computer systems due to its push-button character and has been applied fairly successfully for verification  ... 
doi:10.1007/978-3-540-30494-4_25 fatcat:sifnkbq6xve3zabpihgaotlkpa

Variations on Multi-Core Nested Depth-First Search

Alfons Laarman, Jaco van de Pol
2011 Electronic Proceedings in Theoretical Computer Science  
Recently, two new parallel algorithms for on-the-fly model checking of LTL properties were presented at the same conference: Automated Technology for Verification and Analysis, 2011.  ...  While parallel random search already speeds up detection of bugs, the workers must share some global information in order to speed up full verification of correct models.  ...  Moreover, we thank Jiří Barnat for his comments on the time complexity of parallel randomized algorithms, and Keijo Heljanko for his pointer to the statistical model in [12] .  ... 
doi:10.4204/eptcs.72.2 fatcat:f5a6grqnj5bkhpjvhonkcv4hmy

Scalable Multi-core Model Checking Fairness Enhanced Systems [chapter]

Yang Liu, Jun Sun, Jin Song Dong
2009 Lecture Notes in Computer Science  
We enhance our PAT model checker with the technique and show its usability via the automated verification of several real-life systems.  ...  Rapid development in hardware industry has brought the prevalence of multi-core systems with shared-memory, which enabled the speedup of various tasks by using parallel algorithms.  ...  Nested depth-firstsearch works well for verification under no fairness.  ... 
doi:10.1007/978-3-642-10373-5_22 fatcat:jqpgqhqxk5bi3b6xi4gmohzl6a

Automated Verification of Nested DFS [chapter]

Jaco C. van de Pol
2015 Lecture Notes in Computer Science  
In this paper we demonstrate the automated verification of the Nested Depth-First Search (NDFS) algorithm for detecting accepting cycles.  ...  It fits on 4 pages, is verified by Dafny in about 2 minutes, and was developed in a couple of weeks.  ...  The basic setup might also be reused to automate the verification of other DFS algorithms, e.g. SCC-based algorithms [9] .  ... 
doi:10.1007/978-3-319-19458-5_12 fatcat:ahgw6v7fcbdehnv4lmfgysenvm

A Fully Verified Executable LTL Model Checker [chapter]

Javier Esparza, Peter Lammich, René Neumann, Tobias Nipkow, Alexander Schimpf, Jan-Georg Smaus
2013 Lecture Notes in Computer Science  
The checker consists of over 4000 lines of ML code.  ...  of a few hundred lines of "formalized pseudocode", and (2) a verified refinement step in which mathematical sets and other abstract structures are replaced by implementations of efficient structures like  ...  of the nested DFS algorithm used in the model checker.  ... 
doi:10.1007/978-3-642-39799-8_31 fatcat:aevw652hn5goxgcpemhp5okebe

Gradual Argumentation Evaluation for Stance Aggregation in Automated Fake News Detection

Neema Kotonya, Francesca Toni
2019 Proceedings of the 6th Workshop on Argument Mining  
of a claim.  ...  Typically, aggregation is treated as a credibility-weighted average of stance predictions.  ...  require the verification of text-based claims.  ... 
doi:10.18653/v1/w19-4518 dblp:conf/argmining/KotonyaT19 fatcat:jbaxkihxbjd3pjodnnht2zpdo4

Algebras of coloured Petri nets

Pommereau Franck
2019 Zenodo  
An implementation of the framework is also presented, as well as applications to the modelling and verification of security protocols, and to the modelling and analysis of biological regulatory networks  ...  However, specific verifications issues arise from the proposed approaches; we discuss these issues and propose solutions to enable for efficient verification.  ...  In particular, it should be avoided to nest a parallel composition into an iteration, which leads to 2-bounded control flow places instead of 1bounded.  ... 
doi:10.5281/zenodo.3478451 fatcat:okuk6z4gavaklbn4nvprilulxy
« Previous Showing results 1 — 15 out of 1,253 results