Volume 13, Number 1, January 2011

• 
  Corina S. Pasareanu: New results in software model checking and analysis. 1-2
• 
  Ernst Moritz Hahn, Holger Hermanns, Lijun Zhang: Probabilistic reachability for parametric Markov models. 3-19
• 
  Dragan Bosnacki, Stefan Edelkamp, Damian Sulewski, Anton Wijs: Parallel probabilistic model checking on general purpose graphics processors. 21-35
• 
  Nicholas Kidd, Peter Lammich, Tayssir Touili, Thomas W. Reps: A decision procedure for detecting atomicity violations for communicating processes with locks. 37-60
• 
  Junghee Lim, Akash Lal, Thomas W. Reps: Symbolic analysis via semantic reinterpretation. 61-87
• 
  Sebastian Schmerl, Michael Vogel, Hartmut König: Using model checking to identify errors in intrusion detection signatures. 89-106

Volume 13, Number 2, April 2011

• 
  Ying Zou, Ji Wu, Kenny Wong: Guest editors' introduction to the special section from the international symposium on web systems evolution. 107-109
• 
  Kinga Dobolyi, Elizabeth Soechting, Westley Weimer: Automating regression testing using web-based application similarities. 111-129
• 
  Alessandro Marchetto, Roberto Tiella, Paolo Tonella, Nadia Alshahwan, Mark Harman: Crawlability metrics for automated web testing. 131-149
• 
  Marco Torchiano, Filippo Ricca, Alessandro Marchetto: Are web applications more defect-prone than desktop applications? 151-166
• 
  Adina D. Mosincat, Walter Binder: Automated maintenance of service compositions with SLA violation detection and dynamic binding. 167-179
• 
  Marco D'Ambros, Michele Lanza, Mircea Lungu, Romain Robbes: On porting software visualization tools to the web. 181-200

Volume 13, Number 3, June 2011

• 
  Hana Chockler, Alan J. Hu: Preface. 201-205
• 
  Yoram Adler, Dale Blue, Thomas Conti, Richard Prewitt, Shmuel Ur: Evaluating workloads using comparative functional coverage. 207-221
• 
  Cyrille Artho: Iterative delta debugging. 223-246
• 
  Dorit Baras, Shai Fine, Laurent Fournier, Dan Geiger, Avi Ziv: Automatic boosting of cross-product coverage using Bayesian networks. 247-261
• 
  Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman: Reducing the size of resolution proofs in linear time. 263-272
• 
  Kerstin Bauer, Raffaella Gentilini, Klaus Schneider: A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata. 273-287

Volume 13, Number 4, August 2011

• 
  Harald Fecher, Sharon Shoham: Local abstraction-refinement for the μ-calculus. 289-306
• 
  Lei Bu, Xuandong Li: Path-oriented bounded reachability analysis of composed linear hybrid systems. 307-317
• 
  Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vardi: Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking. 319-335
• 
  Liana Barachisio Lisboa, Vinicius Cardoso Garcia, Eduardo Santana de Almeida, Silvio Romero de Lemos Meira: ToolDAy: a tool for domain analysis. 337-353
• 
  Qiang Guo, John Derrick: Formally based tool support for model checking Erlang applications. 355-376
• 
  Olga Brukman, Shlomi Dolev: Recovery oriented programming: runtime monitoring of safety and liveness. 377-395

Volume 13, Number 5, October 2011

• 
  Jean-Christophe Filliâtre: Deductive software verification. 397-403
• 
  Pascal Cuoq, Benjamin Monate, Anne Pacalet, Virgile Prevosto: Functional dependencies of C functions via weakest pre-conditions. 405-417
• 
  Tjark Weber: SMT solvers: new oracles for the HOL theorem prover. 419-429
• 
  Kalou Cabrera Castillos, Frédéric Dadeau, Jacques Julliand: Scenario-based testing from UML/OCL behavioral models - Application to POSIX compliance. 431-448
• 
  Daisuke Ishii, Kazunori Ueda, Hiroshi Hosobe: An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systems. 449-461
• 
  Leo Freitas, John P. McDermott: Formal methods for security in the Xenon hypervisor. 463-489

Volume 13, Number 6, November 2011

• 
  Neil D. Jones, Markus Müller-Olm: Preface to a special section on verification, model checking, and abstract interpretation. 491-493
• 
  Nicholas Kidd, Thomas W. Reps, Julian Dolby, Mandana Vaziri: Finding concurrency-related bugs using random isolation. 495-518
• 
  Ankur Taly, Sumit Gulwani, Ashish Tiwari: Synthesizing switching logic using constraint solving. 519-535
• 
  Kousha Etessami, Patrice Godefroid: An abort-aware model of transactional programming. 537-551
• 
  Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski: Average-price-per-reward games on hybrid automata with strong resets. 553-569
• 
  Patrice Godefroid, Nir Piterman: LTL generalized model checking revisited. 571-584
• 
  Vincent Laviron, Francesco Logozzo: SubPolyhedra: a family of numerical abstract domains for the (more) scalable inference of linear inequalities. 585-601

last updated on Wed May 22 06:09:41 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page