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
Efficient model checking by automated ordering of transition relation partitions
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
In symbolic model checking, the behavior of a model to be verified is captured by the transition relation of the state space implied by the model. ...
Using this method, actions that require the transition relation can be executed by using one partition at a time. ...
Thus, in order to fully automate the use of a partitioned transition relation, it is necessary to find a method of ordering the partitions that is independent of knowledge of the semantics of the circuit ...
doi:10.1007/3-540-58179-0_63
fatcat:wpt4sqyrk5ca3a5d7qkp5vwwva
Symbolic model checking for sequential circuit verification
1994
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The temporal logic model checking algorithm of Clarke, Emerson, and Sistla [17] is modified to represent state graphs using binary decision diagrams (BDD's) [7] and partitioned trunsirion relations [lo ...
Our model checking algorithm handles full CTL with fairness constraints. ...
All of these methods are made significantly more efficient by the use of partitioned transition relations. ...
doi:10.1109/43.275352
fatcat:rp26m7h6a5ht7dbqpqzkifaw5u
A new partitioning scheme for improvement of image computation
2001
Proceedings of the 2001 conference on Asia South Pacific design automation - ASP-DAC '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents a new approach that significantly increases the quality of the partitioning of the transition relation of finite state machines. ...
State exploration techniques based on OB-DDs use a partitioned representation of the transition relation to keep the OBDD-sizes manageable. ...
PARTITIONING OF TRANSITION RELATIONS The quality of the partitioning is crucial for the efficiency of the RS computation. ...
doi:10.1145/370155.370289
dblp:conf/aspdac/MeinelS01
fatcat:dnvm3atlrbdmlfolaxq3fvvlca
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
2011
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The paper overviews recent developments in platform-dependent explicit-state LTL model checking. ...
Preliminary attempts to do so relate to explicit model checking. ...
Parallel Algorithms in LTL Model Checking The need of parallel processing in automated formal verification stemmed from the desire to fight the state space explosion problem by employing aggregate memory ...
doi:10.4204/eptcs.72.1
fatcat:d6qzv6x6pbfmbnur472wf3lvwe
Compositional Reasoning in Model Checking
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The main problem in model checking that prevents it from being used for verification of large systems is the state explosion problem. ...
Many techniques have been proposed to overcome this difficulty and, thus, increase the size of the systems that model checkers can handle. ...
In general, all of the compositional model checking techniques have their limitations and much work remains to be done. The most important problem is the trade-off between efficiency and automation. ...
doi:10.1007/3-540-49213-5_4
fatcat:quilkf54sjgfveohuiku2h7u6q
Little Engines of Proof
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of thought. ...
The other school, pioneered by Hao Wang, argues for problem-specific combinations of decision and semi-decision procedures. ...
The composition (N 1 ; N 2 ) of two transition relations N 1 and N 2 can be captured as ∃y : N 1 (x, y) ∧ N 2 (y, x ). Fixpoints and Model Checking. ...
doi:10.1007/3-540-45614-7_1
fatcat:6my3fmm6xjb4vfj6sxly46xbxa
Disjunctive image computation for software verification
2007
ACM Transactions on Design Automation of Electronic Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We use hypergraph partitioning to minimize the number of live variables in each disjunctive component, and variable scopes to simplify transition relations and reachable state subsets. ...
Our experiments on nontrivial C programs show that BDD-based symbolic algorithms can directly handle software models with a much larger number of state variables than for hardware designs. ...
The algorithm by Barner and Rabinovitz [2003] was also based on symbolic model checking and used disjunctively partitioned transition relations. ...
doi:10.1145/1230800.1230802
fatcat:l3hrgrshyvfqjhobhei6jk6u4u
Efficient Symbolic Model Checking of Software Using Partial Disjunctive Partitioning
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In addition, we show how to translate a (software) program to an or-structure, in order to enable efficient symbolic model checking of the program using its disjunctive partitions. ...
This paper presents a method for taking advantage of the efficiency of symbolic model checking using disjunctive partitions, while keeping the number and the size of the partitions small. ...
Given a set of states S and a transition relation R, represented in symbolic model checking by the BDDs S(v) and R(v,v ) respectively, the image computation finds the set of all states related by R to ...
doi:10.1007/978-3-540-39724-3_6
fatcat:2u2te7ctajahndjlx4gpns7vw4
Disjunctive Image Computation for Embedded Software Verification
2006
Proceedings of the Design Automation & Test in Europe Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finite state models generated from software programs have unique characteristics that are not exploited by existing model checking algorithms. ...
Related Work Partitioned transition relations for symbolic image computation were proposed in [7, 9] in both disjunctive and conjunctive forms. ...
The algorithm by Barner and Rabinovitz [13] was also based on symbolic model checking and used disjunctively partitioned transition relations. ...
doi:10.1109/date.2006.244049
dblp:conf/date/WangYIG06
fatcat:eervnx3ekbh3jaqwurlaibfz6y
Automatic verification of sequential circuit designs
1992
Philosophical Transactions of the Royal Society of London Series A Physical and Engineering Sciences
Preserved Fulltext
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.
In this approach, the circuit is modelled as a state transition system, and specifications are given by temporal logic formulas. ...
It is now possible to verify transition systems th at are many orders of magnitude larger than was previously the case. ...
The following section describes the new symbolic model checking algorithm and demonstrates how the transition relation of a large state transition graph can be partitioned. ...
doi:10.1098/rsta.1992.0028
fatcat:pkrj3pof5jcjhn5uvgiishj6ay
Recent advances in interactive and automated analysis
2017
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Despite the relevant scientific results and well-established tools obtained in recent years, there is a constant need of enhancing the analysis capabilities in order to handle increasingly complex systems ...
We briefly discuss some recent advances in the field, introducing five papers selected from the 22th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS ...
Acknowledgments We are grateful to all authors for their contributions, as well as to the reviewers of TACAS'16 and of this special issue for their careful and constructive examination of the manuscripts ...
doi:10.1007/s10009-017-0477-y
fatcat:ouhrg3llyfcjxkogcchu64ggyy
SATABS: SAT-Based Predicate Abstraction for ANSI-C
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Sa-tAbs overcomes these limitations by using a SAT-solver. This allows the model checker to handle the semantics of the ANSI-C standard accurately. ...
This paper presents a model checking tool, SatAbs, that implements a predicate abstraction refinement loop. ...
For efficiency, SatAbs overap-proximatesR by partitioning the predicates into clusters [18] . The abstract model is passed to a model checker. ...
doi:10.1007/978-3-540-31980-1_40
fatcat:sdlz46crizglnnccq5au4jtutq
RuleBase
1996
Proceedings of the 33rd annual conference on Design automation conference - DAC '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
RuleBase is a formal verification tool, developed by the IBM Haifa Research Laboratory. ...
It is the result of three years of experience in practical formal verification of hardware which, we believe, has been a key factor in bringing the tool to its current level of maturity. ...
Acknowledgments We thank Danny Geist, Gavin Meil, Wayne Nation, Ram Raghavan, Bruce Singer, Yakov Zandman, and the designers of the Haifa Design Group, whose cooperation contributed to the maturity of ...
doi:10.1145/240518.240642
dblp:conf/dac/BeerBEL96
fatcat:owqp457vrfab5grcaiyl5hmsbm
Rtdt: A Front-End for Efficient Model Checking of Synchronous Timing Diagrams
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The model checking process is very efficient, linear in the size of the system and the diagram. ...
Model checking tools, due to the complex nature of the specification methods, are used most effectively by verification experts. ...
doi:10.1007/3-540-44585-4_38
fatcat:3njjzqiic5cvjeu47qy22226ky
Integrated Analysis of Temporal Behavior of Component-Based Distributed Real-Time Embedded Systems
2015
2015 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present new CPN-based modeling approaches and advanced state space methods that improve on the scalability and efficiency of the analysis. ...
The generality of the modeling principles used show the applicability of this approach to a wide range of systems. ...
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not reflect the views of DARPA or NSF. ...
doi:10.1109/isorcw.2015.56
dblp:conf/isorc/KumarK15
fatcat:py6k7nq27vbdrix3bnbxxclyn4
« Previous
Showing results 1 — 15 out of 27,420 results