4513 search results - page 518 / 903 » Logic programming with satisfiability |
135
click to vote
BIRTHDAY
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
157
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
171
Voted
SENSYS
2010
ACM
15 years 2 months ago
2010
ACM
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
127
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
112
click to vote
LPAR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The use of formal methods provides confidence in the correctness of developments. Yet one may argue about the actual level of confidence obtained when the method itself...