About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 94. Chapters: Turing machine, Set theory, Lambda calculus, Boolean satisfiability problem, Automated theorem proving, Vienna Development Method, Liskov substitution principle, Algorithm characterizations, Algorithm examples, UML state machine, Predicate transformer semantics, Software development process, Dependability, IBM Rational Unified Process, Sneak circuit analysis, Satisfiability Modulo Theories, Abstract state machines, Static timing analysis, Formal system, Life-critical system, Semantics of programming languages, Formal equivalence checking, Computer-assisted proof, And-inverter graph, Asynchronous system, Verification and Validation, Retiming, Formal verification, Extended static checking, B-Method, Regulated rewriting, Runtime verification, McCarthy 91 function, Statistical static timing analysis, QED manifesto, High- and low-level, Syntactic methods, Logic in computer science, Binary moment diagram, Oracle Unified Method, POPLmark challenge, Proof-carrying code, Extended finite-state machine, Formal specification, Robbins algebra, Algebraic specification, International Conference on Software Engineering and Formal Methods, Invariant-based programming, Program derivation, BHDL, Model-based specification, Mondex, SLAM project, Strict function, Categorical set theory, Automated proof checking, Refinement calculus, Compcert, Predicative programming, International Symposium on Logic-based Program Synthesis and Transformation, Symbolic simulation, Lustre, State space enumeration, DREAM, Production equipment control, Applicative Universal Grammar, Retrenchment, Concurrency semantics. Excerpt: The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the "characterizations" of the notion of "algorithm" in more detail. This a...
