LEADER 04378nam  22006615  450 
001 996465596403316
005 20200705171414.0
010   $a3-540-49573-8
024 7 $a10.1007/BFb0024423
035   $a(CKB)1000000000234557
035   $a(SSID)ssj0000323236
035   $a(PQKBManifestationID)11212802
035   $a(PQKBTitleCode)TC0000323236
035   $a(PQKBWorkID)10312544
035   $a(PQKB)11083048
035   $a(DE-He213)978-3-540-49573-4
035   $a(PPN)155200925
035   $a(EXLCZ)991000000000234557
100   $a20121227d1996      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aFormal Systems Specification$b[electronic resource] $eThe RPC-Memory Specification Case Study /$fedited by Manfred Broy, Stephan Merz, Katharina Spies
205   $a1st ed. 1996.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996.
215   $a1 online resource (XXIII, 543 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1169
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-61984-4 
327   $aThe RPC-memory specification problem problem statement -- The RPC-memory case study: A synopsis -- A TLA solution to the RPC-memory specification problem -- A dynamic specification of the RPC-memory problem -- A memory module specification using composable high-level petri nets -- Constraint oriented temporal logic specification -- A functional solution to the RPC-memory specification problem -- A solution relying on the model checking of boolean transition systems -- Applying a temporal logic to the RPC-memory specification problem -- Using PVS for an assertional verification of the RPC-memory specification problem -- Specification and verification using a visual formalism on top of temporal logic -- A case study in verification based on trace abstractions -- Incremental specification with joint actions: The RPC-memory specification problem -- The methodology of modal constraints -- Tackling the RPC-memory specification problem with I/O automata -- Using relations on streams to solve the RPC-memory specification problem -- The RPC-memory specification problem: UNITY + refinement calculus.
330   $aThe RPC-memory specification problem was proposed by Broy and Lamport as a case study in the formal design of distributed and concurrent systems. As a realistic example typical for operating systems and hardware design, the RPC-memory problem was used as the basis for comparing various approaches to formal specification, refinement, and verification. Preliminary solutions were discussed during a workshop at Schloss Dagstuhl, Germany, in September 1994. Then an extensive discussion took place between the referees and authors. Finally 15 thoroughly revised papers were accepted for inclusion in this volume in full detail together with the problem statement and a synopsis.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1169
606   $aComputers
606   $aSoftware engineering
606   $aComputer communication systems
606   $aComputer logic
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
606   $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
615  0$aComputers.
615  0$aSoftware engineering.
615  0$aComputer communication systems.
615  0$aComputer logic.
615 14$aTheory of Computation.
615 24$aSoftware Engineering.
615 24$aComputer Communication Networks.
615 24$aLogics and Meanings of Programs.
676   $a004/.36
702   $aBroy$b Manfred$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aMerz$b Stephan$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSpies$b Katharina$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465596403316
996   $aFormal systems specification$91487580
997   $aUNISA