Formal Methods in System Design, Volume 31

Volume 31, Number 1, August 2007

• Roberto Passerone, Jerry R. Burch, Alberto L. Sangiovanni-Vincentelli:
  Refinement preserving approximations for the design and verification of heterogeneous systems. 1-33
  Electronic Edition (link) BibTeX
• Abhay Vardhan, Mahesh Viswanathan:
  Learning to verify branching time properties. 35-61
  Electronic Edition (link) BibTeX
• Gianfranco Ciardo, Gerald Lüttgen, Andrew S. Miner:
  Exploiting interleaving semantics in symbolic state-space generation. 63-100
  Electronic Edition (link) BibTeX

Volume 31, Number 2, October 2007

• Béatrice Bérard, Paul Gastin, Antoine Petit:
  Timed substitutions for regular signal-event languages. 101-134
  Electronic Edition (link) BibTeX
• Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
  On the optimal reachability problem of weighted timed automata. 135-175
  Electronic Edition (link) BibTeX
• Roberto Sebastiani, Eli Singerman, Stefano Tonetta, Moshe Y. Vardi:
  GSTE is partitioned model checking. 177-196
  Electronic Edition (link) BibTeX

Volume 31, Number 3, December 2007

• A. Prasad Sistla, Xiaodong Wang, Min Zhou:
  Checking extended CTL properties using guarded quotient structures. 197-219
  Electronic Edition (link) BibTeX
• Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump:
  Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006). 221-239
  Electronic Edition (link) BibTeX
• Zoltán Ádám Mann, András Orbán, Péter Arató:
  Finding optimal hardware/software partitions. 241-263
  Electronic Edition (link) BibTeX
• Salvatore La Torre, Margherita Napoli, Mimmo Parente:
  The word problem for visibly pushdown languages described by grammars. 265-279
  Electronic Edition (link) BibTeX
• Thuan Quang Huynh, Abhik Roychoudhury:
  Memory model sensitive bytecode verification. 281-305
  Electronic Edition (link) BibTeX