Advances in Computing Science - ASIAN'97
Editat de R. K. Shyamasundar, Kazunori Uedaen Limba Engleză Paperback – 19 noi 1997
Preț: 326.70 lei
Preț vechi: 408.37 lei
-20% Nou
Puncte Express: 490
Preț estimativ în valută:
57.80€ • 67.34$ • 50.48£
57.80€ • 67.34$ • 50.48£
Carte tipărită la comandă
Livrare economică 19 ianuarie-02 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540638759
ISBN-10: 354063875X
Pagini: 408
Ilustrații: XIV, 394 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354063875X
Pagini: 408
Ilustrații: XIV, 394 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Correctness of programs and protocols through randomization.- Medical image analysis and simulation.- Verification of pipelined microprocessors by comparing memory execution sequences in symbolic simulation.- Rules for abstraction.- Combining Z and temporal interval logics for the formalization of properties and behaviors of embedded systems.- Rules for trace consistent reasoning.- Sensitivity analysis of real-time task sets.- Dynamic multiprocessor scheduling for supporting real-time constraints.- Heuristic Diff Acquiring in lazy release consistency model.- Representation of discretely controlled continuous systems in software-oriented formal analysis.- A generalised framework for reasoning with multi-point events.- Implementing constraint retraction for finite domains.- INSTANCE: The intermediate storage node concept.- Checking hybrid automata for linear duration invariants.- Hierarchical automata as model for statecharts.- Proof discovery in LK system by analogy.- Efficient induction of executable logic programs from examples.- Automated verification of behavioural properties of prolog programs.- Typing the use of resources in a concurrent calculus.- An imperative language with read/write type modes.- Efficient goal scheduling in a concurrent logic language using type-based dependency analysis.- An analysis of divisibility orderings and recursive path orderings.- Share-where maintenance in visual algebraic specifications.- A fault tolerant broadcast scheme in star graphs.- Calculus of classical proofs I.- Tracing the evaluation of lazy functional languages: A model and its implementation.- Basic results in automatic transformations of shared memory parallel programs into sequential programs.- Recurrent oscillatory self-organizing map: Adapting to complex environmental periodicities.- Basic binary decision diagram operations for image processing.- Adaptive object storage system for mobile computing environments.- Structure of user interface module for practical internet messages.- Software specification using LASS.- Nepi2: a two-level calculus for network programming based on the ?-calculus.- On semantics of reactive rule-based systems.- The non-standard semantics of Esterel.- Hybrid support for lenient implementation of Array-comprehension.- Solver for hierarchical CSP containing several constraint types and multi-output constraints.