245 search results - page 19 / 49 » Efficient Symbolic Model Checking for Process Algebras |
FOSSACS
2005
Springer
15 years 3 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
FM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
FAC
2008
14 years 9 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
ng Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation Yan Chen Dept. of Computer Science Portland State University Portland, OR, 97207 chenyan@cs.pdx.e...
QEST
2007
IEEE
15 years 3 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...