default search action
Formal Methods in System Design, Volume 40
Volume 40, Number 1, February 2012
- Stephen F. Siegel:
Transparent partial order reduction. 1-19 - Ilan Beer, Shoham Ben-David, Hana Chockler, Avigail Orni, Richard J. Trefler:
Explaining counterexamples using causality. 20-40 - Béatrice Bérard, Serge Haddad, Mathieu Sassolas:
Interrupt Timed Automata: verification and expressiveness. 41-87 - Franck Cassez, Jérémy Dubreil, Hervé Marchand:
Synthesis of opaque systems with static and dynamic masks. 88-115
Volume 40, Number 2, April 2012
- Orna Grumberg, Moshe Y. Vardi, Joseph Sifakis, Rajeev Alur:
2010 CAV award announcement. 117-120 - Tayssir Touili:
Preface. 121 - Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Efficient emptiness check for timed Büchi automata. 122-146 - Satrajit Chatterjee, Michael Kishinevsky:
Automatic generation of inductive invariants from high-level microarchitectural models of communication fabrics. 147-169 - Jade Alglave, Luc Maranget, Susmit Sarkar, Peter Sewell:
Fences in weak memory models (extended version). 170-205 - Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Bounded underapproximations. 206-231 - Rüdiger Ehlers:
Symbolic bounded synthesis. 232-262 - Susanne Graf, Doron A. Peled, Sophie Quinton:
Achieving distributed control through model checking. 263-281
Volume 40, Number 3, June 2012
- Michael Mendler, Thomas R. Shiple, Gérard Berry:
Constructive Boolean circuits and the exactness of timed ternary simulation. 283-329 - Sandie Balaguer, Thomas Chatain, Stefan Haar:
A concurrency-preserving translation from time Petri nets to networks of timed automata. 330-355 - Silvia Crafa, Francesco Ranzato:
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation. 356-376
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.