Simulation of Rosetta Models Joseph Kuehn University of Adelaide, Australia.

Slides:



Advertisements
Similar presentations
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
Advertisements

Bernstein’s Conditions. Techniques to Exploit Parallelism in Sequential Programming Hierarchy of levels of parallelism: Procedure or Methods Statements.
ECE Synthesis & Verification 1 ECE 667 Synthesis and Verification of Digital Systems Formal Verification Combinational Equivalence Checking.
PROBLEMSOLUTION TECHNOLOGY Traceability relations between requirements and code are generally derived manually, and must be manually updated when software.
Today’s Agenda  HW #1 Due  Quick Review  Finish Input Space Partitioning  Combinatorial Testing Software Testing and Maintenance 1.
Interactive Generation of Integrated Schemas Laura Chiticariu et al. Presented by: Meher Talat Shaikh.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
1 Optimisation Although Constraint Logic Programming is somehow focussed in constraint satisfaction (closer to a “logical” view), constraint optimisation.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Simulated-Annealing-Based Solution By Gonzalo Zea s Shih-Fu Liu s
UCSD CSE 245 Notes – SPRING 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2006 Prof.
CGRASS A System for Transforming Constraint Satisfaction Problems Alan Frisch, Ian Miguel (York) Toby Walsh (Cork)
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
12 -1 Lecture 12 User Modeling Topics –Basics –Example User Model –Construction of User Models –Updating of User Models –Applications.
STROUD Worked examples and exercises are in the text PROGRAMME F10 (6 th Ed) FUNCTIONS, contd (revised 29 Jan 14 – J.A.B)
CSE 332: Combining STL features Combining STL Features STL has containers, iterators, algorithms, and functors –With several to many different varieties.
Expert System Presentation On…. Software Certification for Industry - Verification and Validation Issues in Expert Systems By Anca I. Vermesan Presented.
EEE324 Digital Electronics Ian McCrumRoom 5B18, Lecture 4: Boolean Algebra.
SE-02 SOFTWARE ENGINEERING LECTURE 3 Today: Requirements Analysis Requirements tell us what the system should do - not how it should do it. Requirements.
Speaking Bluntly about SharpHDL: Some Old Stuff and Some Other Proposed Future Extensions Gordon J. Pace & Christine Vella Synchron’05 Malta, November.
1 Chapter 5 LL (1) Grammars and Parsers. 2 Naming of parsing techniques The way to parse token sequence L: Leftmost R: Righmost Top-down  LL Bottom-up.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 18 Slide 1 Software Reuse.
2.3 Introduction to Functions
Automatic Software Design Document Generation Input Specification Synthesis System data double x(I); x~gauss(mu,sigma); … data double x(I); x~gauss(mu,sigma);
1 Hybrid-Formal Coverage Convergence Dan Benua Synopsys Verification Group January 18, 2010.
Simulation is the process of studying the behavior of a real system by using a model that replicates the behavior of the system under different scenarios.
Indirect Supervision Protocols for Learning in Natural Language Processing II. Learning by Inventing Binary Labels This work is supported by DARPA funding.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
Vector Spaces RANK © 2016 Pearson Education, Inc..
Section 2.1 Functions. A relation is a correspondence between two sets. If x and y are two elements in these sets and if a relation exists between x.
Functions Section 1.4. Relation The value of one variable is related to the value of a second variable A correspondence between two sets If x and y are.
Status of Reference Network Simulations John Dale TILC09 20 April 2009.
Solving Problems by searching Well defined problems A probem is well defined if it is easy to automatically asses the validity (utility) of any proposed.
Intro to Simulink April 15, Copyright , Andy Packard. This work is licensed under the Creative Commons.
Status of Reference Network Simulations John Dale ILC-CLIC LET Beam Dynamics Workshop 23 June 2009.
Static Techniques for V&V. Hierarchy of V&V techniques Static Analysis V&V Dynamic Techniques Model Checking Simulation Symbolic Execution Testing Informal.
Condition Testing. Condition testing is a test case design method that exercises the logical conditions contained in a program module. A simple condition.
Identifying “Best Bet” Web Search Results by Mining Past User Behavior Author: Eugene Agichtein, Zijian Zheng (Microsoft Research) Source: KDD2006 Reporter:
Joshua L. Garrett Digital Circuits Design GroupUniversity of California, Berkeley Compact DSM MOS Modeling for Energy/Delay Estimation Joshua Garrett,
ILC Jet Energy Working Group: introduction and discussion Norman Graf (SLAC) LCWS07, Hamburg June 2, 2007.
Intro to Simulink Modified by Gary Balas 20 Feb 2011 Copyright , Andy Packard. This work is licensed under.
7.2* Natural Logarithmic Function In this section, we will learn about: The natural logarithmic function and its derivatives. INVERSE FUNCTIONS.
Federal Land Manager Environmental Database (FED) Overview and Update June 6, 2011 Shawn McClure.
Foundations of Software Testing Chapter 7: Test Adequacy Measurement and Enhancement Using Mutation Last update: September 3, 2007 These slides are copyrighted.
Content Standards A.CED.2 Create equations in two or more variables to represent relationships between quantities; graph equations on coordinate axes with.
On the Relation Between Simulation-based and SAT-based Diagnosis CMPE 58Q Giray Kömürcü Boğaziçi University.
NHS Improvement System Overview Phil Duncan Director.
1-1 Logic and Syntax A computer program is a solution to a problem.
Functions and Logarithms
Copyright © Cengage Learning. All rights reserved.
3.8 Derivatives of Inverse Functions
Status of Reference Network Simulations
PROGRAMME F10 FUNCTIONS.
Federal Land Manager Environmental Database (FED)
الذاكرة طويلة المدى Long-Term Memory
A test technique is a recipe these tasks that will reveal something
Programming Right from the Start with Visual Basic .NET 1/e
Function Notation “f of x” Input = x Output = f(x) = y.
Dr. Fowler  CCM Functions.
Resolution Proofs for Combinational Equivalence
FUNCTION NOTATION AND EVALUATING FUNCTIONS
Algorithms and Problem Solving
Objectives The student will be able to:
Relations/Sequences Objective: Students will learn how to identify if a relation is a function. They will also be able to create a variable expression.
1.3 NEW FUNCTIONS FROM OLD.
Vector Spaces RANK © 2012 Pearson Education, Inc..
Lesson 3.3 Writing functions.
Presentation transcript:

