Algebraic Semantics [[electronic resource] /] / by I. Guessarian |
Autore | Guessarian I |
Edizione | [1st ed. 1981.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 |
Descrizione fisica | 1 online resource (XIV, 162 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Logics and Meanings of Programs |
ISBN | 3-540-38417-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1 — Introduction -- 2 — Magmas, algebras and trees -- 3 — Program schemes -- 4 — Semantics -- 5 — Classes of interpretations -- 6 — Program transformations. |
Record Nr. | UNISA-996465502803316 |
Guessarian I
![]() |
||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1981 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Application and Theory of Petri Nets and Concurrency [[electronic resource] ] : 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, June 24-29, 2018, Proceedings / / edited by Victor Khomenko, Olivier H. Roux |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XI, 427 p. 124 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Artificial intelligence—Data processing Algorithms Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Software Engineering Data Science Discrete Mathematics in Computer Science |
ISBN | 3-319-91268-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Petri Nets Synthesis -- Analysis and Model Checking -- Languages -- Semantics and Expressiveness -- Tools. |
Record Nr. | UNISA-996465825003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Application and Theory of Petri Nets and Concurrency : 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, June 24-29, 2018, Proceedings / / edited by Victor Khomenko, Olivier H. Roux |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XI, 427 p. 124 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Artificial intelligence—Data processing Algorithms Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Software Engineering Data Science Discrete Mathematics in Computer Science |
ISBN | 3-319-91268-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Petri Nets Synthesis -- Analysis and Model Checking -- Languages -- Semantics and Expressiveness -- Tools. |
Record Nr. | UNINA-9910349429703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Automata, Languages and Programming [[electronic resource] ] : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2010. Proceedings, Part II / / edited by Luca Aceto, Monika Henzinger, Jiri Sgall |
Edizione | [1st ed. 2011.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
Descrizione fisica | 1 online resource (XXVI, 666 p.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Machine theory Computer networks Algorithms Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Communication Networks Theory of Computation |
ISBN | 3-642-22012-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465552603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Automata, Languages and Programming [[electronic resource] ] : 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings / / edited by Laurent Kott |
Edizione | [1st ed. 1986.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
Descrizione fisica | 1 online resource (XII, 476 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Mathematical logic Computers Logics and Meanings of Programs Mathematical Logic and Formal Languages Computation by Abstract Devices |
ISBN | 3-540-39859-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Characterizations of PUNC and precomputation -- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach -- A new duality result concerning Voronoi diagrams -- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial -- On exponential lowness -- A tradeoff between search and update time for the implicit dictionary problem -- Intersections of some families of languages -- Correspondence between ternary simulation and binary race analysis in gate networks -- Counting with rational functions -- Finite biprefix sets of paths in a Graph -- Parallel RAMs with owned global memory and deterministic context-free language recognition -- A Strong restriction of the inductive completion procedure -- On discerning words by automata -- Complexity classes without machines: On complete languages for UP -- Containment, separation, complete sets, and immunity of complexity classes -- On nontermination of Knuth-Bendix algorithm -- Tradeoffs for language recognition on parallel computing models -- Rational equivalence relations -- Some further results on digital search trees -- Knowledge, belief and time -- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication -- Decompositions of nondeterministic reductions -- Hierarchical planarity testing algorithms -- Synthesis and equivalence of concurrent systems -- The set union problem with backtracking -- Torsion matrix semigroups and recognizable transductions -- On recognizable subsets of free partially commutative monoids -- Min Cut is NP-complete for edge weighted trees -- Alternating automata, the weak monadic theory of the tree, and its complexity -- Subpolynomial complexity classes of real functions and real numbers -- Etude syntaxique des parties reconnaissables de mots infinis -- Refusal testing -- A timed model for communicating sequential processes -- A uniform reduction theorem extending a result of J. Grollmann and A. Selman -- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs -- A new approach to detection of locally indicative stability -- A more efficient algorithm for lattice basis reduction -- Lower bounds by recursion theoretic arguments -- An improved algorithm for transitive closure on acyclic digraphs -- Un algorithme determinant les melanges de deux mots -- A very fast, practical algorithm for finding a negative cycle in a digraph -- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language -- Semigroups and languages of dot-depth 2 -- A parallel vertex insertion algorithm for minimum spanning trees -- More complicated questions about maxima and minima, and some closures of NP -- Lower bounds for dynamic range query problems that permit subtraction (extended abstract) -- E-unification algorithms for a class of confluent term rewriting systems -- On fixed-point clones. |
Record Nr. | UNISA-996465710203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Axiomatising the Logic of Computer Programming [[electronic resource] /] / by R. Goldblatt |
Autore | Goldblatt R |
Edizione | [1st ed. 1982.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1982 |
Descrizione fisica | 1 online resource (XIII, 304 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Logics and Meanings of Programs |
ISBN | 3-540-39038-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Conceptual background -- The logical structure of commands -- Assignments -- Appendix 1 Some related studies -- Function declarations -- Procedures -- Arrays. |
Record Nr. | UNISA-996466339503316 |
Goldblatt R
![]() |
||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1982 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
CAAP '83 [[electronic resource] ] : Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings / / edited by G. Ausiello, M. Protasi |
Edizione | [1st ed. 1983.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 |
Descrizione fisica | 1 online resource (X, 418 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Logics and Meanings of Programs |
ISBN | 3-540-38714-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Generalized heterogeneous algebras and partial interpretations -- Applicative information systems -- Acyclic database schemes (of various degrees): A painless introduction -- Efficient algorithms for finding maximal matching in graphs -- A survey of NLC grammars -- Prefix and perfect languages -- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets -- VLSI mesh of trees for data base processing -- Continuite des transducteurs d'etats finis d'arbres -- Completeness results for a polymorphic type system -- A class of program schemes based on tree rewriting systems -- Complete sets of unifiers and matchers in equational theories -- Digital search trees and the generation of an exponentially distributed variate -- Decidable properties of monadic recursive schemas with a depth parameter -- Nivat-processing systems: Decision problems related to protection and synchronization -- Confluent and coherent equational term rewriting systems application to proofs in abstract data types -- An application of maximum bipartite c-matching to subtree isomorphism' -- Characterizing specification languages which admit initial semantics -- Topological bandwidth -- Probabilistic analysis of graph colouring algorithms -- Some further approximation algorithms for the vertex cover problem -- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes -- Remarks on the pyramidal structure -- Structured theories in LCF -- Alternating tree automata -- Cofinality in reduction graphs. |
Record Nr. | UNISA-996466337703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1983 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Category Theory and Computer Programming [[electronic resource] ] : Tutorial and Workshop, Guildford, U.K., September 16 - 20, 1985. Proceedings / / edited by David Pitt, Samson Abramsky, Axel Poigne, David Rydeheard |
Edizione | [1st ed. 1986.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
Descrizione fisica | 1 online resource (X, 522 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Computer programming Logics and Meanings of Programs Programming Techniques |
ISBN | 3-540-47213-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Categories -- Elements of categorical reasoning : Products and coproducts and some other (co-)limits -- Functors and natural transformations -- Adjunctions -- Cartesian closure — Higher types in categories -- Algebra categorically -- Category theory and logic -- Categories, data types, and imperative languages -- Category theory and programming language semantics: An overview -- Weakest preconditions: Categorical insights -- A categorical view of weakest liberal preconditions -- Functor-category semantics of programming languages and logics -- Finite approximation of spaces -- Categories of partial morphisms and the ?P-calculus -- A note on distributive laws and power domains -- Category theory and models for parallel computation -- Categorical models of process cooperation -- Galois connections and computer science applications -- A study in the foundations of programming methodology: Specifications, institutions, charters and parchments -- Bits and pieces of the theory of institutions -- Extended ML: An institution-independent framework for formal program development -- Behavioural program specification -- Key extensions of abstract data types, final algebras, and database semantics -- Theories as categories -- Internal completeness of categories of domains -- Formalising the network and hierarchical data models — an application of categorical Logic -- A categorical unification algorithm -- Computing with categories. |
Record Nr. | UNISA-996465967403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Compositionality, Concurrency, and Partial Correctness [[electronic resource] ] : Proof Theories for Networks of Processes, and Their Relationship / / by Job Zwiers |
Autore | Zwiers Job |
Edizione | [1st ed. 1989.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
Descrizione fisica | 1 online resource (VIII, 276 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Software engineering Programming languages (Electronic computers) Logics and Meanings of Programs Software Engineering Programming Languages, Compilers, Interpreters |
ISBN | 3-540-46101-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The languages DNP and TNP -- The semantics for TNP -- Correctness formulae -- Proof systems for TNP -- Completeness -- The Hoare and Invariant systems. |
Record Nr. | UNISA-996465315203316 |
Zwiers Job
![]() |
||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer Aided Verification [[electronic resource] ] : 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part II / / edited by Hana Chockler, Georg Weissenbacher |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XX, 545 p. 106 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Artificial intelligence Machine theory Algorithms Computer simulation Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence Formal Languages and Automata Theory Computer Modelling |
ISBN | 3-319-96142-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996466443703316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|