Sciweavers

322 search results - page 11 / 65
» Symbolic model checking of institutions
Sort
View
ADBIS
2001
Springer
112views Database» more  ADBIS 2001»
14 years 7 days ago
Detecting Termination of Active Database Rules Using Symbolic Model Checking
One potential problem of active database applications is the non-termination of rules. Although algorithms have been proposed to detect non-termination, almost all provide a conser...
Indrakshi Ray, Indrajit Ray
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
SEKE
2005
Springer
14 years 1 months ago
Institution Morphisms for Relating OWL and Z
Checking for properties of Web ontologies is important for the development of reliable Semantic Web systems. Software specification and verification tools can be used to complem...
Dorel Lucanu, Yuan-Fang Li, Jin Song Dong
RTSS
1995
IEEE
13 years 11 months ago
Compositional and Symbolic Model-Checking of Real-Time Systems
E cient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. Howe...
Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
DAC
1999
ACM
14 years 8 months ago
Symbolic Model Checking Using SAT Procedures instead of BDDs
Armin Biere, Alessandro Cimatti, Edmund M. Clarke,...