Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, Languages and Programming [[electronic resource] ] : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl
| Automata, Languages and Programming [[electronic resource] ] : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 952 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer communication systems Special purpose computers Computer science—Mathematics Theory of Computation Software Engineering/Programming and Operating Systems Computer Communication Networks Special Purpose and Application-Based Systems Mathematics of Computing |
| ISBN | 3-540-45022-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the Analysis of Cryptographic Protocols -- Average Bit-Complexity of Euclidean Algorithms -- Planar Maps and Airy Phenomena -- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System -- Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract) -- Award Talk -- The Genomics Revolution and Its Challenges for Algorithmic Research -- Invited Talk -- Alternating the Temporal Picture for Safety -- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations -- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP -- A New Unfolding Approach to LTL Model Checking -- Reasoning about Message Passing in Finite State Environments -- Extended Notions of Security for Multicast Public Key Cryptosystems -- One-Round Secure Computation and Secure Autonomous Mobile Agents -- Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing -- On the Centralizer of a Finite Set -- On the Power of Tree-Walking Automata -- Determinization of Transducers over Infinite Words -- Invited Talk -- Constraint Programming and Graph Algorithms -- Scalable Secure Storage when Half the System Is Faulty -- Generating Partial and Multiple Transversals of a Hypergraph -- Revisiting the Correspondence between Cut Elimination and Normalisation -- Negation Elimination from Simple Equational Formulae -- Hardness of Set Cover with Intersection 1 -- Strong Inapproximability of the Basic k-Spanner Problem -- Infinite Series-Parallel Posets: Logic and Languages -- On Deciding if Deterministic Rabin Language Is in Büchi Class -- On Message Sequence Graphs and Finitely Generated Regular MSC Languages -- Invited Talk -- Pseudorandomness -- A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols -- Deterministic Radio Broadcasting -- An ?-Complete Equational Specification of Interleaving -- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors -- Tight Size Bounds for Packet Headers in Narrow Meshes -- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link -- On the Logical Characterisation of Performability Properties -- On the Representation of Timed Polyhedra -- Invited Talk -- Min-wise Independent Permutations: Theory and Practice -- Testing Acyclicity of Directed Graphs in Sublinear Time -- Computing the Girth of a Planar Graph -- Lower Bounds Are Not Easier over the Reals: Inside PH -- Unlearning Helps -- Fast Approximation Schemes for Euclidean Multi-connectivity Problems -- Approximate TSP in Graphs with Forbidden Minors -- Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling -- The Many Faces of a Translation -- Gales and the Constructive Dimension of Individual Sequences -- The Global Power of Additional Queries to p-Random Oracles -- Homogenization and the Polynomial Calculus. |
| Record Nr. | UNISA-996465376503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl
| Automata, Languages and Programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 Proceedings / / edited by Ugo Montanari, Jose D.P. Rolim, Emo Welzl |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 952 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer networks Computers, Special purpose Computer science—Mathematics Theory of Computation Software Engineering/Programming and Operating Systems Computer Communication Networks Special Purpose and Application-Based Systems Mathematics of Computing |
| ISBN | 3-540-45022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Game Semantics: Achievements and Prospects -- Clique Is Hard to Approximate within n 1-o(1) -- Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time -- Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming -- A Statically Allocated Parallel Functional Language -- An Optimal Minimum Spanning Tree Algorithm -- Improved Shortest Paths on the Word RAM -- Improved Algorithms for Finding Level Ancestors in Dynamic Trees -- Lax Logical Relations -- Reasoning about Idealized ALGOL Using Regular Languages -- The Measurement Process in Domain Theory -- Invited Talk -- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution -- Monotone Proofs of the Pigeon Hole Principle -- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models -- Algebraic Models for Contextual Nets -- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems -- Measures of Nondeterminism in Finite Automata -- LTL Is Expressively Complete for Mazurkiewicz Traces -- An Automata-Theoretic Completeness Proof for Interval Temporal Logic -- Invited Talk -- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? -- Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search -- Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices -- Variable Independence, Quantifier Elimination, and Constraint Representations -- Constraint Satisfaction Problems and Finite Algebras -- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing -- Resource Augmentation for Online Bounded Space Bin Packing -- Optimal Projective Algorithms for the List Update Problem -- Efficient Verification Algorithms for One-Counter Processes -- On the Complexity of Bisimulation Problems for Basic Parallel Processes -- Decidable First-Order Transition Logics for PA-Processes -- Invited Talk -- Non Interference for the Analysis of Cryptographic Protocols -- Average Bit-Complexity of Euclidean Algorithms -- Planar Maps and Airy Phenomena -- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System -- Information Flow vs. Resource Access in the Asynchronous Pi-Calculus (Extended Abstract) -- Award Talk -- The Genomics Revolution and Its Challenges for Algorithmic Research -- Invited Talk -- Alternating the Temporal Picture for Safety -- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations -- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP -- A New Unfolding Approach to LTL Model Checking -- Reasoning about Message Passing in Finite State Environments -- Extended Notions of Security for Multicast Public Key Cryptosystems -- One-Round Secure Computation and Secure Autonomous Mobile Agents -- Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing -- On the Centralizer of a Finite Set -- On the Power of Tree-Walking Automata -- Determinization of Transducers over Infinite Words -- Invited Talk -- Constraint Programming and Graph Algorithms -- Scalable Secure Storage when Half the System Is Faulty -- Generating Partial and Multiple Transversals of a Hypergraph -- Revisiting the Correspondence between Cut Elimination and Normalisation -- Negation Elimination from Simple Equational Formulae -- Hardness of Set Cover with Intersection 1 -- Strong Inapproximability of the Basic k-Spanner Problem -- Infinite Series-Parallel Posets: Logic and Languages -- On Deciding if Deterministic Rabin Language Is in Büchi Class -- On Message Sequence Graphs and Finitely Generated Regular MSC Languages -- Invited Talk -- Pseudorandomness -- A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols -- Deterministic Radio Broadcasting -- An ?-Complete Equational Specification of Interleaving -- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors -- Tight Size Bounds for Packet Headers in Narrow Meshes -- Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link -- On the Logical Characterisation of Performability Properties -- On the Representation of Timed Polyhedra -- Invited Talk -- Min-wise Independent Permutations: Theory and Practice -- Testing Acyclicity of Directed Graphs in Sublinear Time -- Computing the Girth of a Planar Graph -- Lower Bounds Are Not Easier over the Reals: Inside PH -- Unlearning Helps -- Fast Approximation Schemes for Euclidean Multi-connectivity Problems -- Approximate TSP in Graphs with Forbidden Minors -- Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling -- The Many Faces of a Translation -- Gales and the Constructive Dimension of Individual Sequences -- The Global Power of Additional Queries to p-Random Oracles -- Homogenization and the Polynomial Calculus. |
| Record Nr. | UNINA-9910767551103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
CONCUR '96: Concurrency Theory [[electronic resource] ] : 7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings / / edited by Ugo Montanari, Vladimiro Sassone
| CONCUR '96: Concurrency Theory [[electronic resource] ] : 7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings / / edited by Ugo Montanari, Vladimiro Sassone |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (XIII, 759 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Architecture, Computer Software engineering Computer logic Programming languages (Electronic computers) Theory of Computation Computer System Implementation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Computation by Abstract Devices Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-70625-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Retracing some paths in process algebra -- Process calculus based upon evaluation to committed form -- A process algebra with distributed priorities -- Symbolic transition graph with assignment -- Models for concurrent constraint programming -- Comparing transition systems with independence and asynchronous transition systems -- A presheaf semantics of value-passing processes -- Elementary control structures -- On transformations of concurrent object programs -- On bisimulations for the asynchronous ?-calculus -- On the expressiveness of internal mobility in name-passing calculi -- Decoding choice encodings -- Infinite results -- Decidability of bisimulation equivalence for normed pushdown processes -- The modal mu-calculus alternation hierarchy is strict -- Bisimulation collapse and the process taxonomy -- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic -- A Facile tutorial -- Testing probabilistic automata -- Extended Markovian Process Algebra -- Rewriting logic as a semantic framework for concurrency: a progress report -- Truly concurrent constraint programming -- Constraints as processes -- A calculus of mobile agents -- Algebraic interpretation of lambda calculus with resources -- Concurrent graph and term graph rewriting -- Petri boxes and finite precedence -- Constrained properties, semilinear systems, and Petri nets -- Linear constraint systems as high-level nets -- A space-efficient on-the-fly algorithm for real-time model checking -- State equivalences for rectangular hybrid automata -- Verifying abstractions of timed systems -- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation -- Modelling and verification of Distributed Algorithms -- An algorithmic approach for checking closure properties of ?-regular languages -- Towards automata for branching time and partial order -- Asynchronous cellular automata for pomsets without auto-concurrency -- Action refinement and property inheritance in systems of sequential agents -- A calculus for concurrent objects -- Refinement in Interworkings -- Equivalences of Statecharts -- Modular verification for shared-variable concurrent programs -- The impact of hardware models on shared memory consistency conditions -- Synchronous development of asynchronous systems. |
| Record Nr. | UNISA-996465630203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Methods in Software and Systems Modeling [[electronic resource] ] : Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday / / edited by Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, Gabriele Taentzer
| Formal Methods in Software and Systems Modeling [[electronic resource] ] : Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday / / edited by Hans-Jörg Kreowski, Ugo Montanari, Fernando Orejas, Grzegorz Rozenberg, Gabriele Taentzer |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XXVIII, 420 p.) |
| Disciplina | 004/.01/51 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Mathematical logic
Computer logic Software engineering Computer science—Mathematics Programming languages (Electronic computers) Computers Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Discrete Mathematics in Computer Science Programming Languages, Compilers, Interpreters Computation by Abstract Devices |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph Transformation -- On the Concurrent Semantics of Algebraic Graph Grammars -- From Graph Transformation to Software Engineering and Back -- Flexible Interconnection of Graph Transformation Modules -- Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation -- Graph Processes with Fusions: Concurrency by Colimits, Again -- Graph Transformation with Variables -- Graph Transformation in Molecular Biology -- Changing Labels in the Double-Pushout Approach Can Be Treated Categorically -- Algebraic Specification and Logic -- Modules, Brains and Schemas -- From Conditional Specifications to Interaction Charts -- Algebraic Properties of Interfaces -- ? T -Integration of Logics -- Functorial Semantics of Rewrite Theories -- Expander2 -- Relationships Between Equational and Inductive Data Types -- Cofree Coalgebras for Signature Morphisms -- Formal and Visual Modeling -- Nested Constraints and Application Conditions for High-Level Structures -- Synthesis Revisited: Generating Statechart Models from Scenario-Based Requirements -- Main Concepts of Networks of Transformation Units with Interlinking Semantics -- Embeddings and Contexts for Link Graphs -- Towards Architectural Connectors for UML -- Loose Semantics of Petri Nets -- A Formal Framework for the Development of Concurrent Object-Based Systems -- A Formal Description of the Basic Concepts of System Theory for Transportation. |
| Record Nr. | UNISA-996465956603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Transformations [[electronic resource] ] : Third International Conference, ICGT 2006, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings / / edited by Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, Grzegorz Rozenberg
| Graph Transformations [[electronic resource] ] : Third International Conference, ICGT 2006, Rio Grande do Norte, Brazil, September 17-23, 2006, Proceedings / / edited by Andrea Corradini, Hartmut Ehrig, Ugo Montanari, Leila Ribeiro, Grzegorz Rozenberg |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 473 p.) |
| Disciplina | 005.73 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Software engineering Computer science Algorithms Computer science—Mathematics Discrete mathematics Data Science Software Engineering Theory of Computation Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science |
| ISBN | 3-540-38872-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Nested Quantification in Graph Transformation Rules -- Idioms of Logical Modelling -- New Algorithms and Applications of Cyclic Reference Counting -- New Graph Transformation Models -- Sesqui-Pushout Rewriting -- Automata on Directed Graphs: Edge Versus Vertex Marking -- Conflict Detection for Graph Transformation with Negative Application Conditions -- Adaptive Star Grammars -- Structure Manipulation -- Narrowing Data-Structures with Pointers -- Molecular Analysis of Metabolic Pathway with Graph Transformation -- Matrix Approach to Graph Transformation: Matching and Sequences -- String Generating Hypergraph Grammars with Word Order Restrictions -- Borrowed Contexts and Adhesive Categories -- Composition and Decomposition of DPO Transformations with Borrowed Context -- Process Bisimulation Via a Graphical Encoding -- Toposes Are Adhesive -- Extensions for Distributed and Global Computing -- Graph Transactions as Processes -- Categorical Foundations of Distributed Graph Transformation -- Dynamic Graph Transformation Systems -- Autonomous Units and Their Semantics — The Sequential Case -- Software Engineering Methods and Tools -- Termination Analysis of Model Transformations by Petri Nets -- Non-functional Analysis of Distributed Systems in Unreliable Environments Using Stochastic Object Based Graph Grammars -- Temporal Graph Queries to Support Software Evolution -- On the Use of Alloy to Analyze Graph Transformation Systems -- Model-Driven Development -- Non-materialized Model View Specification with Triple Graph Grammars -- Model-Driven Monitoring: An Application of Graph Transformation for Design by Contract -- Model View Management with Triple Graph Transformation Systems -- Efficient Implementation -- Graph Transformation in Constant Time -- GrGen: A Fast SPO-Based Graph Rewriting Tool -- Realizing Graph Transformations by Pre- and Postconditions and Command Sequences -- Heuristic Search for the Analysis of Graph Transition Systems -- Logics -- Satisfiability of High-Level Conditions -- Weakest Preconditions for High-Level Programs -- Tutorial and Workshops -- Introductory Tutorial on Foundations and Applications of Graph Transformation -- Workshop on Graph Computation Models -- Workshop on Graph-Based Tools -- Workshop on Petri Nets and Graph Transformations -- 3rd International Workshop on Software Evolution Through Transformations: Embracing Change. |
| Record Nr. | UNISA-996466148203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Models of Computation / / by Roberto Bruni, Ugo Montanari
| Models of Computation / / by Roberto Bruni, Ugo Montanari |
| Autore | Bruni Roberto |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XXII, 395 p. 34 illus., 1 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Texts in Theoretical Computer Science. An EATCS Series |
| Soggetto topico |
Computers
Software engineering Theory of Computation Software Engineering/Programming and Operating Systems |
| ISBN | 3-319-42900-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preliminaries -- Operational Semantics of IMP -- Induction and Recursion -- Partial Orders and Fixpoints -- Denotational Semantics of IMP -- Operational Semantics of HOFL -- Domain Theory -- HOFL Denotational Semantics -- Equivalence Between HOFL Denotational and Operational Semantics -- Calculus for Communicating Systems (CCS) -- Temporal Logic and mu-Calculus -- Pi-Calculus -- Measure Theory and Markov Chains -- Markov Chains with Actions and Non-determinism -- Performance Evaluation Process Algebra (PEPA). |
| Record Nr. | UNINA-9910254843303321 |
Bruni Roberto
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Principles and practice of constraint programming--CP '95 : first international conference, CP '95, Cassis, France, September 19-22, 1995 : proceedings / / Ugo Montanari, Francesca Rossi (eds.)
| Principles and practice of constraint programming--CP '95 : first international conference, CP '95, Cassis, France, September 19-22, 1995 : proceedings / / Ugo Montanari, Francesca Rossi (eds.) |
| Pubbl/distr/stampa | Springer Berlin Heidelberg |
| Disciplina | 005.1/1 |
| Altri autori (Persone) |
MontanariUgo
RossiFrancesca |
| Soggetto topico | Constraint programming (Computer science) - Congresses |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Principles and Practice of Constraint Programming — CP '95 |
| Record Nr. | UNISA-996466165903316 |
| Springer Berlin Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Trends in Algebraic Development Techniques [[electronic resource] ] : 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers / / edited by Andrea Corradini, Ugo Montanari
| Recent Trends in Algebraic Development Techniques [[electronic resource] ] : 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers / / edited by Andrea Corradini, Ugo Montanari |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (VIII, 343 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Mathematical logic Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Mathematics of Computing Theory of Computation Mathematical Logic and Foundations |
| ISBN | 3-642-03429-2 |
| Classificazione |
DAT 510f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Concurrent Abstract State Machines and ?+? CAL Programs -- Molecules as Automata -- Service-Level Agreements for Service-Oriented Computing -- Contributed Papers -- Tiles for Reo -- C-semiring Frameworks for Minimum Spanning Tree Problems -- What Is a Multi-modeling Language? -- Generalized Theoroidal Institution Comorphisms -- Graph Transformation with Dependencies for the Specification of Interactive Systems -- Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi -- A Rewriting Logic Approach to Type Inference -- A Term-Graph Syntax for Algebras over Multisets -- Transformations of Conditional Rewrite Systems Revisited -- Towards a Module System for K -- Property Preserving Refinement for Csp-Casl -- Reconfiguring Distributed Reo Connectors -- A Rewrite Approach for Pattern Containment -- A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum -- Heterogeneous Logical Environments for Distributed Specifications -- Term-Generic Logic -- Declarative Debugging of Rewriting Logic Specifications -- Translating a Dependently-Typed Logic to First-Order Logic. |
| Record Nr. | UNISA-996465310803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
System Development and Ada [[electronic resource] ] : CRAI Workshop on Software Factories and Ada, Capri, Italy, May 26-30, 1986, Proceedings / / edited by A. Nico Habermann, Ugo Montanari
| System Development and Ada [[electronic resource] ] : CRAI Workshop on Software Factories and Ada, Capri, Italy, May 26-30, 1986, Proceedings / / edited by A. Nico Habermann, Ugo Montanari |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (VIII, 308 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Architecture, Computer Software engineering Computer programming Chemometrics Computational intelligence Theory of Computation Computer System Implementation Software Engineering Programming Techniques Math. Applications in Chemistry Computational Intelligence |
| ISBN | 3-540-47885-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design of the rational environment -- The PCTE initiative: toward a european approach to software engineering -- Engineering VAX Ada for a multi-language programming environment -- The Ada environment — a personal view -- Knowledge-based software development from requirements to code -- The SMoLCS approach to the formal semantics of programming languages -- Project Graphs and meta-programs towards a theory of Software development -- Software development based on formal methods -- Integration of program construction and verification: the PROSPECTRA methodology -- Ada compiler validation: An example of software testing theory and practice -- The Software Engineering Institute at carnegie mellon university -- Task sequencing language for specifying distributed Ada systems. |
| Record Nr. | UNISA-996465787203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987 [[electronic resource] ] : Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87) / / edited by Hartmut Ehrig, Robert Kowalski, Giorgio Levi, Ugo Montanari
| TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987 [[electronic resource] ] : Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87) / / edited by Hartmut Ehrig, Robert Kowalski, Giorgio Levi, Ugo Montanari |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (XVIII, 294 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer logic Mathematical logic Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-47746-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the complexity of branching programs and decision trees for clique functions -- Average complexity of additive properties for multiway tries: A unified approach -- Longest common factor of two words -- An unification semi-algorithm for intersection type schemes -- Optimal run time optimization proved by a new look at abstract interpretations -- Transformation ordering -- On parametric algebraic specifications with clean error handling -- Toward formal development of programs from algebraic specifications: Implementations revisited -- Finite algebraic specifications of semicomputable data types -- On the semantics of concurrency: Partial orders and transition systems -- CCS without ?'s -- A fully observational model for infinite behaviours of communicating systems -- SMoLCS-driven concurrent calculi -- Parameterized horn clause specifications: Proof theory and correctness -- Partial composition and recursion of module specifications -- Efficient representation of taxonomies -- Applications of compactness in the Smyth powerdomain of streams -- Characterizing Kripke structures in temporal logic -- Dialogue with a proof system -- Induction principles formalized in the calculus of constructions -- Algebraic semantics. |
| Record Nr. | UNISA-996465971903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
