7. VMCAI 2006: Charleston, SC, USA

• Peter Schachte, Harald Søndergaard:
  Closure Operators for ROBDDs. 1-16
  Electronic Edition (link) BibTeX
• Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
  A CLP Method for Compositional and Intermittent Predicate Abstraction. 17-32
  Electronic Edition (link) BibTeX
• Gilad Arnold, Roman Manevich, Mooly Sagiv, Ran Shaham:
  Combining Shape Analyses by Intersecting Abstractions. 33-48
  Electronic Edition (link) BibTeX
• Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
  A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. 49-64
  Electronic Edition (link) BibTeX
• Laura Bozzelli:
  Complexity Results on Branching-Time Pushdown Model Checking. 65-79
  Electronic Edition (link) BibTeX
• Gang Tan, Andrew W. Appel:
  A Compositional Logic for Control Flow. 80-94
  Electronic Edition (link) BibTeX
• Stefano Rossignoli, Fausto Spoto:
  Detecting Non-cyclicity by Abstract Compilation into Boolean Functions. 95-110
  Electronic Edition (link) BibTeX
• Sriram Sankaranarayanan, Michael Colón, Henny B. Sipma, Zohar Manna:
  Efficient Strongly Relational Polyhedral Analysis. 111-125
  Electronic Edition (link) BibTeX
• Edmund M. Clarke, Muralidhar Talupur, Helmut Veith:
  Environment Abstraction for Parameterized Verification. 126-141
  Electronic Edition (link) BibTeX
• Håkan L. S. Younes:
  Error Control for Probabilistic Model Checking. 142-156
  Electronic Edition (link) BibTeX
• Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin C. Rinard:
  Field Constraint Analysis. 157-173
  Electronic Edition (link) BibTeX
• Bor-Yuh Evan Chang, Adam J. Chlipala, George C. Necula:
  A Framework for Certified Program Analysis and Its Applications to Mobile-Code Safety. 174-189
  Electronic Edition (link) BibTeX
• Katia Hristova, Yanhong A. Liu:
  Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems. 190-206
  Electronic Edition (link) BibTeX
• Jesse D. Bingham, Zvonimir Rakamaric:
  A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs. 207-221
  Electronic Edition (link) BibTeX
• A. Prasad Sistla, Min Zhou, Lenore D. Zuck:
  Monitoring Off-the-Shelf Components. 222-236
  Electronic Edition (link) BibTeX
• Shahid Jabbar, Stefan Edelkamp:
  Parallel External Directed Model Checking with Linear I/O. 237-251
  Electronic Edition (link) BibTeX
• Naghmeh Ghafari, Richard J. Trefler:
  Piecewise FIFO Channels Are Analyzable. 252-266
  Electronic Edition (link) BibTeX
• Ittai Balaban, Ariel Cohen, Amir Pnueli:
  Ranking Abstraction of Recursive Programs. 267-281
  Electronic Edition (link) BibTeX
• Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
  Relative Safety. 282-297
  Electronic Edition (link) BibTeX
• Naoki Kobayashi, Kohei Suenaga, Lucian Wischik:
  Resource Usage Analysis for the pi-Calculus. 298-312
  Electronic Edition (link) BibTeX
• Francesco Logozzo, Agostino Cortesi:
  Semantic Hierarchy Refactoring by Abstract Interpretation. 313-331
  Electronic Edition (link) BibTeX
• Francesco Ranzato, Francesco Tapparo:
  Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation. 332-347
  Electronic Edition (link) BibTeX
• Antoine Miné:
  Symbolic Methods to Enhance the Precision of Numerical Abstract Domains. 348-363
  Electronic Edition (link) BibTeX
• Nir Piterman, Amir Pnueli, Yaniv Sa'ar:
  Synthesis of Reactive(1) Designs. 364-380
  Electronic Edition (link) BibTeX
• Arie Gurfinkel, Ou Wei, Marsha Chechik:
  Systematic Construction of Abstractions for Model-Checking. 381-397
  Electronic Edition (link) BibTeX
• K. Subramani:
  Totally Clairvoyant Scheduling with Relative Timing Constraints. 398-411
  Electronic Edition (link) BibTeX
• Laura Bozzelli, Salvatore La Torre, Adriano Peron:
  Verification of Well-Formed Communicating Recursive State Machines. 412-426
  Electronic Edition (link) BibTeX
• Aaron R. Bradley, Zohar Manna, Henny B. Sipma:
  What's Decidable About Arrays? 427-442
  Electronic Edition (link) BibTeX