Systems for Reasoning about Computation Errors
ثبت نشده
چکیده
In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without distinguishing between them, we combine Kleene and McCarthy logics into a logic based on a non-deterministic, 3-valued matrix, incorporating both options as a non-deterministic choice. If the two strategies are to be distinguished, Kleene and McCarthy logics are combined into a logic based on a 4-valued deterministic matrix featuring two kinds of computation errors which correspond to the two computation strategies described above. For the resulting logics, we provide sound and complete calculi of ordinary, two-valued sequents.
منابع مشابه
On Rewriting Terms with Strict Functions and Error Propagation
Partial functions play an essential role in the semantics of programs as a means to formalize non-terminating computations and computations terminating in an exception or error situation. However, when properly formalized, partial functions and errors often complicate underlying formalisms and reasoning systems. In this paper we focus on term rewriting systems, and discuss how partial functions...
متن کاملLoad-Frequency Control: a GA based Bayesian Networks Multi-agent System
Bayesian Networks (BN) provides a robust probabilistic method of reasoning under uncertainty. They have been successfully applied in a variety of real-world tasks but they have received little attention in the area of load-frequency control (LFC). In practice, LFC systems use proportional-integral controllers. However since these controllers are designed using a linear model, the nonlinearities...
متن کاملCan Formal Methods be Applied to Software Architecture?
The software architecture of a program or computing system is the structure or structures of the system, which comprise software components, the externally visible properties of those components, and the relationships among them. In other words, software architecture is the study of boxes and lines. For the most part, software architecture is informal in the sense that it is diÆcult to assign p...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملView-Centric Reasoning about Space-Based Middleware
Distributed computing systems, including those that utilize space-based middleware, present significant challenges when attempting to reason formally about their behaviors and properties. In particular, two or more computational events may occur in parallel. We introduce View-Centric Reasoning (VCR)—a set of abstractions that comprises a general framework for reasoning about parallel and distri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009