Rich Model Toolkit – An Infrastructure for Reliable Computer Systems

Slides:



Advertisements
Similar presentations
Omnibus: A clean language and supporting tool for integrating different assertion-based verification techniques Thomas Wilson, Savi Maharaj, Robert G.
Advertisements

ECOE 560 Design Methodologies and Tools for Software/Hardware Systems Spring 2004 Serdar Taşıran.
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
DETAILED DESIGN, IMPLEMENTATIONA AND TESTING Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
Abstraction and Modular Reasoning for the Verification of Software Corina Pasareanu NASA Ames Research Center.
S Y S T E M S E N G I N E E R I N G.
1 Translation Validation: From Simulink to C Michael RyabtsevOfer Strichman Technion, Haifa, Israel Acknowledgement: sponsored by a grant from General.
© Chinese University, CSE Dept. Software Engineering / Software Engineering Topic 1: Software Engineering: A Preview Your Name: ____________________.
Fibre suspension flow modelling A key for innovation and competitiveness in the pulp & paper industry FP1005 Start date: 11/05/2011 End date: 10/05/2015.
Verification of Hybrid Systems An Assessment of Current Techniques Holly Bowen.
A survey of techniques for precise program slicing Komondoor V. Raghavan Indian Institute of Science, Bangalore.
Presented by: Thabet Kacem Spring Outline Contributions Introduction Proposed Approach Related Work Reconception of ADLs XTEAM Tool Chain Discussion.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
Software Model Checking for Embedded Systems PIs: Matthew Dwyer 1, John Hatcliff 1, and George Avrunin 2 Post-docs: Steven Seigel 2, Radu Iosif 1 Students:
PROOF TRANSLATION AND SMT LIB CERTIFICATION Yeting Ge Clark Barrett SMT 2008 July 7 Princeton.
PDDL: A Language with a Purpose? Lee McCluskey Department of Computing and Mathematical Sciences, The University of Huddersfield.
Programming Languages Structure
School of Computer ScienceG53FSP Formal Specification1 Dr. Rong Qu Introduction to Formal Specification
Formal verification Marco A. Peña Universitat Politècnica de Catalunya.
Formal Verification of SpecC Programs using Predicate Abstraction Himanshu Jain Daniel Kroening Edmund Clarke Carnegie Mellon University.
272: Software Engineering Fall 2012 Instructor: Tevfik Bultan Lecture 4: SMT-based Bounded Model Checking of Concurrent Software.
(1) Introduction © Sudhakar Yalamanchili, Georgia Institute of Technology, 2006.
Using Mathematica for modeling, simulation and property checking of hardware systems Ghiath AL SAMMANE VDS group : Verification & Modeling of Digital systems.
Software Engineering Prof. Dr. Bertrand Meyer March 2007 – June 2007 Chair of Software Engineering Static program checking and verification Slides: Based.
Chapter 1 Introduction Dr. Frank Lee. 1.1 Why Study Compiler? To write more efficient code in a high-level language To provide solid foundation in parsing.
Verification and Validation Overview References: Shach, Object Oriented and Classical Software Engineering Pressman, Software Engineering: a Practitioner’s.
Advanced Technology Center Slide 1 Requirements-Based Testing Dr. Mats P. E. Heimdahl University of Minnesota Software Engineering Center Dr. Steven P.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
High Performance Embedded Computing © 2007 Elsevier Chapter 1, part 2: Embedded Computing High Performance Embedded Computing Wayne Wolf.
Modeling and simulation of systems Model building Slovak University of Technology Faculty of Material Science and Technology in Trnava.
FDT Foil no 1 On Methodology from Domain to System Descriptions by Rolv Bræk NTNU Workshop on Philosophy and Applicablitiy of Formal Languages Geneve 15.
1. 2 Preface In the time since the 1986 edition of this book, the world of compiler design has changed significantly 3.
Learning Symbolic Interfaces of Software Components Zvonimir Rakamarić.
Software Development Problem Analysis and Specification Design Implementation (Coding) Testing, Execution and Debugging Maintenance.
Compiler Construction (CS-636)
Verification & Validation By: Amir Masoud Gharehbaghi
SOFTWARE ENGINEERING. Objectives Have a basic understanding of the origins of Software development, in particular the problems faced in the Software Crisis.
John Wilkins CSU Dominguez Hills March 14, CSUDH Mathematics Department Aligned with California Teaching Commission Previous alignment process with.
Formal Specification: a Roadmap Axel van Lamsweerde published on ICSE (International Conference on Software Engineering) Jing Ai 10/28/2003.
Grigore Rosu Founder, President and CEO Professor of Computer Science, University of Illinois
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
1 The Software Development Process ► Systems analysis ► Systems design ► Implementation ► Testing ► Documentation ► Evaluation ► Maintenance.
URL: by Wishnu Prasetya Course on Program Verification 2015/2016.
Finding bugs with a constraint solver daniel jackson. mandana vaziri mit laboratory for computer science issta 2000.
Sub-fields of computer science. Sub-fields of computer science.
System-on-Chip Design
Compiler Design (40-414) Main Text Book:
PRINCIPLES OF COMPILER DESIGN
SS 2017 Software Verification Bounded Model Checking, Outlook
Lexical and Syntax Analysis
CSCI-235 Micro-Computer Applications
SysML v2 Formalism: Requirements & Benefits
Chapter 1 Reasons to study concepts of PLs Programming Domains
SS 2017 Software Verification Software Model Checking 2 - Parallelism
课程名 编译原理 Compiling Techniques
1.1 Reasons to study concepts of PLs
runtime verification Brief Overview Grigore Rosu
Automating Induction for Solving Horn Clauses
Highly Ionised Pulse Plasma Processes (HIPP processes) MP0804
Software Design Methodology
New Directions in the Development of ABC
Rich Model Toolkit An Infrastructure for Reliable Computer Systems
Lifting Propositional Interpolants to the Word-Level
Logical architecture refinement
CSC Classes Required for TCC CS Degree
IS 2935: Developing Secure Systems
Emergence of Intelligent Machines: Challenges and Opportunities
Chapter 1 Preliminary. Chapter 1 Preliminary 1.1 Reasons for Studying Concepts of Programming Languages Increased capacity to express ideas Improved.
Programming Languages, Preliminaries, History & Evolution
Follow-up of MoU objectives
Presentation transcript:

