Sciweavers

602 search results - page 111 / 121
» Efficient Model Checking of Applications with Input Output
Sort
View
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
VLDB
2002
ACM
110views Database» more  VLDB 2002»
13 years 7 months ago
Extending an ORDBMS: The StateMachine Module
Extensibility is one of the mayor benefits of object-relational database management systems. We have used this system property to implement a StateMachine Module inside an object-...
Wolfgang Mahnke, Christian Mathis, Hans-Peter Stei...
CVPR
1998
IEEE
14 years 9 months ago
Action Recognition Using Probabilistic Parsing
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
Aaron F. Bobick, Yuri A. Ivanov
EUROSYS
2009
ACM
14 years 4 months ago
Dingo: taming device drivers
Device drivers are notorious for being a major source of failure in operating systems. In analysing a sample of real defects in Linux drivers, we found that a large proportion (39...
Leonid Ryzhyk, Peter Chubb, Ihor Kuz, Gernot Heise...
ESEM
2007
ACM
13 years 11 months ago
A Critical Analysis of Empirical Research in Software Testing
In the foreseeable future, software testing will remain one of the best tools we have at our disposal to ensure software dependability. Empirical studies are crucial to software t...
Lionel C. Briand