Model-based Derivation and Refinement of Abstract Programs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refinement of an Abstract Model of MSG

This report describes the second phase of an experiment designed to demonstrate techniques for software development and evolution. The experiment involves the production of a family of functionally similar systems on dissimilar host computers with markedly different operating systems. The basic technique used is machine-assisted stepwise refinement from an abstract model program that embodies t...

متن کامل

Extended Abstract - Model-Based Debugging of Java Programs

Model-based reasoning is a central concept in current research into intelligent diagnostic systems. It is based on the assumption that sources of incorrect behavior in technical devices can be located and identified via the existence of a model describing the basic properties of components of a certain application domain. When actual data concerning the misbehavior of a system composed from suc...

متن کامل

Abstract Interpretation of Programs for Model-Based Debugging

Interpretation of Programs for Model-Based Debugging Wolfgang Mayer Markus Stumptner Advanced Computing Research Centre University of South Australia [mayer,mst]@cs.unisa.edu.au

متن کامل

View-Based Propagator Derivation - (Extended Abstract)

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constraint variants are ubiquitous: implementing them requires considerable effort, but yields better performance. This abstract shows how to use views to derive propagator variants where ...

متن کامل

Data Refinement of Invariant Based Programs

Invariant based programming is an approach where we start to construct a program by first identifying the basic situations (preand postconditions as well as invariants) that could arise during the execution of the algorithm. These situations are identified before any code is written. After that, we identify the transitions between the situations, which will give us the flow of control in the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems

سال: 1995

ISSN: 0385-4221,1348-8155

DOI: 10.1541/ieejeiss1987.115.8_992