1743 search results - page 150 / 349 » Generalized Modal Satisfiability |
110
click to vote
KIC
2000
15 years 4 months ago
2000
Designers, in the process of satisfying design requirements, generally encounter difficulties in, firstly, understanding the problem and secondly, finding a solution [Cross 1998]....
125
Voted
SAC
2010
ACM
15 years 3 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...
154
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
147
Voted
IANDC
2008
15 years 3 months ago
2008
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
122
click to vote
JSAT
2006
15 years 3 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...