Filters








12,673 Hits in 3.3 sec

Models whose checks don't explode [chapter]

R. P. Kurshan
1994 Lecture Notes in Computer Science  
Automata-theoretic verification is based upon the language containment test L(P0 | P1 | | Pk) c Z(T) where the P,'s are automata which together model a system with its fairness constraints, | is a parallel  ...  model.  ...  Here, we assume this transformation, and address the check (*).  ... 
doi:10.1007/3-540-58179-0_57 fatcat:w5agnsorobggzhmv2xrpkbx5mu

Vulnerabilities Detection via Static Taint Analysis

N.V. Shimchik, V.N. Ignatyev
2019 Proceedings of the Institute for System Programming of RAS  
Unlike in known implementations and Flowdroid we don't store the whole exploded super graph, because it requires too much memory for regular industrial project with millions of lines of code even if this  ...  We don't have a working solution for security conditions checking right now, but for the purpose of proof of concept, we've implemented a simple addition to the current path confirmation checker, which  ... 
doi:10.15514/ispras-2019-31(3)-14 fatcat:4ukvhlrftndk5mhgklflbjpp2a

Williamson on indicatives and suppositional heuristics

Francesco Berto
2022 Synthese  
Reporting on the results of such control experiments (whose detailed setup can be checked in the original paper), they concluded: the answers do suggest that the notion of acceptability was interpreted  ...  For such an addition would convey the idea that 'If you don't open the refrigerator, it will not explode' is not acceptable for one; whereas, in the context, it clearly is.  ... 
doi:10.1007/s11229-022-03518-z pmid:35194257 pmcid:PMC8853152 fatcat:pgoo4vjr7veszlop7hw4uoxyde

Page 30 of Collier's: The National Weekly Vol. 53, Issue 15 [page]

1914 Collier's: The National Weekly  
Don’t go,” called Gifford. “Evenin’s young yet. We'll be lonesome if you hurry yourself off.” Then he exploded in a roar of laughter.  ...  Opposite him was an’ elderly male stranger of mild and benevolent aspect whose. necktie was a white bow, and on whose knees reposed a book with limp morocco covers.  ... 

Efficient Symbolic Simulation via Dynamic Scheduling, Don't Caring, and Case Splitting [chapter]

Viresh Paruthi, Christian Jacobi, Kai Weber
2005 Lecture Notes in Computer Science  
Unlike prior work in case splitting which focused upon variable cofactoring, our approach leverages the full power of our don't-caring solution and intelligently selects arbitrary functions to apply as  ...  When performing an exhaustive k-step bounded model check of the design, the symbolic simulator often outperforms SAT-based bounded model checking [16] , particularly when the number of inputs is not too  ...  targets without exploding in memory.  ... 
doi:10.1007/11560548_11 fatcat:xghg5ibjr5bujlzppd4ay5rfoa

Hinton & Nowlan's computational Baldwin effect revisit: Are we happy with it? Akira Imada

Akira Imada
2008 Informacijos mokslai  
The fact is, however, if the grid size explodes then we actually don't know how we make robot navigate as we like, even in a very simple world without no constraint such as corridors, walls or obstacles  ...  Though we still don't know this is biologically meaningful, this hypothesis once tried to be used to explain, "Why giraffe has a long neck?". Are we really happy with these models to find needle?  ... 
doi:10.15388/im.2008.0.3418 fatcat:zuwm65jbnjdnhioamet4mcgfse

Constraint synthesis for environment modeling in functional verification

Jun Yuan, Ken Albin, Adnan Aziz, Carl Pixley
2003 Proceedings of the 40th conference on Design automation - DAC '03  
Constraint synthesis falls in the general category of parametric Boolean equation solving but is novel in utilizing don't care information unique to hardware constraints and heuristic variable removal  ...  This movement is gaining popularity in industry and sparks research in the constraint-based environment modeling and stimulus generation problem.  ...  Constraint synthesis facilitates the application of this methodology in areas where parametric or synthesizable constraint solutions are required, e.g., in model checking and emulation.  ... 
doi:10.1145/775832.775909 dblp:conf/dac/YuanAAP03 fatcat:s33x2lapaba2xogtzx6blpx7ne

Constraint synthesis for environment modeling in functional verification

Jun Yuan, Ken Albin, Adnan Aziz, Carl Pixley
2003 Proceedings of the 40th conference on Design automation - DAC '03  
Constraint synthesis falls in the general category of parametric Boolean equation solving but is novel in utilizing don't care information unique to hardware constraints and heuristic variable removal  ...  This movement is gaining popularity in industry and sparks research in the constraint-based environment modeling and stimulus generation problem.  ...  Constraint synthesis facilitates the application of this methodology in areas where parametric or synthesizable constraint solutions are required, e.g., in model checking and emulation.  ... 
doi:10.1145/775905.775909 fatcat:wwn2hm2utnbd7gijuzoj74ngq4

