SSPV'06
Satisfiability Solvers and Program Verification
Seattle, August 10 - 11, 2006
FLoC
Home
About FLoC
MEETINGS
CAV
ICLP
IJCAR
LICS
RTA
SAT
Workshops (alpha.)
Workshops (by conf.)
PROGRAM
Room Assignments
FLoC at a glance
Social Events
Invited Talks
Day by Day
Meeting by Meeting
Workshop Proceedings
FACILITIES
Conference Hotel
Event Space
Internet Access
SEATTLE
Travel to/in Seattle
Dining Guide
Sightseeing in Seattle
ORGANIZATION
Steering Committee
Program Committee
Organizing Committee
Sponsors
MISCELLANEOUS
Related Events
Site Design
OUT-OF-DATE
Registration
Visa Information
Student Travel Support
SSPV on Friday, August 11th
Session 5 (09:45‑10:30)
09:45‑10:30
Orna Grumberg (Technion)
Hybrid BDD and All-SAT Method for Model Checking
[ppt]
TBA
 
Break (10:30‑11:00)
Session 6 (11:00‑12:30)
11:00‑11:45
Aarti Gupta (NEC Labs)
Verifying C Programs using SAT-based model checking
[pdf]
TBA
 
11:45‑12:30
Ofer Strichman (Technion)
Decision Heuristics based on an Abstraction/Refinement model
[ppt]
TBA
 
Lunch break (12:30‑14:00)
Session 7 (14:00‑15:30)
14:00‑14:45
Sharad Malik (Princeton University)
Optimization and Relaxation in SAT Search
[pdf]
TBA
 
14:45‑15:30
Alessandro Cimatti (IRST)
Reasoning about Bit Vector programs with Decision Procedures
[ppt]
TBA
 
Break (15:30‑16:00)
Session 8 (16:00‑16:45)
16:00‑16:45
Robert Nieuwenhuis (Technical University of Catalonia)
The new architecture and solvers in the Barcelogic tool for SAT modulo theories
[pdf]
TBA