Abstract is missing.
- Number-Set Representations for Infinite-State VerificationBernard Boigelot. 1-16
- Regular Model Checking for Programs with Dynamic MemoryAhmed Bouajjani. 17-22
- Automatic Verification of Security Properties Based on AbstractionsLiana Bozga, Cristian Ene, Romain Janvier, Yassine Lakhnech, Laurent Mazaré, Michaël Périn. 23-53
- Grand Challenge: Model Check SoftwareEdmund M. Clarke, Himanshu Jain, Nishant Sinha. 55-68
- A Class of Automata for Computing Reachability Relations in Timed SystemsCatalin Dima. 69-89
- Practical Infinite-State Verification with Temporal ReasoningMichael Fisher, Boris Konev, Alexei Lisitsa. 91-100
- Quantum States and Quantum MeasurementsDan C. Marinescu, Gabriela M. Marinescu. 101-126
- Automatic Test Generation and Monitoring of Infinite States SystemsDoron Peled. 127-142
- Cryptographic Primitives Can Be FragileRené Peralta. 143-148
- From Temporal Logic Queries to Vacuity DetectionMarko Samer, Helmut Veith. 149-167
- Probability and Time in Measuring SecurityAnatol Slissenko. 169-183
- Decidability and Complexity Results for Security ProtocolsFerucio Laurentiu Tiplea, Constantin Enea, Catalin V. Birjoveanu. 185-211
- Dealing with Communication for Dynamic Multithreaded Recursive ProgramsTayssir Touili. 213-227
- Scenario Graphs Applied to Security (Extended Abstract)Jeannette M. Wing. 229-234