Rich Model Toolkit – An Infrastructure for Reliable Computer Systems Start date: 30/10/2009 End date: 29/10/2013 Year: 2 Viktor Kuncak Action Chair Swiss Federal Institute of Technology Lausanne (EPFL)

Scientific context and objectives (1/2) Background / Problem statement: a number of automated reasoning techniques have been developed many specialized (difficult to apply to realistic problems), others general, but less automated Brief reminder of MoU objectives: Make automated reasoning techniques and tools applicable to a wider range of problems Make them easier to use by researchers, software developers, users

Scientific context and objectives (2/2) Research directions: Standardization and inter-operability: Introduce standardized representation formats (Rich Model Language) Combine automated reasoning tools (Rich Model Toolkit) Develop new decision procedures verification and analysis techniques synthesis techniques

Working groups WG1: Rich Model Language Design and Benchmark Suite (syntax, semantics, tool support, translators, benchmarks, competitions, proof and counterexample representations) WG2: Decision Procedures for Rich Model Language Fragments (efficiency improvements, new decidable fragments, architectures and combinations, tool implementations, encoding problems into decidable fragments) WG3: Analysis of Executable Rich Models – software,hardware (classes with exact algorithms, abstraction and automated refinement, proof generation for analyzers, extracting models) WG4: Synthesis from Rich Model Language Descriptions (new algorithms, more efficient implementations, quantitative synthesis, deployment as programming language constructs)

Results vs. Objectives A new level of integration of SMT solvers and first-order provers as well as counterexample facilities in Isabelle Hardware competition with standardized format organized A common format for transition systems designed see http://richmodels.org multiple paths to map C programs into it infrastructure in many implementation languages Introduced a new SMT solving tool into competition New techniques for analyzing linked structures in gcc compiler Advances in the analysis of multi-threaded programs

Significant Highlights in Science or Networking (1/2) Top-down and bottom up progress on rich model infrastructure Top down: Isabelle as integrator SMT solvers first-order provers counterexample generators detect errors in C++ concurrency standard (60+ times faster, scalable) independent Isabelle subset parser, translator from Scala Bottom up: numerical transition systems: formal models of programs hardware model checking format and competition (STSMs) temporal logic inputs for synthesis (during last WG meeting)

Significant Highlights in Science or Networking (2/2) Roderick Bloem Armin Biere Krishnendu Chatterjee Thomas Henzinger December 2010: the Austrian Science Fund (FWF) approved funding of a National Research Network “RiSE: Rigorous systems engineering”. RiSE will move far beyond classical model checking and a-posteriori verification, both in the use of model checkers and in the development and deployment of additional paradigms. Press coverage: derStandard.at (6) SG.hu oe1.ORF.at (2) APA.at (2) format.at orf.at (2) compuerwelt.at

Challenges Activities for this year: Finalize the definition of Rich Model Language (RML) (the core activity for WG1) Start evaluating the suitability of RML for encoding decidable logical fragments (WG2), verification problems (WG3) and synthesis problems (WG4) Improve efficiency of techniques for analyzing rich models, including SAT, SMT, superposition-based decision procedures, new decidable fragments (data structures, real numbers), symbolic execution, model checking (bounded, regular, SMT-based) and testing (for executable rich models) Increase the applicability of the above techniques by exploring their integration (e.g., symbolic execution and model checking, symbolic execution and theorem proving, testing and theorem proving) as well as by extension to new decidable fragments Improve the practicality of techniques for synthesizing executable systems from RML descriptions (WG4), including the problem of synthesis for data structures

Action Parties Grant Holder: IMDEA Software Cesar Sanchez Spain

Action participants

Use of COST Instruments Activity (No.) Year 1 Year 2 Year 3 Year 4 MC/WG Meetings 3 2 STSMs 5 3+ Training Schools Workshops or Conferences Joint Publications 26