This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.). One of the best-selling programming books published in the last fifty years, "K&R" has been called everything from the "bible" to "a landmark in computer science" and it has influenced generations of programmers. Available now for all leading ebook platforms, this concise and beautifully written text is a "must-have" reference for every serious programmers digital library.

As modestly described by the authors in the Preface to the First Edition, this "is not an introductory programming manual; it assumes some familiarity with basic programming concepts like variables, assignment statements, loops, and functions. Nonetheless, a novice programmer should be able to read along and pick up the language, although access to a more knowledgeable colleague will help."

The C programming language

Process algebra is the study of distributed or parallel syst em by algebraic means. Originating in computer science, process algebra has been extended in re ce t years to encompass not just discrete-event systems, but also continuously evolving ph enomena, resulting in so-called hybrid process algebras. A hybrid process algebra can be used for th e specification, simulation, control and verification of embedded systems in combination with the ir environment, and for any dynamic system in general. As the vehicle of our exposition, we use th e hybrid process algebra χ (Chi). The syntax and semantics of χ are discussed, and it is explained how equational reasoning simplifies tool implementations for simulation and verification. A bot tle filling line example is introduced to illustrate system analysis by means of equational reasonin g.

Process algebra

This paper describes a new symbolic model checker, called NuSMV, developed as part of a joint project between CMU and IRST. NuSMV is the result of the reengineering, reimplementation and, to a limited extent, extension of the CMU SMV model checker. The core of this paper consists of a detailed description of the NuSMV functionalities, architecture, and implementation.

/pdf/nusmv-a-new-symbolic-model-checker-10i04hxity.pdf

NUSMV: a new symbolic model checker

A translation apparatus is provided which comprises: an inputting section for inputting a source document in a natural language; a layout analyzing section for analyzing layout information including cascade information, itemization information, numbered itemization information, labeled itemization information and separator line information in the source document inputted by the inputting section and specifying a translation range on the basis of the layout information; a translation processing section for translating a source document text in the specified translation range into a second language; and an outputting section for outputting a translated text provided by the translation processing section.

Automated Planning: Theory and Practice.

Handbook of logic in computer science.

/pdf/cadp-a-protocol-validation-and-verification-toolbox-4swgy2tz14.pdf

CADP - A Protocol Validation and Verification Toolbox

Model-checking is a successful technique for automatically verifying concurrent finite-state systems. When designing a model-checker, a good compromise must be made between the expressive power of the property description formalism, the complexity of the model-checking problem, and the user-friendliness of the interface. We present a temporal logic and an associated model-checking method that attempt to fulfill these criteria. The logic is an extension of the alternation-free µ-calculus with ACTL-like action formulas and PDL-like regular expressions, allowing a concise and intuitive description of safety, liveness, and fairness properties over labeled transition systems. The model-checking method is based upon a succinct translation of the verification problem into a boolean equation system, which is solved by means of an efficient local algorithm having a good average complexity. The algorithm also allows to generate full diagnostic information (examples and counterexamples) for temporal formulas. This method is at the heart of the EVALUATOR 3.0 model-checker that we implemented within the CADP toolbox using the generic OPEN/CAESAR environment for on-the-fly verification.

https://hal.inria.fr/inria-00072755/document

Efficient on-the-fly model-checking for regular alternation-free mu-calculus

Finite-state model-checkers such as Smv [13] and Spin [11] do not allow to deal with important aspects that appear in modelling and analysing complex systems, e.g., communication protocols. Among these aspects: real-time constraints, manipulation of unbounded data structures like counters, communication through unbounded channels, parametric reasoning, etc.

TReX: A Tool for Reachability Analysis of Complex Systems

We introduce a uniform framework for reasoning about infinite-state systems with unbounded control structures and unbounded data domains. Our framework is based on constrained rewriting systems on words over an infinite alphabet. We consider several rewriting semantics: factor, prefix, and multiset rewriting. Constraints are expressed in a logic on such words which is parametrized by a first-order theory on the considered data domain. We show that our framework is suitable for reasoning about various classes of systems such as recursive sequential programs, multithreaded programs, parametrized and dynamic networks of processes, etc. Then, we provide generic results (1) for the decidability of the satisfiability problem of the fragment ? * ? * of this logic provided that the underlying logic on data is decidable, and (2) for proving inductive invariance and for carrying out Hoare style reasoning within this fragment. We also show that the reachability problem is decidable for a class of prefix rewriting systems with integer data.

Rewriting Systems with Data

Process algebras are suitable for describing networks of communicating processes. In most process algebras, the description of such networks is achieved using parallel composition operators. Noticing that the parallel composition operators commonly found in process algebras are often limited in expressiveness and/or difficult for novice users, we propose a new parallel operator that allows networks of communicating processes to be described easily, in a simple and well-structured manner. We illustrate on various examples (token-ring network and client-server protocol) the theoretical and practical merits of this operator.

/pdf/a-graphical-parallel-composition-operator-for-process-2onuz36ya7.pdf

Mihaela Sighireanu

Papers

CADP - A Protocol Validation and Verification Toolbox

Efficient on-the-fly model-checking for regular alternation-free mu-calculus

TReX: A Tool for Reachability Analysis of Complex Systems

Rewriting Systems with Data

A Graphical Parallel Composition Operator for Process Algebras