Sciweavers

1157 search results - page 78 / 232
» Descriptive Complexity and Model Checking
Sort
View
APSEC
2007
IEEE
15 years 1 months ago
Deriving Software Process Simulation Model from SPEM-based Software Process Model
It is difficult to adopt a simulation technology for simulating a software process because of the difficulty in developing a simulation model. In order to resolve the difficulty, ...
Seunghun Park, KeungSik Choi, Kyung-A Yoon, Doo-Hw...
ICFEM
2009
Springer
15 years 4 months ago
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
Péter Bokor, Marco Serafini, Neeraj Suri, H...
DLOG
2004
14 years 11 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
CORR
2010
Springer
119views Education» more  CORR 2010»
14 years 4 months ago
Effective complexity of stationary process realizations
The concept of effective complexity of an object as the minimal description length of its regularities has been initiated by Gell-Mann and Lloyd. The regularities are modeled by m...
Nihat Ay, Markus Müller, Arleta Szkola
ICDE
2011
IEEE
220views Database» more  ICDE 2011»
14 years 1 months ago
Generating test data for killing SQL mutants: A constraint-based approach
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
Shetal Shah, S. Sudarshan, Suhas Kajbaje, Sandeep ...