My Account Log in

1 option

Advances in Computing Science - ASIAN'97 : Third Asian Computing Science Conference, Kathmandu, Nepal, December 9-11, 1997. Proceedings / edited by R.K. Shyamasundar, Kazunori Ueda.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Shyamasundar, Rudrapatna, 1950- editor.
Ueda, Kazunori, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1345.
Lecture Notes in Computer Science, 0302-9743 ; 1345
Language:
English
Subjects (All):
Software engineering.
Computers.
Artificial intelligence.
Computer networks.
Microprocessors.
Software Engineering/Programming and Operating Systems.
Theory of Computation.
Artificial Intelligence.
Computer Communication Networks.
Processor Architectures.
Local Subjects:
Software Engineering/Programming and Operating Systems.
Theory of Computation.
Artificial Intelligence.
Computer Communication Networks.
Processor Architectures.
Physical Description:
1 online resource (XIV, 394 pages).
Edition:
First edition 1997.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
System Details:
text file PDF
Summary:
This book constitutes the refereed proceedings of the Third Asian Computing Science Conference, ASIAN'97, held in Kathmandu, Nepal, in December 1997. The volume presents 24 revised full papers selected from a total of 94 submissions. Also included are an abstract of the keynote by Michael O. Rabin, two full invited presentations, and 10 posters. Among the areas addressed are programming languages, formal methods, mathematical logic, reasoning and constraints, real-time computing, networking, mobile computing, image processing, hardware verification, and parallel processing.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-69658-2
9783540696582
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account