A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
Benefits of Bounded Model Checking at an Industrial Setting
[chapter]
2001
Lecture Notes in Computer Science
In this paper, we present two industrial strength systems performing BMC for both verification and falsification. The first is Thunder, which performs BMC on top of a new satisfiability solver, SIMO. ...
With Thunder we have achieved impressive capacity and productivity for BMC. ...
Acknowledgements We would like to thank Roy Armoni for his contribution to the development of the infrastructure of Thunder. ...
doi:10.1007/3-540-44585-4_43
fatcat:bhdmgblwgrbmppnegl5cckvqxu
A survey of recent advances in SAT-based formal verification
2005
International Journal on Software Tools for Technology Transfer (STTT)
Dramatic improvements in SAT solver technology over the last decade, and the growing need for more efficient and scalable verification solutions have fueled research in verification methods based on SAT ...
This paper presents a survey of the latest developments in SAT-based formal verification, including incomplete methods such as bounded model checking, and complete methods for model checking. ...
verification/falsification methods. ...
doi:10.1007/s10009-004-0183-4
fatcat:d6hub3n6uzezhkl7dnneh2glgu
Survey on Directed Model Checking
[chapter]
2009
Lecture Notes in Computer Science
For real-time domains we discuss the adaption of the algorithms to timed automata and for probabilistic domains we show the application to counterexample generation. ...
In the enumeration process, successor selection is prioritized. We discuss existing guidance and methods to automatically generate them by exploiting system abstractions. ...
While they can represent some sets compactly, BDDs still often grow too large for reachability analysis to complete. ...
doi:10.1007/978-3-642-00431-5_5
fatcat:ajlgidfe3neu3ojpascy4l6evu
Eliminating synchronization faults in air traffic control software via design for verification with concurrency controllers
2007
Automated Software Engineering : An International Journal
We used both infinite and finite state verification techniques for finding the seeded faults. ...
During this exercise we also developed a classification of faults that can be found using the presented design for verification approach. ...
Both verification and falsification of the MUTEX controller was more efficient compared to RW controller since it was a smaller specification with fewer variables. Concrete vs. ...
doi:10.1007/s10515-007-0008-2
fatcat:36po53h5tjh7lau6zqw4s6m3rm
Guiding RTL Test Generation Using Relevant Potential Invariants
2018
2018 IEEE 36th International Conference on Computer Design (ICCD)
Due to this, verification of these designs is of utmost importance and demands much more resources and time than designing of these hardware. ...
There are several methodologies proposed to check how many branches of the design can be traversed by set of inputs. ...
set to assess the performance of original BEACON and our implementation for efficient design validation. ...
doi:10.1109/iccd.2018.00073
dblp:conf/iccd/KhannaH18
fatcat:lrupypvutzcv7fkdq5fz4w5iue
SOTER: A Runtime Assurance Framework for Programming Safe Robotics Systems
[article]
2019
arXiv
pre-print
To address these challenges, we present SOTER, a robotics programming framework with two key components: (1) a programming language for implementing and testing high-level reactive robotics software and ...
The recent drive towards achieving greater autonomy and intelligence in robotics has led to high levels of complexity. ...
ACKNOWLEDGMENTS We sincerely thank the anonymous reviewers and our shepherd Mohamed Kaaniche for their thoughtful comments. ...
arXiv:1808.07921v3
fatcat:b4wq6x6fczbnzdyxapmgvrmc5y
A Survey of Symbolic Execution Techniques
2018
ACM Computing Surveys
Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario. ...
The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience. ...
An invariant is a predicate true for an initial state and for each state reachable from it. ...
doi:10.1145/3182657
fatcat:h6kadibzkvevxa3lgzdtdokq74
A Survey of Symbolic Execution Techniques
[article]
2018
arXiv
pre-print
Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario. ...
The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience. ...
An invariant is a predicate true for an initial state and for each state reachable from it. ...
arXiv:1610.00502v3
fatcat:zez6xtyiuna6rgv7ola3nzxmty
Mcta: Heuristics and Search for Timed Systems
[chapter]
2012
Lecture Notes in Computer Science
In particular, Mcta features the powerful class of pattern database heuristics for efficiently finding shortest possible error traces. ...
Mcta is a directed model checking tool for concurrent systems of timed automata. This paper reviews Mcta and its new developments from an implementation point of view. ...
This work was partly supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center "Automatic Verification and Analysis of Complex Systems" (SFB/TR 14 AVACS ...
doi:10.1007/978-3-642-33365-1_18
fatcat:m4pkjv6p75cita5ny53slov4em
Efficient incremental algorithms for dynamic detection of likely invariants
2004
Software engineering notes
Operational abstractions are useful in testing, verification, bug detection, refactoring, comparing behavior, and many other tasks. ...
The paper presents two new incremental algorithms for invariant detection and compares them analytically and experimentally to two existing algorithms. ...
This research was funded by NSF grants CCR-0133580 and CCR-0234651, the Oxygen Project, the Deshpande Center for Technological Innovation, and gifts from NTT and Toshiba. ...
doi:10.1145/1041685.1029901
fatcat:73baqbidlvf73f3z7efef7i2qy
Software-Defined Networking: A Comprehensive Survey
[article]
2014
arXiv
pre-print
for carrier transport networks and cloud providers. ...
We start by introducing the motivation for SDN, explain its main concepts and how it differs from traditional networking, its roots, and the standardization activities regarding this novel paradigm. ...
Jennifer Rexford for her feedback on an early version of this work and encouragement to get it finished. Srini Seetharaman for reviewing the draft and providing inputs to alternative SDN views. ...
arXiv:1406.0440v3
fatcat:usdyjgdys5h3foowmq6qvih3e4
Software-Defined Networking: A Comprehensive Survey
2015
Proceedings of the IEEE
We start by introducing the motivation for SDN, explain its main concepts and how it differs from traditional networking, its roots, and the standardization activities regarding this novel paradigm. ...
We provide an in-depth analysis of the hardware infrastructure, southbound and northbound APIs, network virtualization layers, network operating systems (SDN controllers), network programming languages ...
Jennifer Rexford for her feedback on an early version of this work and encouragement to get it finished. Srini Seetharaman for reviewing the draft and providing inputs to alternative SDN views. ...
doi:10.1109/jproc.2014.2371999
fatcat:azqmynutpfgl7lovrg7qxdnl2u
Debugging Maude programs via runtime assertion checking and trace slicing
2016
Journal of Logical and Algebraic Methods in Programming
thorough trace analysis algorithm that can be used for program diagnosis and debugging. ...
Journal of Logical and Abstract In this paper we propose a dynamic analysis methodology for improving the diagnosis of erroneous Maude programs. ...
Maude is a rewriting logic specification and verification system whose operational engine is mainly based on a very efficient implementation of rewriting. ...
doi:10.1016/j.jlamp.2016.03.001
fatcat:skuavnve6zhwhbzqdtqsyc4l6i
Proceedings of Formal Methods in Computer Aided Design, FMCAD 2018
[article]
2019
The second approach is to treat the neural network as a nonlinear function and to use global optimization techniques for verification. ...
They come up with domain-specific algorithms to solve verification problems. ...
ACKNOWLEDGMENT The authors are grateful to Pamela Zave for her explanations and comments. We also thank Nuno Macedo for adding or fixing some Electrum Analyzer features needed for our study. ...
doi:10.26153/tsw/2167
fatcat:wstjih5duveh5nil62swinyx2m
Efficient Master/Worker Parallel Discrete Event Simulation
2009
2009 ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation
First and foremost, this thesis would not have been possible without the support and guidance from my advisor, Dr. Richard Fujimoto. ...
It has truly been an honor and a blessing to perform research under the supervision of one of the pioneers in the parallel and distributed simulation field. ...
result falsification for expedited credit. ...
doi:10.1109/pads.2009.9
dblp:conf/pads/ParkF09
fatcat:6aiga6uc6jdy5adfzhujiqab3a
« Previous
Showing results 1 — 15 out of 28 results