Sciweavers

783 search results - page 61 / 157
» Compositional Reasoning in Model Checking
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Reasoning about strategies of multi-agent programs
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...
Mehdi Dastani, Wojciech Jamroga
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 9 months ago
Concurrent general composition of secure protocols in the timing model
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...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
ICALP
2000
Springer
14 years 19 days ago
Decidable First-Order Transition Logics for PA-Processes
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...
Denis Lugiez, Ph. Schnoebelen
LPNMR
2004
Springer
14 years 2 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
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â...
Thomas Eiter, Axel Polleres
COORDINATION
2006
Springer
14 years 23 days ago
Stochastic Reasoning About Channel-Based Component Connectors
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...
Christel Baier, Verena Wolf