1157 search results - page 157 / 232 » Descriptive Complexity and Model Checking |
FC
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
AAAI
2007
13 years 11 months ago
2007
In this paper, we consider the problem of composing a set of web services, where the requirements are specified in terms of the input and output messages of the composite workfl...
LOGCOM
2008
13 years 8 months ago
2008
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
DIMACS
1996
13 years 10 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
SAC
2010
ACM
13 years 9 months ago
2010
ACM
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...