000 04175nam a22006015i 4500
001 978-3-540-49213-9
003 DE-He213
005 20240423132509.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540492139
_9978-3-540-49213-9
024 7 _a10.1007/3-540-49213-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCompositionality: The Significant Difference
_h[electronic resource] :
_bInternational Symposium, COMPOS’97 Bad Malente, Germany, September 8–12, 1997 Revised Lectures /
_cedited by Willem-Paul de Roever, Hans Langmaack, Amir Pnueli.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aVIII, 647 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,
_x1611-3349 ;
_v1536
505 0 _aThe Need for Compositional Proof Systems: A Survey -- Alternating-time Temporal Logic -- Compositionality in dataflow synchronous languages: specification & code generation -- Compositional Reasoning in Model Checking -- Modeling Urgency in Timed Systems -- Compositional Refinement of Interactive Systems Modelled by Relations -- Toward Parametric Verification of Open Distributed Systems -- A Compositional Real-time Semantics of STATEMATE Designs -- Deductive Verification of Modular Systems -- Compositional Verification of Real-Time Applications -- Compositional Proofs for Concurrent Objects -- An overview of compositional translations -- Compositional Verification of Multi-Agent Systems: a Formal Analysis of Pro-activeness and Reactiveness -- Modular Model Checking -- Composition: A Way to Make Proofs Harder -- Compositionality Criteria for Defining Mixed-Styles Synchronous Languages -- Compositional Reasoning using Interval Temporal Logic and Tempura -- Decomposing Real-Time Specifications -- On the Combination of Synchronous Languages -- Compositional Verification of Randomized Distributed Algorithms -- Lazy Compositional Verication -- Compositional Reasoning Using the Assumption-Commitment Paradigm -- An Adequate First Order Interval Logic -- Compositional Transformational Design for Concurrent Programs -- Compositional proof methods for concurrency: A semantic approach.
520 _aThis book originates from the International Symposium on Compositionality, COMPOS'97, held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full version reflect the current state of the art in the area of compositional reasoning about concurrency. The book is a valuable reference for researchers and professionals interested in formal systems design and analysis; it also is well suited for self study and use in advanced courses.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aMachine theory.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aArtificial Intelligence.
700 1 _aRoever, Willem-Paul de.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLangmaack, Hans.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPnueli, Amir.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540654933
776 0 8 _iPrinted edition:
_z9783662193129
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1536
856 4 0 _uhttps://doi.org/10.1007/3-540-49213-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188396
_d188396