MOCHA

MOCHA: Modularity in Model Checking. MOCHA is a growing interactive software environment for system specification and verification. The main objective of MOCHA is to exploit, rather than destroy, design structure in automatic verification. MOCHA is intended as a vehicle for development of new verification algorithms and approaches. MOCHA is available in two versions, cMocha (Version 1.0.1) and jMocha (Version 2.0).

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 92 articles )

Showing results 21 to 40 of 92.
Sorted by year (citations)
  1. Pilecki, Jerzy; Bednarczyk, Marek A.; Jamroga, Wojciech: Synthesis and verification of uniform strategies for multi-agent systems (2014)
  2. Chen, Taolue; Forejt, Vojtěch; Kwiatkowska, Marta; Parker, David; Simaitis, Aistis: Automatic verification of competitive stochastic systems (2013)
  3. Chen, Taolue; Forejt, Vojtěch; Kwiatkowska, Marta; Parker, David; Simaitis, Aistis: PRISM-games: a model checker for stochastic multi-player games (2013)
  4. Chatterjee, Krishnendu; Raman, Vishwanath: Synthesizing protocols for digital contract signing (2012)
  5. Alechina, Natasha; Logan, Brian; Nguyen, Hoang Nga; Rakib, Abdur: Automated verification of resource requirements in multi-agent systems using abstraction (2011) ioport
  6. Chareton, Christophe; Brunel, Julien; Chemouil, David: A formal treatment of agents, goals and operations using alternating-time temporal logic (2011)
  7. Dechesne, Francien; Wang, Yanjing: To know or not to know: Epistemic approaches to security protocol verification (2010)
  8. Alechina, Natasha; Logan, Brian; Nguyen Hoang Nga; Rakib, Abdur: Expressing properties of coalitional ability under resource bounds (2009)
  9. Alechina, Natasha; Logan, Brian; Nguyen Hoang Nga; Rakib, Abdur: Verifying time and communication costs of rule-based reasoners (2009)
  10. Alechina, Natasha; Logan, Brian; Nguyen, Hoang Nga; Rakib, Abdur: Verifying time, memory and communication bounds in systems of reasoning agents (2009)
  11. Boella, Guido; Sauro, Luigi; van der Torre, Leendert: Algorithms for finding coalitions exploiting a new reciprocity condition (2009)
  12. Ruan, Ji; van der Hoek, Wiebe; Wooldridge, Michael: Verification of games in the game description language (2009)
  13. Jamroga, Wojciech; Dix, Jürgen: Model checking abilities of agents: a closer look (2008)
  14. Nam, Wonhong; Madhusudan, P.; Alur, Rajeev: Automatic symbolic compositional verification by learning assumptions (2008)
  15. Păsăreanu, Corina S.; Giannakopoulou, Dimitra; Bobaru, Mihaela Gheorghiu; Cobleigh, Jamieson M.; Barringer, Howard: Learning to divide and conquer: applying the (L^*) algorithm to automate assume-guarantee reasoning (2008)
  16. Slanina, Matteo; Sipma, Henny B.; Manna, Zohar: Deductive verification of alternating systems (2008)
  17. Braunstein, Cécile; Encrenaz, Emmanuelle: CTL-property transformations along an incremental design process (2007) ioport
  18. Bugaichenko, D. Yu.; Solov’ev, I. P.: Logical formalism for specification of real-time multiagent systems (2007)
  19. Clarke, Edmund; Jain, Himanshu; Kroening, Daniel: Verification of SpecC using predicate abstraction (2007)
  20. Dunne, Paul E.; van der Hoek, Wiebe; Wooldridge, Michael: A logical characterisation of qualitative coalitional games (2007)