245 search results - page 25 / 49 » Efficient Symbolic Model Checking for Process Algebras |
79
Voted
CADE
2004
Springer
15 years 9 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
99
Voted
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
QEST
2010
IEEE
14 years 7 months ago
2010
IEEE
The method of stochastic state classes approaches the analysis of Generalised Semi Markov Processes (GSMP) through symbolic derivation of probability density functions over Differe...
60
Voted
DAC
2005
ACM
15 years 10 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
164
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...