Filters








10,364 Hits in 8.2 sec

Efficient Guided Symbolic Reachability Using Reachability Expressions [chapter]

Dina Thomas, Supratik Chakraborty, Paritosh Pandya
2006 Lecture Notes in Computer Science  
We present a theory of guiding symbolic reachability in such systems by scheduling clusters of transitions. A theory of reachability expressions which specify the schedules is presented.  ...  A variant tool called NuSMV-DP has been developed for interpreting reachability expressions to carry out the experiments.  ...  Importantly, they allow us to encode more efficient ways of computing the set of reachable states than symbolic breadth-first search.  ... 
doi:10.1007/11691372_8 fatcat:oxtp76jb2jc7dfwdn3osw56z6a

An Efficient 2-Phase Strategy to Achieve High Branch Coverage

Sarvesh Prabhu, Michael S. Hsiao, Saparya Krishnamoorthy, Loganathan Lingappan, Vijay Gangaram, Jim Grundy
2011 2011 Asian Test Symposium  
An Efficient 2-Phase Strategy to Achieve High Branch Coverage Sarvesh Prabhu (ABSTRACT) Symbolic execution-based test generation is gaining popularity for software test generation.  ...  We present a new 2-phase symbolic execution driven strategy that achieves high branch coverage in software  ...  DFS-based reachability-guided strategy A DFS based reachability guided strategy proposed in [27] performs branch coverage using the static reachability graph of a program.  ... 
doi:10.1109/ats.2011.83 dblp:conf/ats/PrabhuHKLGG11 fatcat:biqffzobtzghnciv5jnxl36tye

A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx [chapter]

Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski, Martin Wehrle
2012 Lecture Notes in Computer Science  
We have implemented the algorithm in SpaceEx and use it for guiding the region-based reachability analysis of SpaceEx.  ...  The question is whether the technique can be carried over to reachability analyses that use regions as their basic data structure.  ...  Obviously, to obtain an overall efficient model checking approach, cost measures are both supposed to guide the search accurately and to be efficiently computable.  ... 
doi:10.1007/978-3-642-31424-7_35 fatcat:t3ulqzyyxjh2vbqdo2b2xmaolu

Abstraction-Based Guided Search for Hybrid Systems [chapter]

Sergiy Bogomolov, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor T. Johnson, Hamed Ladan, Andreas Podelski, Martin Wehrle
2013 Lecture Notes in Computer Science  
In this paper, we introduce an abstraction-based cost function based on pattern databases for guiding the reachability analysis.  ...  A recent approach in this direction is based on guided search.  ...  This partial PDB is then used as the cost function of our guided reachability algorithm.  ... 
doi:10.1007/978-3-642-39176-7_8 fatcat:s47gdfgnkzbwfnzvx4b44utc2q

A user guide to HyTech [chapter]

Thomas A. Henzinger, Pei -Hsin Ho, Howard Wong-Toi
1995 Lecture Notes in Computer Science  
The guide gives several examples of usage, and some hints for gaining maximal computational efficiency from the tool.  ...  This document, designed for the first-time user of HYTECH, guides the reader through the underlying system model, and through the input language for describing and analyzing systems.  ...  Boolean expressions are used in conditional statements and while loops. The symbol (booLexp) denotes an arbitrary boolean expression.  ... 
doi:10.1007/3-540-60630-0_3 fatcat:ojtnfhyvbbblzct4jk6kiiwho4

Decomposing image computation for symbolic reachability analysis using control flow information

David Ward, Fabio Somenzi
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
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 use of control-flow information to speed up model checking was advocated in [9, 34] ; the latter uses the control flow graph to guide symbolic guided search.  ... 
doi:10.1145/1233501.1233662 dblp:conf/iccad/WardS06 fatcat:wvc32tfelbdhfda6cmimyitdii

Decomposing Image Computation for Symbolic Reachability Analysis Using Control Flow Information

David Ward, Fabio Somenzi
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
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 use of control-flow information to speed up model checking was advocated in [9, 34] ; the latter uses the control flow graph to guide symbolic guided search.  ... 
doi:10.1109/iccad.2006.320120 fatcat:lelilfmqcjcehpca4qnbm3zjny

As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata [chapter]

Kim Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, Judi Romijn
2001 Lecture Notes in Computer Science  
This, together with a notion of facets of a zone, allows the entire machinery for symbolic reachability for timed automata in terms of zones to be lifted to cost-optimal reachability using priced zones  ...  In this paper we present an algorithm for efficiently computing optimal cost of reaching a goal state in the model of Linearly Priced Timed Automata (LPTA).  ...  An interesting idea for model checking of reachability properties that has received more attention recently is to "guide" the exploration of the (symbolic) state space such that "promising" sets of states  ... 
doi:10.1007/3-540-44585-4_47 fatcat:xikfqzpkuralrgdjpuenw7xlki

Analyzing recursive programs using a fixed-point calculus

Salvatore La Torre, Madhusudan Parthasarathy, Gennaro Parlato
2009 Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09  
Moreover, we implement these algorithms in a tool called GETAFIX which expresses algorithms as fixed-point formulae and evaluates them efficiently using a symbolic fixed-point solver called MUCKE.  ...  We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a fixed-point calculus.  ...  us with TERMINATOR benchmarks, and Ella Bounimova and Tom Ball for their technical support on the tool BEBOP.  ... 
doi:10.1145/1542476.1542500 dblp:conf/pldi/TorreMP09 fatcat:b7a2tnqcdrdltloiaqzwaebiei

Analyzing recursive programs using a fixed-point calculus

Salvatore La Torre, Madhusudan Parthasarathy, Gennaro Parlato
2009 SIGPLAN notices  
Moreover, we implement these algorithms in a tool called GETAFIX which expresses algorithms as fixed-point formulae and evaluates them efficiently using a symbolic fixed-point solver called MUCKE.  ...  We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a fixed-point calculus.  ...  us with TERMINATOR benchmarks, and Ella Bounimova and Tom Ball for their technical support on the tool BEBOP.  ... 
doi:10.1145/1543135.1542500 fatcat:pxvmoqd23ngnfdbozjhuoqx6ui

Memoized symbolic execution

Guowei Yang, Corina S. Păsăreanu, Sarfraz Khurshid
2012 Proceedings of the 2012 International Symposium on Software Testing and Analysis - ISSTA 2012  
This paper introduces memoized symbolic execution (Memoise), a new approach for more efficient application of forward symbolic execution, which is a well-studied technique for systematic exploration of  ...  Experiments using our prototype implementation of Memoise show the benefits it holds in various standard scenarios of using symbolic execution, e.g., with iterative deepening of exploration depth, to perform  ...  However, since symbolic execution at depth 60 covered error 2, leaving error 1 as the only target, we used reachability heuristic to guide the symbolic execution to cover error 1.  ... 
doi:10.1145/2338965.2336771 dblp:conf/issta/YangPK12 fatcat:ijx2rnl7gzfdja7fc6mbpk6h4u

Symbolic Domain Predictive Control

Johannes Löhr, Martin Wehrle, Maria Fox, Bernhard Nebel
2014 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In this paper, we extend the approach to deal with symbolic states.  ...  Planning-based methods to guide switched hybrid systems from an initial state into a desired goal region opens an interesting field for control.  ...  We use set representations from reachability analysis to handle the resulting symbolic analysis of the reachable states.  ... 
doi:10.1609/aaai.v28i1.9027 fatcat:fngpxd7slfgvrf26unadcw7k7i

Hints to Accelerate Symbolic Traversal [chapter]

Kavita Ravi, Fabio Somenzi
1999 Lecture Notes in Computer Science  
We present an algorithm for guided traversal and discuss its efficient implementation.  ...  In this paper we show that the use of hints to guide the exploration of the state space may result in orders-of-magnitude reductions in time and space requirements.  ...  Guided Symbolic Traversal Using Hints We address the main problem of traversal-large intermediate BDD sizes during image computation.  ... 
doi:10.1007/3-540-48153-2_19 fatcat:4uoidnl3lndmvlz4ov336frfzq

Efficient Decision Procedures for Model Checking of Linear Time Logic Properties [chapter]

Roderick Bloem, Kavita Ravi, Fabio Somenzi
1999 Lecture Notes in Computer Science  
We propose an algorithm for LTL model checking based on the classification of the automata and on guided symbolic search.  ...  However, we classify the tableaux according to their structure, and use efficient decision procedures for each class.  ...  Our second contribution is the extension of guided symbolic search from reachability analysis [32] to LTL model checking.  ... 
doi:10.1007/3-540-48683-6_21 fatcat:z2kfkg4syrbklb7zn7g2ybgmsy

Strategies for scalable symbolic execution-driven test generation for programs

Saparya Krishnamoorthy, Michael S. Hsiao, Loganathan Lingappan
2011 Science China Information Sciences  
We present a reachability-guided strategy that makes use of the reachability graph of the program to explore unvisited portions of the program and a conflict-driven backtracking strategy that utilizes  ...  With the advent of advanced program analysis and constraint solving techniques, several test generation tools use variants of symbolic execution.  ...  In symbolic execution, a program is executed on symbolic inputs: The execution of an assignment statement updates the program state with symbolic expressions and the execution of a condition expression  ... 
doi:10.1007/s11432-011-4368-7 fatcat:ul63q3h23jejdi272h7zvso67m
« Previous Showing results 1 — 15 out of 10,364 results