28.10.2014 Views

Synergy User Manual and Tutorial. - THE CORE MEMORY

Synergy User Manual and Tutorial. - THE CORE MEMORY

Synergy User Manual and Tutorial. - THE CORE MEMORY

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>Synergy</strong> <strong>User</strong> <strong>Manual</strong> <strong>and</strong> <strong>Tutorial</strong><br />

Theory <strong>and</strong> Challenges of Parallel Programs <strong>and</strong> Performance<br />

Evaluation<br />

Basic Logic<br />

Logic is the study of the reasoning of arguments <strong>and</strong> is both a branch of mathematics <strong>and</strong><br />

a branch of philosophy. In the mathematical sense, it is the study of mathematical<br />

properties <strong>and</strong> relations, such as soundness <strong>and</strong> completeness of arguments. In the<br />

philosophical sense, logic is the study of the correctness of arguments. A logic is<br />

comprised of an informal language coupled with model-theoretic semantics <strong>and</strong>/or a<br />

deductive system. The language allows the arguments to be stated, which is similar to<br />

the way we state our thoughts in written or spoken languages. The semantics provide a<br />

definition of possible truth-conditions for arguments <strong>and</strong> the deductive system provides<br />

inferences that are correct for the given language.<br />

This section introduces formal logics that can be used as methods to design program logic<br />

<strong>and</strong> prove that the logic is sound. Systems based on propositional logic have been<br />

produced to facilitate the design <strong>and</strong> proofs for sequential programs. However, these<br />

systems were inadequate for concurrent applications. Variations of temporal logic, which<br />

is based on modal logic, are used to evaluate the logic of concurrent programs.<br />

Propositional Logic<br />

Symbolic logic is divided into several parts of which propositional calculus is the most<br />

fundamental. A proposition, or statement, is any declarative sentence, which is either<br />

true or false. We refer to true (T) or false (F) as the truth-value of the statement.<br />

“1 + 1 = 2” is a true statement.<br />

“1 + 1 = 11” is a false statement.<br />

“Tomorrow will be a sunny day” is a proposition whose truth is yet to be determined.<br />

“The number 1” is not a proposition because it is not a sentence.<br />

Simple statements are those that represent a single idea or subject <strong>and</strong> contain no other<br />

statements within. Simple statements will be represented by the symbols: p, q, r <strong>and</strong> s. If<br />

p st<strong>and</strong>s for the proposition: “ice is cold”, we denote it as:<br />

p: “ice is cold”,<br />

which is read as:<br />

88

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!