506 search results - page 73 / 102 » Where Is the Value in a Program Verifier |
92
Voted
GCC
2003
Springer
15 years 5 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
94
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
103
Voted
IJCAI
2007
15 years 1 months ago
2007
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
108
Voted
Publication
Most implementations of the language Refal represent ground expressions by doubly-linked lists, which results in low-cost concatenation. On the other hand, that representation nece...
112
click to vote
ASPLOS
2012
ACM
13 years 8 months ago
2012
ACM
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...