LEADER 04075nam  22006975  450 
001 996465730103316
005 20200701101242.0
010   $a3-540-46811-0
024 7 $a10.1007/3-540-51803-7
035   $a(CKB)1000000000233468
035   $a(SSID)ssj0000327143
035   $a(PQKBManifestationID)11244018
035   $a(PQKBTitleCode)TC0000327143
035   $a(PQKBWorkID)10297635
035   $a(PQKB)10688320
035   $a(DE-He213)978-3-540-46811-0
035   $a(PPN)155214128
035   $a(EXLCZ)991000000000233468
100   $a20121227d1989      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTemporal Logic in Specification$b[electronic resource] $eAltrincham, UK, April 8-10, 1987, Proceedings /$fedited by Behnam Banieqbal, Howard Barringer, Amir Pnueli
205   $a1st ed. 1989.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1989.
215   $a1 online resource (VIII, 452 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v398
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-51803-7 
327   $aComparing linear and branching time temporal logics -- Interleaving set temporal logic -- An expressive logic for a process algebra with silent actions -- Temporal logic with fixed points -- On the relation of programs and computations to models of temporal logic -- Specification and verification of concurrent programs by ?-automata -- MCTL ? An extension of CTL for modular verification of concurrent systems -- The model checking problem for concurrent systems with many similar processes -- Unified verification theory -- Specifying message passing systems requires extending temporal logic -- Extending interval logic to real time systems -- The prescription and description of state based systems -- Enforcing nondeterminism via linear time temporal logic specifications using hiding -- Specifying communicating systems with temporal logic -- Abstract object types: A temporal perspective -- Compositionality and modularity in process specification and design: A trace-state based approach -- Using temporal logic for prototyping: The design of a lift controller -- The declarative past and imperative future.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v398
606   $aProgramming languages (Electronic computers)
606   $aComputer logic
606   $aMathematical logic
606   $aAlgorithms
606   $aSoftware engineering
606   $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029
615  0$aProgramming languages (Electronic computers).
615  0$aComputer logic.
615  0$aMathematical logic.
615  0$aAlgorithms.
615  0$aSoftware engineering.
615 14$aProgramming Languages, Compilers, Interpreters.
615 24$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aSoftware Engineering.
676   $a005.13
702   $aBanieqbal$b Behnam$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aBarringer$b Howard$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aPnueli$b Amir$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465730103316
996   $aTemporal Logic in Specification$9383027
997   $aUNISA