783 search results - page 61 / 157 » Compositional Reasoning in Model Checking |
111
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
112
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
111
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
140
click to vote
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
128
Voted
COORDINATION
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Constraint automata have been used as an operational model for component connectors that coordinate the cooperation and communication of the components by means of a netw...