253 search results - page 27 / 51 » How to Transform an Analyzer into a Verifier |
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
TSMC
2011
13 years 2 months ago
2011
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...
ISPW
2009
IEEE
14 years 2 months ago
2009
IEEE
Web service orchestration is popular because the application logic is defined from a central and unique point of view, but it suffers from scalability issues. In choreography, the ...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
The electronic markets hypothesis (EMH) in the information systems (IS) literature suggests that information technology (IT) will reduce coordination costs across firms, leading t...
ATAL
2003
Springer
14 years 23 days ago
2003
Springer
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...