Simulation of Rosetta Models Joseph Kuehn University of Adelaide, Australia

17 th June, 2002Simulation of Rosetta Models2 etc… Rosetta Design Flow Model Rosetta Semantic Object Model parser Test Vectors Refinement Synthesis Simulation Trace Core Libraries simulator

17 th June, 2002Simulation of Rosetta Models3 Simulation Overview AIM: Generate a trace of variable values from a given starting point. Benefits: –Relatively cheap cv exhaustive search. –Can help gain an intuitive feel for a model. –Can highlight incorrect outputs quickly.

17 th June, 2002Simulation of Rosetta Models4 Simulation Overview - cont’d Problems: –Not all domains can be simulated. –Not all models are sufficiently constrained to guarantee that a result can be determined. Solutions: –Generate a suite of inter-operable techniques for simulation rather than rely on a ‘one-size- fits-all’ method.

17 th June, 2002Simulation of Rosetta Models5 Structure Of The Simulator Model simulator Analyse Model select technique iteration chaining solver arithmetic instantiation values y = [a, z, …] x = [42, 3, …] Results User Input

17 th June, 2002Simulation of Rosetta Models6 Pivoting Often the free variable is not explicit: eg. T1: x = f(5, [1,2,3,4,5]); but is defined implicitly: eg. T2: f(x, [1, 4]) = 12; To calculate the value of the free variable we need to pivot the expression to an equivalent reducible expression.

17 th June, 2002Simulation of Rosetta Models7 Pivoting – cont’d Simple example. Develop a lattice of function inverses: –Arithmetic identities. –User-specified pairs. –Automatic detection. pivot irreducible reducible = π+ x5 = π -x 5

17 th June, 2002Simulation of Rosetta Models8 Summary Many benefits of simulation. However not all models, or even all starting points will be traceable. Techniques such as pivoting will expand the space of ‘useful’ models, and hence the viability of using Rosetta for modelling.