Sciweavers

933 search results - page 39 / 187
» Extending Forward Checking
Sort
View
FMCAD
2004
Springer
14 years 1 months ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
ADBIS
2004
Springer
92views Database» more  ADBIS 2004»
14 years 7 days ago
Optimal Database Locks for Efficient Integrity Checking
Abstract. In concurrent database systems, correctness of update transactions refers to the equivalent effects of the execution schedule and some serial schedule over the same set o...
Davide Martinenghi
ESAW
2006
Springer
14 years 5 days ago
Competence Checking for the Global E-Service Society Using Games
Abstract. We study the problem of checking the competence of communicative agents operating in a global society in order to receive and offer electronic services. Such a society wi...
Kostas Stathis, George Lekeas, Christos Kloukinas
FORMATS
2006
Springer
14 years 5 days ago
Model Checking Timed Automata with Priorities Using DBM Subtraction
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Alexandre David, John Håkansson, Kim Guldstr...
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 8 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba