My Account Log in

1 option

Algebraic Methodology and Software Technology : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / edited by Helene Kirchner, Christophe Ringeissen.

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:
Kirchner, H. (Hélène), editor.
Ringeissen, Christophe, 1967- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2422.
Lecture Notes in Computer Science, 0302-9743 ; 2422
Language:
English
Subjects (All):
Computers.
Software engineering.
Algebra.
Computer logic.
Logic, Symbolic and mathematical.
Theory of Computation.
Software Engineering/Programming and Operating Systems.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Software Engineering.
Local Subjects:
Theory of Computation.
Software Engineering/Programming and Operating Systems.
Algebra.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
Software Engineering.
Physical Description:
1 online resource (XII, 508 pages).
Edition:
First edition 2002.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
System Details:
text file PDF
Summary:
This volume contains the proceedings of AMAST 2002, the 9th International Conference on Algebraic Methodology and Software Technology, held during September 9-13, 2002, in Saint-Gilles-les-Bains, R ́eunion Island, France. The major goal of the AMAST conferences is to promote research that may lead to setting software technology on a ?rm mathematical basis. This goal is achieved through a large international cooperation with contributions from both academia and industry. Developing a software technology on a mathematical basis p- duces software that is: (a) correct, and the correctness can be proved mathem- ically, (b) safe, so that it can be used in the implementation of critical systems, (c) portable, i. e. , independent of computing platforms and language generations, (d) evolutionary, i. e. , it is self-adaptable and evolves with the problem domain. All previous AMAST conferences, which were held in Iowa City (1989, 1991), Twente (1993), Montreal (1995), Munich (1996), Sydney (1997), Manaus (1999), and Iowa City (2000), made contributions to the AMAST goals by reporting and disseminating academic and industrial achievements within the AMAST area of interest. During these meetings, AMAST attracted an international following among researchers and practitioners interested in software technology, progr- ming methodology, and their algebraic, and logical foundations.
Contents:
Invited Papers
From Specifications to Code in Casl
Automata and Games for Synthesis
Pragmatics of Modular SOS
Tool-Assisted Specification and Verification of the JavaCard Platform
Higher-Order Quantification and Proof Search*
Algebraic Support for Service-Oriented Architecture
Regular Papers
Fully Automatic Adaptation of Software Components Based on Semantic Specifications*
HasCasl: Towards Integrated Specification and Development of Functional Programs
Removing Redundant Arguments of Functions*
A Class of Decidable Parametric Hybrid Systems
Vacuity Checking in the Modal Mu-Calculus*
On Solving Temporal Logic Queries
Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations*
An Algebra of Non-safe Petri Boxes
Refusal Simulation and Interactive Games
A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching
Equational Axioms for Probabilistic Bisimilarity
Bisimulation by Unification*
Transforming Processes to Check and Ensure Information Flow Security*
On Bisimulations for the Spi Calculus*
Specifying and Verifying a Decimal Representation in Java for Smart Cards*
A Method for Secure Smartcard Applications
Extending JML Specifications with Temporal Logic
Algebraic Dynamic Programming
Analyzing String Buffers in C
A Foundation of Escape Analysis*
A Framework for Order-Sorted Algebra
Guarded Transitions in Evolving Specifications
Revisiting the Categorical Approach to Systems*
Proof Transformations for Evolutionary Formal Software Development
Sharing Objects by Read-Only References
Class-Based versus Object-Based: A Denotational Comparison
System Descriptions
BRAIN: Backward Reachability Analysis with Integers
The Development Graph Manager Maya.
Other Format:
Printed edition:
ISBN:
978-3-540-45719-0
9783540457190
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.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account