000 | 05696nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-49253-5 | ||
003 | DE-He213 | ||
005 | 20160624102041.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540492535 _9978-3-540-49253-5 |
||
024 | 7 |
_a10.1007/3-540-49253-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] : _b7th International Conference, AMAST’98 Amazonia, Brazil, January 4–8, 1999 Proceedings / _cedited by Armando M. Haeberer. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
300 |
_aXII, 540 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 ; _v1548 |
|
505 | 0 | _aInvited Talks (Extended Abstracts) -- Duration Calculus, a Logical Approach to Real-Time Systems -- Abstract Algebraic Logic -- Systematising Reactive System Design -- Systematic Design of Call-Coverage Features -- Visual Abstractions for Temporal Verification -- A Linear Metalanguage for Concurrency -- Presentations -- Verification of Bounded Delay Asynchronous Circuits with Timed Traces -- Verification of Temporal Properties of Processes in a Setting with Data -- A Logic for Real-Time Systems Specification Its Algebraic Semantics and Equational Calculus -- Effective Recognizability and Model Checking of Reactive Fiffo Automata -- Combining Methods for the Livelock Analysis of a Fault-Tolerant System -- Presentations -- Separating Sets by Modal Formulas -- Interpolation in Modal Logic -- Building Models of Linear Logic -- Term Rewriting in a Logic of Special Relations -- Abstraction Barriers in Equational Proof -- Presentations -- A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes -- A Trace-Based Refinement Calculus for Shared-Variable Parallel Programs -- Consistency of Partial Process Specifications -- Observational Logic -- Scheduling Algebra -- Presentations -- Algebraic Semantics of Coordination or What Is in a Signature -- An Algebraic Approach to Combining Processes in a Hardware/Software Partitioning Environment -- An Algebraic View of Program Composition -- Architectural Specifications in CASL -- Pi-Congruences as CCS Equivalences -- Presentations -- Algebraic Specifications, Higher-Order Types and Set-Theoretic Models -- Type Analysis for CHIP -- Categorical Programming with Abstract Data Types -- Condensing Lemmas for Pure Type Systems with Universes -- Improving Computations in a Typed Functional Logic Language -- Presentations -- Abstract Interpretation of Prolog Programs -- Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos -- A Single Perspective on Arrows between Institutions -- On Oracles for Interpreting Test Results against Algebraic Specifications -- Systems and Tool Demonstrations -- Recopla: An Extendible Graphic Meta-Editor -- The State of PEP -- The Abaco System — An Algebraic Based Action COmpiler. | |
520 | _aAMAST’s goal is to advance awareness of algebraic and logical methodology as part of the fundamental basis of software technology. Ten years and seven conferences after the start of the AMAST movement, I believe we are attaining this. The movement has propagated throughout the world, assembling many enthusiastic specialists who have participated not only in the conferences, which are now annual, but also in the innumerable other activities that AMAST promotes and supports. We are now facing the Seventh International Conference on Algebraic Methodology and Software Technology (AMAST’98). The previous meetings were held in Iowa City, USA (1989 and 1991), in Enschede, The Netherlands (1993), in Montreal, Canada (1995), in Munich, Germany (1996), and in Sydney, Australia (1997). This time it is Brazil’s turn, in a very special part of this colorful country – Amazonia. Thus, “if we have done more it is by standing on the shoulders of giants.” The effort started by Teodor Rus, Arthur Fleck, and William A. Kirk at AMAST’89 was consolidated in AMAST'91 by Teodor Rus, Maurice Nivat, Charles Rattray, and Giuseppe Scollo. Then came modular construction of the building, wonderfully carried out by Giuseppe Scollo, Vangalur Alagar, Martin Wirsing, and Michael Johnson, as Program Chairs of the AMAST conferences held between 1993 and 1997. | ||
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 | _aSoftware Engineering. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
700 | 1 |
_aHaeberer, Armando M. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540654629 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1548 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-49253-4 |
942 |
_2EBK6723 _cEBK |
||
999 |
_c36017 _d36017 |