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.
Filters
Decomposing image computation for symbolic reachability analysis using control flow information
2006
Computer-Aided Design (ICCAD), IEEE International Conference on
Preserved Fulltext
The main challenge in BDD-based symbolic reachability analysis is represented by the sizes of the intermediate decision diagrams obtained during image computations. ...
Methods proposed to mitigate this problem fall broadly into two categories: Search strategies that depart from breadth-first search, and efficient techniques for image computation. ...
The disjunctive decomposition has an inherent overhead in terms of BDD nodes because it instantiates two transition relations simultaneously. ...
doi:10.1145/1233501.1233662
dblp:conf/iccad/WardS06
fatcat:wvc32tfelbdhfda6cmimyitdii
Decomposing Image Computation for Symbolic Reachability Analysis Using Control Flow Information
2006
Computer-Aided Design (ICCAD), IEEE International Conference on
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 main challenge in BDD-based symbolic reachability analysis is represented by the sizes of the intermediate decision diagrams obtained during image computations. ...
Methods proposed to mitigate this problem fall broadly into two categories: Search strategies that depart from breadth-first search, and efficient techniques for image computation. ...
The disjunctive decomposition has an inherent overhead in terms of BDD nodes because it instantiates two transition relations simultaneously. ...
doi:10.1109/iccad.2006.320120
fatcat:lelilfmqcjcehpca4qnbm3zjny
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 algorithm divides an image computation step into a disjunctive set of easier ones that can be performed in isolation. ...
Decomposition of Transition Relation The transition relation T of a software model can be decomposed naturally into a union of disjunctive components, one for each program location. ...
doi:10.1145/1230800.1230802
fatcat:l3hrgrshyvfqjhobhei6jk6u4u
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.
Related Work Partitioned transition relations for symbolic image computation were proposed in [7, 9] in both disjunctive and conjunctive forms. ...
Hypergraph partitioning is used to minimize the number of live variables in each disjunctive component. We use the live variables to simplify transition relations and reachable state subsets. ...
Decomposition of Transition Relation The transition relation T of a software model can be decomposed naturally into a union of disjunctive components, one for each program location. ...
doi:10.1109/date.2006.244049
dblp:conf/date/WangYIG06
fatcat:eervnx3ekbh3jaqwurlaibfz6y
Symbolic reachability computation using the disjunctive partitioning technique in Supervisory Control Theory
2011
2011 IEEE International Conference on Robotics and Automation
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.
Based on this principle, an efficient symbolic state-space traversal approach, depending on the disjunctive partitioning technique, is presented and the correctness of it is proved. ...
Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples. ...
The algorithm maintains a set of active disjunctive transition relations W k . These active transition relations are selected one at a time for the reachability search. ...
doi:10.1109/icra.2011.5980008
dblp:conf/icra/FeiAL11
fatcat:2zk734r5a5bjppxmw26ol4k4nu
Model checking sequential software programs via mixed symbolic analysis
2009
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 present an efficient symbolic search algorithm for software model checking. ...
Our algorithms perform word-level reasoning by using a combination of decision procedures in Boolean and integer and real domains, and use novel symbolic search strategies optimized specifically for sequential ...
In general, image computation based on a disjunctively partitioned transition relation is effective only if a good partition can be efficiently computed. ...
doi:10.1145/1455229.1455239
fatcat:jgxnkajci5c2njql4ihysrlq2q
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.
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. ...
We define a restricted form of a Kripke structure, called an or-structure, for which it is possible to generate small disjunctive partitions. ...
We thank Cindy Eisner, Yoad Lustig and Ziv Nevo for many helpful discussions. ...
doi:10.1007/978-3-540-39724-3_6
fatcat:2u2te7ctajahndjlx4gpns7vw4
Advanced Saturation-based Model Checking of Well-formed Coloured Petri Nets
2014
Periodica Polytechnica Electrical Engineering and 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 problem with saturation is that the symbolic representation it builds for the next-state relation during the state exploration phase imposes a high overhead in the analysis of practical systems. ...
The saturation algorithm has an efficient iteration strategy. Combined with symbolic data structures, it can be used for state space generation and model checking of asynchronous systems. ...
Building the ER Relation We apply the conjunctive-disjunctive decomposition also to the ER relation. The algorithm creates a separate ER e relation for each event e. ...
doi:10.3311/ppee.2080
fatcat:qwfrj5zz45gpbo2esqkn5ribjy
Symbolic reachability analysis of large finite state machines using don't cares
1999
Proceedings of the conference on Design, automation and test in Europe - DATE '99
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.
Second, we propose new techniques to use the final approximation to enhance the capability and efficiency of exact reachability analysis. ...
First, we propose an iterative approximate reachability analysis technique in which don't care sets derived from previous iterations are used in subsequent iterations for better approximation. ...
Acknowledgments The authors would like to thank A Narayan for his help on our experimental setup and H. Cho, F. Somenzi, and G. Hachtel for constructive comments on our work. ...
doi:10.1145/307418.307430
fatcat:dcgmtex5qvelxnt4uerszh4qtm
A symbolic approach to large-scale discrete event systems modeled as finite automata with variables
2012
2012 IEEE International Conference on Automation Science and Engineering (CASE)
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.
By making use of the disjunctive partitioning technique, the proposed approach partitions the transition relation of a considered system into a set of partial transition relations according to included ...
Then those partial transition relations are selected systematically to perform the reachability computation. ...
This is done by splitting the transition relation into a set of partial transition relations, connected by either disjunction or conjunction. ...
doi:10.1109/coase.2012.6386479
dblp:conf/case/FeiMAL12
fatcat:ci7mcmh3azdazap5u6hvbs2g2y
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 ...
We can make disjunctive partitioning more efficient by using a modified breadth first search (MBFS) for reachability analysis. ...
We used this decomposition as a starting point for breaking the transition relation into parts. ...
doi:10.1109/43.275352
fatcat:rp26m7h6a5ht7dbqpqzkifaw5u
To split or to conjoin
2000
Proceedings of the 37th conference on Design automation - DAC '00
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 2004; you can also visit the original URL.
The file type is application/pdf.
Two techniques have been used for this step: one based on conjunction of the terms of the transition relation, and the other based on recursive case splitting. ...
Our findings also shed light on the remark of several researchers that splitting is especially effective in approximate reachability analysis. ...
Comparison to Prior Work Our work is related to the disjunctive partitioning approach of [6, 5, 19] . The common trait is the disjunctive decomposition of the problem. ...
doi:10.1145/337292.337305
dblp:conf/dac/MoonKRS00
fatcat:og6tfibaj5eqjod45atwq5bswe
Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions
[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 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a BDD based representation for Boolean functions, which extends conjunctive/disjunctive decompositions. ...
Besides targeting reduced BDD size, the theoretical advantage of this form over other decompositions is being closed under complementation, which makes Meta-BDDs applicable to a broader range of problems ...
Disjunction. is a less natural operation for conjunctive decompositions. ...
doi:10.1007/3-540-44585-4_11
fatcat:54acqojypreofm5pco63vcr2ja
Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
[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 2018; you can also visit the original URL.
The file type is application/pdf.
Based on the structure of the high-level model specification, we first disjunctively partition the transition relation of the system, then conjunctively partition each disjunct. ...
Compared to breadth-first symbolic methods, saturation has already been empirically shown to be several orders more efficient in terms of runtime and peak memory requirements for asynchronous concurrent ...
a function is inadequate when applied to the disjuncts of the transition relation. ...
doi:10.1007/11560548_13
fatcat:aqdhxvceyff3lhd2q44eimy67m
Variance analyses from invariance analyses
2007
SIGPLAN notices
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.
If we change the underlying invariance analysis, we get a different variance analysis. ...
An invariance assertion for a program location is a statement that always holds at during execution of the program. ...
grateful to Domagoj Babic, Nick Benton, Aaron Bradley, Andreas Blass, Patrick Cousot, Georges Gonthier, Alexey Gotsman, Arie Gurfinkel, Antoine Miné, Andreas Podelski, Helmut Veith and Hongseok Yang for ...
doi:10.1145/1190215.1190249
fatcat:e7egkqmt55f73dahlrbwxllz2e
« Previous
Showing results 1 — 15 out of 1,460 results