Sciweavers

981 search results - page 75 / 197
» Symbolic pointer analysis
Sort
View
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 11 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
CAV
2010
Springer
194views Hardware» more  CAV 2010»
14 years 26 days ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
BMCBI
2007
181views more  BMCBI 2007»
13 years 9 months ago
Genes2Networks: connecting lists of gene symbols using mammalian protein interactions databases
Background: In recent years, mammalian protein-protein interaction network databases have been developed. The interactions in these databases are either extracted manually from lo...
Seth I. Berger, Jeremy M. Posner, Avi Ma'ayan
JACM
2000
119views more  JACM 2000»
13 years 8 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 2 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle