Fahiem Bacchus University of Toronto

Slides:



Advertisements
Similar presentations
Hybrid BDD and All-SAT Method for Model Checking Orna Grumberg Joint work with Assaf Schuster and Avi Yadgar Technion – Israel Institute of Technology.
Advertisements

Delta Debugging and Model Checkers for fault localization
Constraint Satisfaction Problems Russell and Norvig: Parts of Chapter 5 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2004/home.htm Prof: Dekang.
M ODEL CHECKING -Vasvi Kakkad University of Sydney.
Interactive Configuration
Hybrid System Verification Synchronous Workshop 2003 A New Verification Algorithm for Planar Differential Inclusions Gordon Pace University of Malta December.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Formal Methods of Systems Specification Logical Specification of Hard- and Software Prof. Dr. Holger Schlingloff Institut für Informatik der Humboldt.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
ECE Synthesis & Verification1 ECE 667 Spring 2011 Synthesis and Verification of Digital Systems Verification Introduction.
Taylor Expansion Diagrams (TED): Verification EC667: Synthesis and Verification of Digital Systems Spring 2011 Presented by: Sudhan.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla Gomes and Bart Selman Cornell University Muri Meeting March 2002.
Formal Techniques for Verification Using SystemC By Nasir Mahmood.
Operations Research Models
Binary Decision Diagrams (BDDs)
Business Analysis and Essential Competencies
© Manfred Huber Autonomous Robots Robot Path Planning.
Software Verification 2 Automated Verification Prof. Dr. Holger Schlingloff Institut für Informatik der Humboldt Universität and Fraunhofer Institut für.
Robust Low Power VLSI ECE 7502 S2015 Fault Diagnosis and Logic Debugging Using Boolean Satisfiability ECE 7502 Class Discussion Benjamin Melton Thursday.
Ethan Jackson, Nikolaj Bjørner and Wolfram Schulte Research in Software Engineering (RiSE), Microsoft Research 1. A FORMULA for Abstractions and Automated.
1 Hybrid-Formal Coverage Convergence Dan Benua Synopsys Verification Group January 18, 2010.
Combining Theory and Systems Building Experiences and Challenges Sotirios Terzis University of Strathclyde.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View BDDs.
Efficient Synthesis of Feature Models Article Review By: Sigal Berkovitz & Yohai Vidergor.
Conformant Probabilistic Planning via CSPs ICAPS-2003 Nathanael Hyafil & Fahiem Bacchus University of Toronto.
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2013 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
On the Relation between SAT and BDDs for Equivalence Checking Sherief Reda Rolf Drechsler Alex Orailoglu Computer Science & Engineering Dept. University.
International Workshop Jan 21– 24, 2012 Jacksonville, Fl USA Model-based Systems Engineering (MBSE) Initiative Slides by Henson Graves Presented by Matthew.
Advanced Software Development applied to (Symbolic) Systems Biology Karl Lieberherr.
Quality Assurance in the Presence of Variability Kim Lauenroth, Andreas Metzger, Klaus Pohl Institute for Computer Science and Business Information Systems.
Fahiem Bacchus © 2005 University of Toronto 1 CSC384: Intro to Artificial Intelligence Search II ● Announcements.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Abstraction and Abstract Interpretation. Abstraction (a simplified view) Abstraction is an effective tool in verification Given a transition system, we.
Complexity Relief Techniques for Model Checking METU, Aug SOFTWARE VERIFICATION WORKSHOP Hüsnü Yenigün Sabanci University Informatics Institute,
Composing semantic Web services under constraints E.Karakoc, P.Senkul Journal: Expert Systems with Applications 36 (2009)
Automatic Test Generation
A Review of Software Testing - P. David Coward
Basic concepts of Model Checking
Knowledge Representation Techniques
Business process management (BPM)
Designing Cross-Language Information Retrieval System using various Techniques of Query Expansion and Indexing for Improved Performance  Hello everyone,
Hybrid BDD and All-SAT Method for Model Checking
Towards Scalable Traffic Management in Cloud Data Centers
SS 2017 Software Verification Bounded Model Checking, Outlook
Testing and Debugging PPT By :Dr. R. Mall.
Inference and search for the propositional satisfiability problem
Business process management (BPM)
Planning as model checking, (OBDDs)
Review for the Midterm Exam
Artificial Intelligence and Searching
SS 2017 Software Verification CTL model checking, BDDs
ECE 667 Synthesis and Verification of Digital Circuits
Informed search algorithms
“Hard” Optimization Problems
CSE (c) S. Tanimoto, 2001 Search-Introduction
Discrete Controller Synthesis
Digital Design Verification
The Challenge of Cross - Language Interoperability
Lecture 10, Computer Networks (198:552)
CSE (c) S. Tanimoto, 2002 State-Space Search
Abstraction, Verification & Refinement
Canonical Computation without Canonical Data Structure
Brad Clement and Ed Durfee University of Michigan
Reinforcement Learning Dealing with Partial Observability
CSE (c) S. Tanimoto, 2004 State-Space Search
Artificial Intelligence and Searching
Solving Non-clausal Formulas with DPLL search
Artificial Intelligence and Searching
Presentation transcript:

Fahiem Bacchus University of Toronto What have we Learned Fahiem Bacchus University of Toronto URL for the location of these slides.

Many Commonalities The different communities are addressing many similar problems. Given a transition system I Searching for a state satisfying a particular property Verification, planning II Checking all states Ensuring that all states satisfy a particular property. Doing a computation that potentially requires examining all states. Verification, MDPs Planning with optimization? 11/18/2018 Fahiem Bacchus

Many Commonalities The different communities are addressing many similar problems. Given a transition system I Searching for a path satisfying a particular property Verification, planning II Checking all path Ensuring that all states satisfy a particular property. Doing a computation that potentially requires examining all states. Verification, MDPs Planning with optimization? 11/18/2018 Fahiem Bacchus

Differences Verification Planning MDPs Typical types of state information Boolean Relations Numeric Techniques BDDs, SAT, Propositional Lifted reasoning, some conversion to the propositional Dynamic programming, Linear programming, Approximations “Complexity” High combinatorial complexity, Smaller sized spaces Low combinatorial complexity, large state spaces Low combinatorial complexity, smaller sized spaces, but added complexity of optimization 11/18/2018 Fahiem Bacchus

Differences Many of these differences are a result of the “dominant” problems in the field. As a result there are many useful techniques specific to each area. In the future most of these fields would like to expand their scope, this will eliminate many of these differences. 11/18/2018 Fahiem Bacchus

Differences MDPs there is a desire to deal with relational representations. Relations become useful in verification when dealing, e.g., with software. Planning would like to deal with numeric resources and optimization. 11/18/2018 Fahiem Bacchus

Potential for Cross fertilization As a result there will be a growing need to understand, adapt, and apply techniques from other areas in your own area. E.g., Using CSPs to do verification of RTL specifications (Drechsler) Using planning techniques in test generation (Damm) 11/18/2018 Fahiem Bacchus

Hurdles to overcome Collaboration Accessibility Some useful collaborations will hopefully arise from the workshop. Trying to address benchmark problems with different techniques. Accessibility It can be difficult to access the literature in other fields The domain details are not necessarily abstracted from the search problems. To bridge this gap is a challenge. 11/18/2018 Fahiem Bacchus