On the Origin of Supernovae of Type Ib

David Branch
1988 International Astronomical Union Colloquium  
this: supernovae observed during their photospheric phases display three distinct kinds of spectra - but there are four distinct chemical compositions that should be considered for the outer layers of exploding  ...  The reason for a large non-LTE effect in the Wolf-Rayet model is not obvious; a possibility that needs to be checked for the white-dwarf model is non-LTE excitation caused by the decay products of the  ...  If Wolf-Rayet stars produce Type lb, they must reduce to 4 M e or less before they explode!  ... 
doi:10.1017/s0252921100094033 fatcat:477tpagrzjfupjirwfsbmsxyni

Concurrent LSC Verification

Tobe Toben, Bernd Westphal
2006 Electronical Notes in Theoretical Computer Science  
Thus by the wellknown complexity properties of CTL and LTL model-checking, the size of an LSC's POSA directly contributes to the runtime of the model-checking task.  ...  To check whether a model satisfies an LSC requirement, the LSC's POSA can be composed in parallel to the model as an observer automaton or it can be translated to a CTL or LTL formula.  ...  Our approach is different in that we don't devise a new model-checking algorithm but exploit properties of the automata used in LSC model-checking to decompose only the property.  ... 
doi:10.1016/j.entcs.2005.10.007 fatcat:gyuyrfbrqnfzvi6s7ha37k2zjm

Using an SMT solver and Craig interpolation to detect and remove redundant linear constraints in representations of non-convex polyhedra

Christoph Scholl, Stefan Disch, Florian Pigorsch, Stefan Kupferschmid
2008 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning - SMT '08/BPR '08  
The approach is evaluated both for formulas from the model checking context including boolean combinations of linear constraints and boolean variables and for random trees composed of quantifiers, AND-  ...  We worked in close cooperation with our colleagues from the 'First Order Model Checking team' within subproject H3 and we would like to thank W. Damm, H. Hungar, J. Pang, and B.  ...  Our Figure 1 : 1 The LinAIG structure show a typical example stemming from a model checking application.  ... 
doi:10.1145/1512464.1512469 fatcat:i47fyrtkdfhp3pdo43wauen5xe

Automatic reduction in CTL compositional model checking [chapter]

Thomas R. Shiple, Massimiliano Chiodo, Alberto L. Sangiovanni-Vincentelli, Robert K. Brayton
1993 Lecture Notes in Computer Science  
We describe a method for reducing the complexity of temporal logic model checking of a system of interacting finite state machines, and prove that it yields correct results.  ...  We have reformulated the single machine model checker computations to better suit our needs for compositional model checking (Section 4.1).  ...  Introduction Temporal logic model checking procedures are potentially powerful verification tools for finite state systems.  ... 
doi:10.1007/3-540-56496-9_19 fatcat:fcplzmvnvbgenp753nv3cja7w4

Ray Tracing Dynamic Scenes with Shadows on the GPU [article]

Sashidhar Guntury, P. J. Narayanan
2010 Eurographics Symposium on Parallel Graphics and Visualization  
In practice, we attain interactive performance for moderately large models which change dynamically in the scene.  ...  Spherical mapping is key to handling light sources placed anywhere in the scene by reducing the triangle count and improving performance in shadow checking.  ...  Scene Benchmarks for Exploding Dragon and Cloth models and Anat Grynberg and Greg Ward for the Conference Room Model.  ... 
doi:10.2312/egpgv/egpgv10/027-034 fatcat:zk2gt6yyprg7joiyjil3ksuhz4

Anti‐Counterfeiting Strategy Unfolded A Closer Look to the Case of a Large Multinational Manufacturer

Francesco Rullani, Karin Beukel, Matteo De Angelis
2021 Strategic Management Journal  
ACKNOWLEDGEMENTS The authors are thankful to the reviewers and the Associate Editor for having helped us to improve the paper, and especially the latter, whose effort and commitment in guiding us were  ...  or chargers exploding, I've seen some original batteries overheated, but not exploded.  ...  | Robustness checks In the Appendix, we detail several robustness checks, briefly reported here.  ... 
doi:10.1002/smj.3294 fatcat:euawq66w7zcuxiprphpgmajcr4

Logit Models for Sets of Ranked Items

Paul D. Allison, Nicholas A. Christakis
1994 Sociological methodology  
When there are only two items to be ranked, the exploded logit model is equivalent to both the cumulative logit model and the ordinary binary logit model. ?  ...  For either of these two models, all the techniques we have illustrated for the exploded logit model could, in principle, be applied.  ... 
doi:10.2307/270983 fatcat:lbzlergc4beaplpifzv274bdpa
« Previous Showing results 1 — 15 out of 12,673 results