Sciweavers

254 search results - page 51 / 51
» Model Checking Branching Time Logics
Sort
View
CIE
2007
Springer
13 years 11 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
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 3 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
3DGIS
2006
Springer
13 years 11 months ago
3D Geometries in Spatial DBMS
Database management systems (DBMS) have significantly changed in the last several years. From a system dealing with management of administrative data they have involved to a spati...
Sisi Zlatanova
KBSE
2005
IEEE
13 years 11 months ago
Automated test generation for engineering applications
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
Songtao Xia, Ben Di Vito, César Muño...