الصفحة 2
الصفحة 2
Algebraic informatics ; 2nd International conference, CAI 2007, Thessalonkik, Greece, May 21-25, 2007, Revised Selected and Invited Papers
It covers algebraic semantics on graphs and trees, formal power series, syntactic objects, algebraic picture processing, infinite computation, acceptors and transducers for strings, trees, graphs, arrays, etc., and decision problems.
Algebraic Biology ; 3rd International Conference, AB 2008, Castle of Hagenberg, Austria, July 31-August 2, 2008 Proceedings
This book constitutes the refereed proceedings of the Third International Conference on Algebraic Biology, AB 2008, held at the Castle of Hagenberg, Austria in July 2008 as part of the RISC Summer 2008, organized by the Research Institute for Symbolic Computation.
Algebraic Biology ; 2nd International Conference, AB 2007, Castle of Hagenberg, Austria, July 2-4, 2007, Proceedings
This volume constitutes the refereed proceedings of the Second International Conference on Algebraic Biology. The conference served as an interdisciplinary forum for the presentation of research on all aspects of the application of symbolic computation in biology, including computer algebra, computational logic, and related methods.
Algebra and Coalgebra in Computer Science ; 2nd International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007, Proceedings
Addressing two basic areas of application for algebras and coalgebras - as mathematical objects as well as in the context of their application in computer science - the papers cover topics such as abstract models and logics, specialised models and calculi, algebraic and coalgebraic semantics, and system specification and verification.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
A Theory of Distributed Objects : Asynchrony - Mobility - Groups - Components
Distributed and communicating objects are becoming ubiquitous. In global, Grid and Peer-to-Peer computing environments, extensive use is made of objects interacting through method calls. So far, no general formalism has been proposed for the foundation of such systems. Caromel and Henrio are the first to define a calculus for distributed objects interacting using asynchronous method calls with generalized futures, i.e., wait-by-necessity -- a must in large-scale systems, providing both high structuring and low coupling, and thus scalability. The authors provide very generic results on expressiveness and determinism, and the potential of their approach is further demonstrated by its capacity to cope with advanced issues such as mobility, groups, and components.
