Sciweavers

334 search results - page 16 / 67
» A parametric analysis of the state-explosion problem in mode...
Sort
View
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 9 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
CAV
2006
Springer
110views Hardware» more  CAV 2006»
13 years 11 months ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
SPIN
2000
Springer
13 years 11 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai
BMCBI
2005
99views more  BMCBI 2005»
13 years 7 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
PLDI
2006
ACM
14 years 1 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa