000 05440nam a22006135i 4500
001 978-3-540-45719-0
003 DE-He213
005 20160624102007.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540457190
_9978-3-540-45719-0
024 7 _a10.1007/3-540-45719-4
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aAlgebraic Methodology and Software Technology
_h[electronic resource] :
_b9th International Conference, AMAST 2002 Saint-Gilles-les-Bains, Reunion Island, France September 9–13, 2002 Proceedings /
_cedited by Hélène Kirchner, Christophe Ringeissen.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
300 _aXII, 508 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2422
505 0 _aInvited 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic design.
650 0 _aAlgebra
_xData processing.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aSoftware Engineering.
650 2 4 _aProgramming Techniques.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aKirchner, Hélène.
_eeditor.
700 1 _aRingeissen, Christophe.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540441441
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2422
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45719-4
942 _2EBK5536
_cEBK
999 _c34830
_d34830