04013nam 22005415 450 99646634130331620200702155313.03-540-38775-710.1007/3-540-12896-4(CKB)1000000000230318(SSID)ssj0000324551(PQKBManifestationID)11254259(PQKBTitleCode)TC0000324551(PQKBWorkID)10314284(PQKB)11056062(DE-He213)978-3-540-38775-6(PPN)155199048(EXLCZ)99100000000023031820121227d1984 u| 0engurnn|008mamaatxtccrLogics of Programs[electronic resource] Workshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983 /edited by E. Clarke, D. Kozen1st ed. 1984.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1984.1 online resource (VI, 531 p.) Lecture Notes in Computer Science,0302-9743 ;164Bibliographic Level Mode of Issuance: Monograph3-540-12896-4 A static analysis of CSP programs -- Compactness in semantics for merge and fair merge -- Algebraic tools for system construction -- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness -- The intractability of validity in logic programming and dynamic logic -- A semantics and proof system for communicating processes -- Non-standard fixed points in first order logic -- Automatic verification of asynchronous circuits -- Mathematics as programming -- Characterization of acceptable by algol-like programming languages -- A rigorous approach to fault-tolerant system development -- A sound and relatively complete axiomatization of clarke's language L4 -- Deciding branching time logic: A triple exponential decision procedure for CTL -- Equations in combinatory algebras -- Reasoning about procedures as parameters -- Introducing institutions -- A complete proof rule for strong equifair termination -- Necessary and sufficient conditions for the universality of programming formalisms -- There exist decidable context free propositonal dynamic logics -- A decision procedure for the propositional ?-calculus -- A verifier for compact parallel coordination programs -- Information systems, continuity and realizability -- A complete system of temporal logic for specification schemata -- Reasoning in interval temporal logic -- Hoare's logic for programs with procedures — What has been achieved? -- A theory of probabilistic programs -- A low level language for obtaining decision procedures for classes of temporal logics -- Deriving efficient graph algorithms (summary) -- An introduction to specification logic -- An interval-based temporal logic -- Property preserving homomorphisms of transition systems -- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview -- Yet another process logic -- A proof system for partial correctness of dynamic networks of processes -- Errata.Lecture Notes in Computer Science,0302-9743 ;164Computer logicMathematical logicLogics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Computer logic.Mathematical logic.Logics and Meanings of Programs.Mathematical Logic and Formal Languages.005.1015113Clarke Eedthttp://id.loc.gov/vocabulary/relators/edtKozen Dedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466341303316Logics of programs332017UNISA