[loginf] Symposium on SAT-solvers and Program Verification, at FLOC in Seattle

Byron Cook bycook at microsoft.com
Tue Jun 13 17:45:43 CEST 2006

        ******** CALL FOR PARTICIPATION ************

All are invited to the 2006 Symposium on Satisfiability Solvers and
Program Verification (SSPV).  Seattle, August 10 - 11.   SSPV is a FLoC

URL: http://www.easychair.org/FLoC-06/SSPV.html

Sponsored by Institute for Pure and Applied Mathematics (IPAM)

Organizers: Dimitris Achlioptas, Byron Cook, Moshe Vardi


We have invited the following researchers to come speak about new work
in the intersection between program verification and SAT-solvers.  

Alex Aiken, Stanford 
Title: Scalable Program Analysis Using Boolean Satisfiability

Alessandro Cimatti, IRST 
Title: Reasoning about Bit Vector programs with Decision Procedures

Edmund Clarke, CMU 
Title: Bounded and Unbounded Model Checking using SAT

Carla Gomes, Cornell 
Title: Beyond Satisfiability: Model Counting, Quantification, and

Aarti Gupta, NEC 
Title: Verifying C Programs using SAT-based model checking

Orna Grumberg, Technion 
Title: Hybrid BDD and All-SAT Method for Model Checking

Daniel Kroening, ETH 
Title: SAT-based methods for proving properties in Reynolds/O'Hearn
Separation Logic

Shuvendu Lahiri, Microsoft Research 
Title: Efficient SAT-based Techniques for Predicate Abstraction
Sharad Malik, Princeton 
Title: Optimization and Relaxation in SAT Search

Ken McMillan, Cadence Labs 
Title: SAT, interpolants, and software model checking

Roberto Nieuwenhuis, Technical University of Catalonia 
Title: The new architecture and solvers in the Barcelogic tool for SAT
modulo theories.

Ofer Strichman, Technion  
Title: Decision Heuristics based on an Abstraction/Refinement model

More information about the loginf mailing list