15792 search results - page 163 / 3159 » Computational Abstraction Steps |
TPHOL
1998
IEEE
14 years 1 months ago
1998
IEEE
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
FM
1994
Springer
14 years 1 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
PCM
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Efficient data mining for digital video has become increasingly important in recent years. In this paper, we present a new scheme for automatic detection of slow-motion r...
CLEF
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In this paper, we present an unsupervised algorithm for morpheme discovery called UNGRADE (UNsupervised GRAph DEcomposition). UNGRADE works in three steps and can be appl...