{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":15,"n_cols":5,"rows_kept":15,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[11,2,11,3],[14,2,14,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996466364003316"]
[null,null,"Titolo",null,"Logics of Programs and Their Applications [[electronic resource] ] : Proceedings, Poznan, August 23-29, 1980 / / edited by A. Salwicki"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983"]
[null,null,"ISBN",null,"3-540-39445-1"]
[null,null,"Edizione",null,"[1st ed. 1983.]"]
[null,null,"Descrizione fisica",null,"1 online resource (VIII, 328 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 148"]
[null,null,"Disciplina",null,"005.1015113"]
[null,null,"Soggetti",null,"Computer logic"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Sharpening the characterization of the power of Floyd method -- On proving program correctness by means of stepwise refinement method -- Semantics and implementation of prefixing at many levels -- Nonstandard models in Propositional Dynamic Logic -- On priorities of parallelism: Petri nets under the maximum firing strategy -- On four logics of programs and complexity of their satisfiability problems : Extended abstract -- Are infinite behaviours of parallel system schemata necessary? -- Algorithmic properties of finitely generated structures -- Algebraic semantics and program logics: Algorithmic logic for program trees -- Some model-theoretical properties of logic for programs with random control -- A formal system for parallel programs in discrete time and space -- On the propositional algorithmic theory of arithmetic -- Nonstandard runs of Floyd-provable programs -- On some extensions of dynamic logic -- On algorithmic logic with partial operations -- Towards a theory of parallelism and communications for increasing efficiency in applicative languages -- An operational semantics for CSP -- Programming languages and logics of programs -- Concurrent programs -- Axiomatic approach to the system of files -- A sequent calculus for Kröger logic -- On axiomatization of process logic -- Filtration theorem for dynamic algebras with tests and inverse operator."]