SOFTWARE DEVELOPMENT & REVERSIBILITY: OPEN PROBLEMS
|
|
|
- Mildred Barber
- 5 years ago
- Views:
Transcription
1 SOFTWARE DEVELOPMENT & REVERSIBILITY: OPEN PROBLEMS Claudio Antares Mezzina (with special suggestions from Lanese & Ulidowski & Tuosto) IMT School for Advanced Studies Lucca WG1 Meeting, Cyprus
2
3 SOFTWARE DEVELOPMENT According to Software Engineering we can distinguish three main phases during software development Specification Implementation Validation / Verification
4 SEQUENTIAL VS CONCURRENT In this talk we will just focus on Concurrent Programs There exists two concurrency models Shared Memory SM Message Passing MP
5 PROBLEM SPECTRUM
6 PROBLEM SPECTRUM
7 CONCURRENT Specification There exist formalisms which are general enough to work with both (Spec, MP) and (Spec, SM) Reversible Prime Event Structures / (Phillips & Ulidowski) Rigid Families (Cristescu & Krivine & Varacca) Reversible CCS / pi-calculus (Krivine et al., Lanese et al., Phillips et al.)
8 CONCURRENT: TOOLBOX (Spec, MP) Reversible Contracts (Barbanera & De Liguoro &Lanese) Binary, limited to choices Reversible Global Graphs (Mezzina & Tuosto) Multiparty, choices and loops + conditions
9 CONCURRENT: TOOLBOX (Spec, MP) Reversible (Multi Party - ) Session Types Tiezzi & Yoshida types are not used at all Castellani et al multiparty, limited to choices Mezzina & Perez multiparty, fully reversible
10 CONCURRENT (Spec, SM) Based on shared memory Some initial ideas on reversible SOS with store Compared with the MP scenario, we are lacking alternatives
11 IMPLEMENTATION (Impl, MP) Reversible Erlang (Lanese & Nishida & Palacios & Vidal) Reversible Communicating Machines (ongoing Mezzina & Tuosto & Ulidowski) Actor model + Checkpoint (Transactors)
12 CONCURRENT SETTING: IMPLEMENTATION (Impl, SM) Reversing Parallel Programs (Hoey & Ulidowski & Yuen) Reversible Tuple Spaces (Giachino & Lanese & Mezzina & Tiezzi) Compared with the MP scenario, we are lacking alternatives
13 VERIFICATION There exist formalisms which are general enough to work with both (Ver, MP) and (Ver, SM) Equivalences for Reversibility Bisimulations: few works but still far away from something concrete See Iain s slides for the Training School Testing: some preliminary ideas A safety and liveness theory for total reversibility (Mezzina & Koutavas) More on Ivan s talk from last WG1 meeting Logics for reversible systems Event Identifier Logic (Phillips & Ulidowski)
14 VERIFICATION (Ver, MP) Debugging CC Reversible Erlang Debugger (Lanese & Nishida & Palacios & Vidal) Based on fully reversible semantics (Ver, SM) Debugging moz debugger for a toy language (Giachino & Lanese & Mezzina) No real CC Reversible Deb for Shared Memory
15 SPECTRUM
16 RESEARCH GOAL If we were to apply any meaningful combination of the above mentioned approaches to software development Do we get a full-fledged framework for software development?
17 EXAMPLE Specification: Prime Event Structrure Implementation: Reversible Parallel programs Verification: Event Identifiers Logic
18 OPEN QUESTIONS 1 Specification: Reversible Prime Event Structrure Implementation: Reversible Parallel programs Verification: Event Identifiers Logic How can we map a program execution into a RPES? How can we extend EIL to query such structures? e.g. what is the minimal cause of a certain event?
19 OPEN QUESTIONS 2 Starting from a program specification / trace How can we generate reversible tests? How can tests be transformed into logic formulae?
20 OPEN QUESTION 3 Record / Replay No techniques for CC record-replay and trace-compression How can we record an execution and compress it? we can record a faulty execution of a beta program and debug it later on from the faulty trace we can automatically generate tests to see whether the bug is solved When two traces are equivalent? How we can compress trace to save time (while recording) and space?
21 OPEN QUESTION 4 So far reversible debuggers use a fully reversible semantics of the source language You have to hack the semantics of the VM/interpreter in order to embedd History logging Backward execution
22 OPEN QUESTION 4 Can t we exploit built in mechanisms of the soure language? Can we build a debugging facility on top of the Erlang supervision model? Ability to start / stop/ restart actors Ability to query the status of actors
23 OPEN QUESTIONS 5 Any other questions?
Reversible Concurrent Systems
1 Reversible Concurrent Systems Ivan Lanese Focus research group Computer Science and Engineering Department University of Bologna/INRIA Bologna, Italy Contributors Elena Giachino (University of Bologna/INRIA,
CauDEr A Causal-Consistent Debugger for Erlang
CauDEr A Causal-Consistent Debugger for Erlang Ivan Lanese Focus research group Computer Science and Engineering Department University of Bologna/INRIA Bologna, Italy Joint work with Naoki Nishida, Adrian
Causal-consistent Reversible Debugging
Causal-consistent Reversible Debugging Elena Giachino 1 Ivan Lanese 1 Claudio Antares Mezzina 2 1 Focus Team, University of Bologna/INRIA, Italy 2 SOA Unit, FBK Trento, Italy April 11, 2014 FASE 2014 Mezzina
Reversible Computing in Concurrent Interacting Systems
Reversible Computing in Concurrent Interacting Systems Ivan Lanese Focus research group Computer Science and Engineering Department University of Bologna/INRIA Bologna, Italy 1 Plan of the course 1. Motivation
Multiparty Session Types and their Applications
Multiparty Session Types and their Applications http://mrg.doc.ic.ac.uk/ Nobuko Yoshida, Rumyana Neykova Imperial College London University of Camerino 29th April, 2016 1 Selected Publications 2015/2016
Formal Methods in Software Engineering. Lecture 07
Formal Methods in Software Engineering Lecture 07 What is Temporal Logic? Objective: We describe temporal aspects of formal methods to model and specify concurrent systems and verify their correctness
Web Services Choreography and Process Algebra
Web Services Choreography and Process Algebra 29th April 2004 Steve Ross-Talbot Chief Scientist, Enigmatec Corporation Ltd Chair W3C Web Services Activity Co-chair W3C Web Services Choreography Agenda
CauDEr: A Causal-Consistent Reversible Debugger for Erlang
CauDEr: A Causal-Consistent Reversible Debugger for Erlang Ivan Lanese 1, Naoki Nishida 2, Adrián Palacios 3,, and Germán Vidal 3 1 Focus Team, University of Bologna/INRIA ivan.lanese@gmail.com 2 Graduate
Type systems. Types in access control and privacy. Outline. 1. Dynamic Web Data. p-calculus Dp XDp
Type systems Types in access control and privacy Silvia Ghilezan University of Novi Sad NII Shonan Meeting 069 LOGIC AND VERIFICATION METHODS IN SECURITY AND PRIVACY October 26-29, 2015 Types have gained
Complex Systems Design &DistributedCalculusandCoordination
Complex Systems Design &DistributedCalculusandCoordination Concurrency and Process Algebras: Theory and Practice - Klaim Francesco Tiezzi University of Camerino francesco.tiezzi@unicam.it A.A. 2014/2015
Verfying the SSH TLP with ProVerif
A Demo Alfredo Pironti Riccardo Sisto Politecnico di Torino, Italy {alfredo.pironti,riccardo.sisto}@polito.it CryptoForma Bristol, 7-8 April, 2010 Outline Introduction 1 Introduction 2 3 4 Introduction
Easy Multicore Programming using MAPS
Easy Multicore Programming using MAPS Jeronimo Castrillon, Maximilian Odendahl Multicore Challenge Conference 2012 September 24 th, 2012 Institute for Communication Technologies and Embedded Systems Outline
A step towards reconciling GALS industrial design with formal verification
A step towards reconciling GALS industrial design with formal verification Fatma Jebali Join work with Frédéric Lang & Radu Mateescu Inria Grenoble France LASER Summer School September 13 th, 2014 GALS:
Debugging Applications in Pervasive Computing
Debugging Applications in Pervasive Computing Larry May 1, 2006 SMA 5508; MIT 6.883 1 Outline Video of Speech Controlled Animation Survey of approaches to debugging Turning bugs into features Speech recognition
Verifying control systems using CSP, FDR, and Handel-C.
erifying control systems using CSP, FDR, and Handel-C. 01 Verifying control systems using CSP, FDR, and Handel-C. Alistair A. McEwan University of Surrey erifying control systems using CSP, FDR, and Handel-C.
Module 10 MULTIMEDIA SYNCHRONIZATION
Module 10 MULTIMEDIA SYNCHRONIZATION Lesson 33 Basic definitions and requirements Instructional objectives At the end of this lesson, the students should be able to: 1. Define synchronization between media
Distributed Systems Programming (F21DS1) Formal Verification
Distributed Systems Programming (F21DS1) Formal Verification Andrew Ireland Department of Computer Science School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh Overview Focus on
Benefits of object-orientationorientation
ITEC 136 Business Programming Concepts Week 14, Part 01 Overview 1 Week 14 Overview Week 13 review What is an object? (three parts) State (properties) Identity (location in memory) Behavior (methods) 2
Curriculum 2013 Knowledge Units Pertaining to PDC
Curriculum 2013 Knowledge Units Pertaining to C KA KU Tier Level NumC Learning Outcome Assembly level machine Describe how an instruction is executed in a classical von Neumann machine, with organization
Idioms for Interaction: Functional Types, Process Types and Distributed Systems
Idioms for Interaction: Functional Types, Process Types and Distributed Systems http://mrg.doc.ic.ac.uk/ Nobuko Yoshida Imperial College London 1 Idioms for Interaction Multiparty Session Types Outline
Handling Integer Arithmetic in the Verification of Java Programs
Handling Integer Arithmetic in the Verification of Java Programs Steffen Schlager 1st Swedish-German KeY Workshop Göteborg, Sweden, June 2002 KeY workshop, June 2002 p.1 Introduction UML/OCL specification
Addressing the Increasing Challenges of Debugging on Accelerated HPC Systems. Ed Hinkel Senior Sales Engineer
Addressing the Increasing Challenges of Debugging on Accelerated HPC Systems Ed Hinkel Senior Sales Engineer Agenda Overview - Rogue Wave & TotalView GPU Debugging with TotalView Nvdia CUDA Intel Phi 2
Markus Völter
of Markus Völter voelter@acm.org www.voelter.de @markusvoelter Examples 1 Healthcare Context & Motivation Mobile Apps that help patients w/ treatments Monitor side-effects and recommend actions Manage
Specification and Analysis of Contracts Tutorial
Specification and Analysis of Contracts Tutorial Gerardo Schneider gerardo@ifi.uio.no http://folk.uio.no/gerardo/ Department of Informatics, University of Oslo Gerardo Schneider (UiO) Specification and
Reversible Communicating Processes
Reversible Communicating Processes Geoffrey Brown and Amr Sabry School of Informatics and Computing Indiana University Bloomington, IN geobrown@indiana.edu, sabry@indiana.edu Abstract Reversible distributed
ESTEC, June 9 th, 2016
System Concept Simulation for Concurrent Engineering Final Presentation Stephan Kranz ESTEC, June 9 th, 2016 Telespazio VEGA Deutschland Overview SYSTEM CONCEPT SIMULATOR Study Logic Use Cases / User Requirements
Course on Probabilistic Methods in Concurrency. (Concurrent Languages for Probabilistic Asynchronous Communication) Lecture 1
Course on Probabilistic Methods in Concurrency (Concurrent Languages for Probabilistic Asynchronous Communication) Lecture 1 The pi-calculus and the asynchronous pi-calculus. Catuscia Palamidessi INRIA
Part II. Hoare Logic and Program Verification. Why specify programs? Specification and Verification. Code Verification. Why verify programs?
Part II. Hoare Logic and Program Verification Part II. Hoare Logic and Program Verification Dilian Gurov Props: Models: Specs: Method: Tool: safety of data manipulation source code logic assertions Hoare
Integration and Testing. Uses slides from Lethbridge & Laganiere, 2001
Integration and Testing Uses slides from Lethbridge & Laganiere, 2001 Testing phases: V model Requirements Acceptance Testing Specifications System Testing Design Integration Testing Detailed Design Unit
ABCD Report: Simon Gay, Philip Wadler, Nobuko Yoshida. 7th December 2017
ABCD Report: 2017 Simon Gay, Philip Wadler, Nobuko Yoshida 7th December 2017 We summarise this year s activity, organised into sections according to the original ABCD workplan. The report only covers 2017,
Safety-Critical Software Development
Safety-Critical Software Development Prof. Chris Johnson, School of Computing Science, University of Glasgow. johnson@dcs.gla.ac.uk http://www.dcs.gla.ac.uk/~johnson Introduction Why is software different?
Subject : Computer Science. Paper : Software Quality Management. Module : CASE Tools
e-pg Pathshala Subject : Computer Science Paper : Software Quality Management Module : CASE Tools Module No: Quadrant 1: CS/SQM/26 e-text An increasing variety of specialized computerized tools (actually
Cover Page. The handle holds various files of this Leiden University dissertation
Cover Page The handle http://hdl.handle.net/1887/22891 holds various files of this Leiden University dissertation Author: Gouw, Stijn de Title: Combining monitoring with run-time assertion checking Issue
UCD3138. JTAG Configuration. Using CCS 6
UCD3138 JTAG MANUAL UCD3138 JTAG Configuration Using CCS 6 TI NDA Preliminary Document October 6 2014 PRODUCT PREVIEW information concerns products in the formative or design phase of development. Characteristic
Session Types and Multiparty Session Types. Nobuko Yoshida Imperial College London
Session Types and Multiparty Session Types Nobuko Yoshida Imperial College London 1 Communication is Ubiquitous Internet, the WWW, Cloud Computing, the next-generation manycore chips, message-passing parallel
1: Database Systems, Architecture, and Components
1: Database Systems, Architecture, and Components ata raw material consisting of unorganized facts, things, activities, and transactions nformation data that has been processed (i.e., organized) into a
COMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University
Eugene Syriani Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science McGill University 1 OVERVIEW In the context In Theory: Timed Automata The language: Definitions and Semantics
Metview s new Python interface
Metview s new Python interface Workshop on developing Python frameworks for earth system sciences. ECMWF, 2018 Iain Russell Development Section, ECMWF Thanks to Sándor Kertész Fernando Ii Stephan Siemen
Temporal Data Model for Program Debugging
Temporal Data Model for Program Debugging Demian Lessa Jan Chomicki Bharat Jayaraman Department of Computer Science and Engineering State University of New York, Buffalo August 29, 2011 Current Debuggers
On the Expressiveness of Polyadicity in Higher-Order Process Calculi
On the Expressiveness of Polyadicity in Higher-Order Process Calculi Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi (Univ. di Bologna) Alan Schmitt (INRIA Grenoble - Rhône Alpes) ICTCS 09 Cremona, September
Part 1.3 Modal I/O Transition Systems as Semantics of UML4SOA
IMT 2013 Lucca, Italy September 2013 Part 1.3 Modal I/O Transition Systems as Semantics of UML4SOA Martin Wirsing LMU München in co-operation with Sebastian Bauer, Rolf Hennicker, Philip Mayer M. Wirsing
Sérgio Campos, Edmund Clarke
Sérgio Campos, Edmund 1 / 23 Model checking is a technique that relies on building a finite model of a system and checking that a desired property holds in that model. The check is performed by an exhaustive
From Math to Machine A formal derivation of an executable Krivine Machine Wouter Swierstra Brouwer Seminar
From Math to Machine A formal derivation of an executable Krivine Machine Wouter Swierstra Brouwer Seminar β reduction (λx. t0) t1 t0 {t1/x} Substitution Realizing β-reduction through substitution is a
The Need for Confluence
The Need for Confluence The Essential Role of Incident Response in Secure Software Development Why do security incidents occur? What is the root cause? Faulty software (more often than not) What is the
CASE TOOLS LAB VIVA QUESTION
1. Define Object Oriented Analysis? VIVA QUESTION Object Oriented Analysis (OOA) is a method of analysis that examines requirements from the perspective of the classes and objects found in the vocabulary
Proofs and Proof Certification in the TLA + Proof System
Proofs and Proof Certification in the TLA + Proof System Stephan Merz Inria Nancy Grand-Est & LORIA, Villers-lès-Nancy, France Abstract TLA + is a specification language originally designed for specifying
Lecture 10. Dynamic Analysis
Lecture 10. Dynamic Analysis Wei Le Thank Xiangyu Zhang, Michael Ernst, Tom Ball for Some of the Slides Iowa State University 2014.11 Outline What is dynamic analysis? Instrumentation Analysis Representing
ABSTRACT INTERPRETATION
Master of Science in Engineering ABSTRACT INTERPRETATION Pascal Roman Artho, partho@hsr.ch Seminar Program Analysis and Transformation Rapperswil, January 7, 2015 Agenda Informal Example What is the idea
Test Automation. 20 December 2017
Test Automation 20 December 2017 The problem of test automation Testing has repetitive components, so automation is justified The problem is cost-benefit evaluation of automation [Kaner] Time for: test
Challenges and Possibilities for Safe and Secure ASN.1 Encoders and Decoders
Challenges and Possibilities for Safe and Secure ASN.1 Encoders and Decoders Mark Tullsen Galois, Inc. LangSec, May 2018 Mark Tullsen (Galois, Inc.) ASN.1 Challenges and Possibilities LangSec, May 2018
Distributed Operation Layer Integrated SW Design Flow for Mapping Streaming Applications to MPSoC
Distributed Operation Layer Integrated SW Design Flow for Mapping Streaming Applications to MPSoC Iuliana Bacivarov, Wolfgang Haid, Kai Huang, and Lothar Thiele ETH Zürich MPSoCs are Hard to program (
Structuring an Abstract Interpreter through Value and State Abstractions: EVA, an Evolved Value Analysis for Frama C
Structuring an Abstract Interpreter through Value and State Abstractions: EVA, an Evolved Value Analysis for Frama C David Bühler CEA LIST, Software Safety Lab Frama-C & SPARK Day 2017 May 30th, 2017 David
A formal derivation of an executable Krivine machine
A formal derivation of an executable Krivine machine Wouter Swierstra Universiteit Utrecht IFIP WG 2.1 Meeting 68; Rome, Italy 1 β reduction (λx. t0) t1 t0 {t1/x} 2 Motivation Implementing β-reduction
PROGRAM ANALYSIS & SYNTHESIS
Lecture 02 Structural Operational Semantics (SOS) PROGRAM ANALYSIS & SYNTHESIS EranYahav 1 Previously static analysis over-approximation of program behavior abstract interpretation abstraction, transformers,
Lecture 2. Decidability and Verification
Lecture 2. Decidability and Verification model temporal property Model Checker yes error-trace Advantages Automated formal verification, Effective debugging tool Moderate industrial success In-house groups:
AADL Requirements Annex Review
Dominique Blouin Lab-STICC Université de Bretagne-Occidentale Université de Bretagne-Sud Bretagne, France 1 AADL Standards Meeting, April 23 th, 2013 Agenda Comments from Annex Document Review Motivations
Checkpointing using DMTCP, Condor, Matlab and FReD
Checkpointing using DMTCP, Condor, Matlab and FReD Gene Cooperman (presenting) High Performance Computing Laboratory College of Computer and Information Science Northeastern University, Boston gene@ccs.neu.edu
SmartNotification 1.2
SmartNotification 1.2 Release Description Build 1.2.14 SN12REL, Rev. 7, 2010-10-06 Contents: 1. Introduction...2 1.1 Related documentation...2 1.2 Release history...2 2. Product Overview...3 2.1 Product
An Annotated Language
Hoare Logic An Annotated Language State and Semantics Expressions are interpreted as functions from states to the corresponding domain of interpretation Operators have the obvious interpretation Free of
CSCA08 Winter 2018 Week 2: Variables & Functions. Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough
CSCA08 Winter 2018 Week 2: Variables & Functions Marzieh Ahmadzadeh, Brian Harrington University of Toronto Scarborough Administrative Detail Tutorials and practicals start this week Inverted lecture starts
Static Analysis of Embedded C Code
Static Analysis of Embedded C Code John Regehr University of Utah Joint work with Nathan Cooprider Relevant features of C code for MCUs Interrupt-driven concurrency Direct hardware access Whole program
MPLAB X Debugging Techniques
TLS0102-001 MPLAB X Debugging Techniques The Debugging Process Author: Rob Ostapiuk, Stu Chandler Microchip Technology Objectives! Describe a generic process for debugging a program! Describe at a high
Module 3. Requirements Analysis and Specification. Version 2 CSE IIT, Kharagpur
Module 3 Requirements Analysis and Specification Lesson 6 Formal Requirements Specification Specific Instructional Objectives At the end of this lesson the student will be able to: Explain what a formal
Distributed Runtime Verification of JADE and Jason Multiagent Systems with Prolog?
Distributed Runtime Verification of JADE and Jason Multiagent Systems with Prolog? Daniela Briola, Viviana Mascardi, and Davide Ancona DIBRIS, Genoa University, Italy daniela.briola,viviana.mascardi,davide.ancona@unige.it
Spot: A Programming Language for Verified Flight Software
Spot: A Programming Language for Verified Flight Software Rob Bocchino (bocchino@jpl.nasa.gov) Ed Gamble (ed.gamble@jpl.nasa.gov) Kim Gostelow Jet Propulsion Laboratory Califor nia Institute of Technology
ECE 587 Hardware/Software Co-Design Lecture 11 Verification I
ECE 587 Hardware/Software Co-Design Spring 2018 1/23 ECE 587 Hardware/Software Co-Design Lecture 11 Verification I Professor Jia Wang Department of Electrical and Computer Engineering Illinois Institute
Model Checking Software with
Model Checking Software with Patrice Godefroid Bell Laboratories, Lucent Technologies PASTE 2004 Page 1 June 2004 Model Checking A B C deadlock Each component is modeled by a FSM. Model Checking = systematic
A Small Interpreted Language
A Small Interpreted Language What would you need to build a small computing language based on mathematical principles? The language should be simple, Turing equivalent (i.e.: it can compute anything that
Deadlock Avoidance in SCC
Deadlock Avoidance in SCC based on the AMAST 2008 paper Types and deadlock freedom in a calculus of services, sessions and pipelines Roberto Bruni 1 Leonardo Gaetano Mezzina 2 1 Dipartimento di Informatica
A Gentle Introduction to Program Analysis
A Gentle Introduction to Program Analysis Işıl Dillig University of Texas, Austin January 21, 2014 Programming Languages Mentoring Workshop 1 / 24 What is Program Analysis? Very broad topic, but generally
The discussion of Chapter 1 will be split into two sessions; the first will cover 1.1 and 1.2; the second will cover 1.3, 1.4, and 1.5.
1 The discussion of Chapter 1 will be split into two sessions; the first will cover 1.1 and 1.2; the second will cover 1.3, 1.4, and 1.5. 2 http://memory alpha.org/wiki/file:surak_tos.jpg. Copyright Paramount/CBS.
Predicate Abstraction Daniel Kroening 1
Predicate Abstraction 20.1.2005 Daniel Kroening 1 Motivation Software has too many state variables State Space Explosion Graf/Saïdi 97: Predicate Abstraction Idea: Only keep track of predicates on data
A Scalable Approach to User-session-based Testing of Web Applications through Concept Analysis
A Scalable Approach to User-session-based Testing of Web Applications through Concept Analysis Sreedevi Sampath, University of Delaware Valentin Mihaylov, Drexel University Amie Souter, Drexel University
Lecture 6B Hierarchical/Concurrent State Machine Models (HCFSM)
ECE 474A/57A Computer-Aided Logic Design Outline Models vs. Languages Lecture 6B Hierarchical/Concurrent State Machine Models (HCFSM) State Machine Model FSM/FSMD HCFSM and Statecharts Language Program-State
Language engineering and Domain Specific Languages
Language engineering and Domain Specific Languages Perdita Stevens School of Informatics University of Edinburgh Plan 1. Defining languages 2. General purpose languages vs domain specific languages 3.
The UPPAAL Model Checker. Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN
The UPPAAL Model Checker Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN The aim of this presentation Introduce the basic concepts of model checking from a practical perspective Describe
SoftCOM 2000 THE EFFICIENT SYMBOLIC TOOLS PACKAGE
8th International Conference Software, Telecommunications and Computer Networks, Split, Croatia THE EFFICIENT SYMBOLIC TOOLS PACKAGE Robert Meolic, Tatjana Kapus, Zmago Brezočnik Faculty of Electrical
n HW7 due in about ten days n HW8 will be optional n No CLASS or office hours on Tuesday n I will catch up on grading next week!
Announcements SMT Solvers, Symbolic Execution n HW7 due in about ten days n HW8 will be optional n No CLASS or office hours on Tuesday n I will catch up on grading next week! n Presentations n Some of
BP-Mon: Monitoring Business Processes with Queries
BP-Mon: Monitoring Business Processes with Queries Catriel Beeri, Anat Eyal, Tova Milo, Alon Pilberg Hebrew University Tel-Aviv University Outline Introduction to Business Processes Overview of BP-Mon
PANDA A System for Provenance and Data. Example: Sales Prediction Workflow. Example: Sales Prediction Workflow. Backward Tracing. Item Sales.
PANDA A System for Provenance and Data Example: Prediction Workflow Union Predict Agg -1 s 2 Example: Prediction Workflow Backward Tracing Union Predict Agg -1 s Name Amelie Jacques Isabelle Name Address
Proving the Correctness of Distributed Algorithms using TLA
Proving the Correctness of Distributed Algorithms using TLA Khushboo Kanjani, khush@cs.tamu.edu, Texas A & M University 11 May 2007 Abstract This work is a summary of the Temporal Logic of Actions(TLA)
Verification and Test with Model-Based Design
Verification and Test with Model-Based Design Flight Software Workshop 2015 Jay Abraham 2015 The MathWorks, Inc. 1 The software development process Develop, iterate and specify requirements Create high
OMEGA2. Profile & tools for system modelling and verification with UML 2.x & SysML. Iulian OBER, Iulia DRAGOMIR IRIT / University of Toulouse
OMEGA2 Profile & tools for system modelling and verification with UML 2.x & SysML Iulian OBER, Iulia DRAGOMIR IRIT / University of Toulouse Tools developed in partnership with Work supported by «System,root»
ArchiMate 2.0. Structural Concepts Behavioral Concepts Informational Concepts. Business. Application. Technology
ArchiMate Core Structural Concepts Behavioral Concepts Informational Concepts interaction Technology Application Layer Concept Description Notation Concept Description Notation Actor An organizational
Orchestration vs Choreography
Orchestration vs Choreography u In many cases, there is no unique point of invocation for the services n In these cases, we say that the system is a choreography n Let starts with an example: w Consider
Nepal Telecom Nepal Doorsanchar Company Ltd.
Nepal Telecom Nepal Doorsanchar Company Ltd. Syllabus lg=g+= 124 ;+u ;DalGwt cg';'lr - 3_ Part II: (Specialized subject for Computer Engineer Level 7 Tech. - Free and Internal competition) Time: 2 hours
want turn==me wait req2==0
Uppaal2k: Small Tutorial Λ 16 October 2002 1 Introduction This document is intended to be used by new comers to Uppaal and verification. Students or engineers with little background in formal methods should
FixD : Fault Detection, Bug Reporting, and Recoverability for Distributed Applications
FixD : Fault Detection, Bug Reporting, and Recoverability for Distributed Applications Cristian Ţăpuş, David A. Noblet California Institute of Technology {crt,dnoblet}@cs.caltech.edu Abstract Model checking,
TOOLSMITHING AN IDA BRIDGE: A TOOL BUILDING CASE STUDY. Adam Pridgen Matt Wollenweber
TOOLSMITHING AN IDA BRIDGE: A TOOL BUILDING CASE STUDY Adam Pridgen Matt Wollenweber Presentation Agenda Motivation and Purpose Toolsmithing Identifying the short-cuts to meet project needs Processes for
Advanced Programming Methods. Introduction in program analysis
Advanced Programming Methods Introduction in program analysis What is Program Analysis? Very broad topic, but generally speaking, automated analysis of program behavior Program analysis is about developing
DESIGN, EVOLUTION AND USE
DESIGN, EVOLUTION AND USE of KernelF voelter@acm.org www.voelter.de @markusvoelter Markus Völter Check out the paper! http://voelter.de/data /pub/kernelf-icmt.pdf EXAMPLE 1 Healthcare 1 Context Mobile
System Correctness. EEC 421/521: Software Engineering. System Correctness. The Problem at Hand. A system is correct when it meets its requirements
System Correctness EEC 421/521: Software Engineering A Whirlwind Intro to Software Model Checking A system is correct when it meets its requirements a design without requirements cannot be right or wrong,
The X86 Assembly Language Instruction Nop Means
The X86 Assembly Language Instruction Nop Means As little as 1 CPU cycle is "wasted" to execute a NOP instruction (the exact and other "assembly tricks", as explained also in this thread on Programmers.
Source-Based Trace Exploration Work in Progress
Source-Based Trace Exploration Work in Progress Olaf Chitil University of Kent, UK Abstract. Hat is a programmer s tool for generating a trace of a computation of a Haskell 98 program and viewing such
CS275 Intro to Databases. File Systems vs. DBMS. Why is a DBMS so important? 4/6/2012. How does a DBMS work? -Chap. 1-2
CS275 Intro to Databases How does a DBMS work? -Chap. 1-2 File Systems vs. DBMS We have to write special programs for queries We have to protect data from inconsistencies We have to handle crashes We have
Quantitative Verification and Synthesis of Systems
Quantitative Verification and Synthesis of Systems Sanjit A. Seshia Assistant Professor EECS, UC Berkeley Software-at-Scale Workshop August 2010 Quantitative Analysis / Verification Does the brake-by-wire
340 Review Fall Midterm 1 Review
340 Review Fall 2016 Midterm 1 Review Concepts A. UML Class Diagrams 1. Components: Class, Association (including association name), Multiplicity Constraints, General Constraints, Generalization/Specialization,
NOTES ON OBJECT-ORIENTED MODELING AND DESIGN
NOTES ON OBJECT-ORIENTED MODELING AND DESIGN Stephen W. Clyde Brigham Young University Provo, UT 86402 Abstract: A review of the Object Modeling Technique (OMT) is presented. OMT is an object-oriented
1.1 For Fun and Profit. 1.2 Common Techniques. My Preferred Techniques
1 Bug Hunting Bug hunting is the process of finding bugs in software or hardware. In this book, however, the term bug hunting will be used specifically to describe the process of finding security-critical
Combining Real-Time Model-Checking and Fault Tree Analysis
Combining Real-Time and Fault Tree Analysis Andreas Schäfer MC University of Oldenburg Real-Time and Fault Tree Analysis p.1/17 Contents What is Fault Tree Analysis (FTA)? Duration Calculus with Liveness