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.
Algebraic System Specification and Development [[electronic resource] ] : A Survey and Annotated Bibliography / / edited by Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella
| Algebraic System Specification and Development [[electronic resource] ] : A Survey and Annotated Bibliography / / edited by Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XII, 184 p.) |
| Disciplina | 004.2/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer organization
Computer Systems Organization and Communication Networks |
| ISBN | 3-540-47382-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic foundations -- Models and logics -- Development concepts -- Support tools -- Applications. |
| Record Nr. | UNISA-996465945103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen
| Automata, Languages and Programming [[electronic resource] ] : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 1086 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer communication systems Computer science—Mathematics Computer graphics Combinatorics Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks Mathematics of Computing Computer Graphics |
| ISBN | 3-540-48224-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State Systems -- Integrating Semantics for Object—Oriented System Models -- Modelling with Partial Orders — Why and Why Not? -- Theoretical Aspects of Evolutionary Algorithms -- Algebraic and Circuit Complexity -- Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical -- On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities -- Division Is In Uniform TC0 -- Algorithm Analysis -- A Framework for Index Bulk Loading and Dynamization -- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies -- The Complexity of Constructing Evolutionary Trees Using Experiments -- Hidden Pattern Statistics -- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence -- All-Pairs Shortest Paths Computation in the BSP Model -- Approximation and Optimization -- Approximating the Minimum Spanning Tree Weight in Sublinear Time -- Approximation Hardness of TSP with Bounded Metrics -- The RPR 2 Rounding Technique for Semidefinite Programs -- Approximation Algorithms for Partial Covering Problems -- On the Online Bin Packing Problem -- Quick k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations -- On Interactive Proofs with a Laconic Prover -- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness -- Lower Bounds in the Quantum Cell Probe Model -- Concurrency -- Axiomatizations for Probabilistic Bisimulation -- Noninterference for Concurrent Programs -- Distributed Controller Synthesis for Local Specifications -- A Distributed Abstract Machine for Safe Ambients -- Towards Quantitative Verification of Probabilistic Transition Systems -- Efficient Datastructures -- Efficient Generation of Plane Triangulations without Repetitions -- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations -- Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher -- A New Method for Balancing Binary Search Trees -- Graph Algorithms -- Permutation Editing and Matching via Embeddings -- Testing Hypergraph Coloring -- Total Colorings of Degenerated Graphs -- Decidable Properties of Graphs of All-Optical Networks -- Majority Consensus and the Local Majority Rule -- Language Theory, Codes, and Automata -- Solvability of Equations in Free Partially Commutative Groups Is decidable -- Rational Transformations of Formal Power Series -- Combinatorics of Three-Interval Exchanges -- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages -- The Star Problem in Trace Monoids: Reductions Beyond C4 -- The Trace Coding Problem Is Undecidable -- Combinatorics of Periods in Strings -- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct -- Model Checking and Protocol Analysis -- Effective Lossy Queue Languages -- Model Checking of Unrestricted Hierarchical State Machines -- Symbolic Trace Analysis of Cryptographic Protocols -- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based Consistency -- Routing in Trees -- Online Packet Routing on Linear Arrays and Rings -- Faster Gossiping on Butterflies -- Reasoning and Verification -- Realizability and Verification of MSC Graphs -- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs -- A Set-Theoretic Framework for Assume-Guarantee Reasoning -- Foundations for Circular Compositional Reasoning -- Scheduling -- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines -- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts -- On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates -- On the Approximability of Average Completion Time Scheduling under Precedence Constraints -- Secure Computation -- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic Private Information Retrieval: A Unified Construction -- Secure Multiparty Computation of Approximations -- Secure Games with Polynomial Expressions -- Specification and Deduction -- On the Completeness of Arbitrary Selection Strategies for Paramodulation -- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds for Reversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning. |
| Record Nr. | UNISA-996465891203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen
| Automata, Languages and Programming : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 1086 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer communication systems Computer science—Mathematics Computer graphics Combinatorics Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks Mathematics of Computing Computer Graphics |
| ISBN | 3-540-48224-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State Systems -- Integrating Semantics for Object—Oriented System Models -- Modelling with Partial Orders — Why and Why Not? -- Theoretical Aspects of Evolutionary Algorithms -- Algebraic and Circuit Complexity -- Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical -- On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities -- Division Is In Uniform TC0 -- Algorithm Analysis -- A Framework for Index Bulk Loading and Dynamization -- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies -- The Complexity of Constructing Evolutionary Trees Using Experiments -- Hidden Pattern Statistics -- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence -- All-Pairs Shortest Paths Computation in the BSP Model -- Approximation and Optimization -- Approximating the Minimum Spanning Tree Weight in Sublinear Time -- Approximation Hardness of TSP with Bounded Metrics -- The RPR 2 Rounding Technique for Semidefinite Programs -- Approximation Algorithms for Partial Covering Problems -- On the Online Bin Packing Problem -- Quick k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations -- On Interactive Proofs with a Laconic Prover -- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness -- Lower Bounds in the Quantum Cell Probe Model -- Concurrency -- Axiomatizations for Probabilistic Bisimulation -- Noninterference for Concurrent Programs -- Distributed Controller Synthesis for Local Specifications -- A Distributed Abstract Machine for Safe Ambients -- Towards Quantitative Verification of Probabilistic Transition Systems -- Efficient Datastructures -- Efficient Generation of Plane Triangulations without Repetitions -- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations -- Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher -- A New Method for Balancing Binary Search Trees -- Graph Algorithms -- Permutation Editing and Matching via Embeddings -- Testing Hypergraph Coloring -- Total Colorings of Degenerated Graphs -- Decidable Properties of Graphs of All-Optical Networks -- Majority Consensus and the Local Majority Rule -- Language Theory, Codes, and Automata -- Solvability of Equations in Free Partially Commutative Groups Is decidable -- Rational Transformations of Formal Power Series -- Combinatorics of Three-Interval Exchanges -- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages -- The Star Problem in Trace Monoids: Reductions Beyond C4 -- The Trace Coding Problem Is Undecidable -- Combinatorics of Periods in Strings -- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct -- Model Checking and Protocol Analysis -- Effective Lossy Queue Languages -- Model Checking of Unrestricted Hierarchical State Machines -- Symbolic Trace Analysis of Cryptographic Protocols -- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based Consistency -- Routing in Trees -- Online Packet Routing on Linear Arrays and Rings -- Faster Gossiping on Butterflies -- Reasoning and Verification -- Realizability and Verification of MSC Graphs -- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs -- A Set-Theoretic Framework for Assume-Guarantee Reasoning -- Foundations for Circular Compositional Reasoning -- Scheduling -- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines -- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts -- On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates -- On the Approximability of Average Completion Time Scheduling under Precedence Constraints -- Secure Computation -- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic Private Information Retrieval: A Unified Construction -- Secure Multiparty Computation of Approximations -- Secure Games with Polynomial Expressions -- Specification and Deduction -- On the Completeness of Arbitrary Selection Strategies for Paramodulation -- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds for Reversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning. |
| Record Nr. | UNINA-9910143600103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
Fundamental Approaches to Software Engineering [[electronic resource] ] : 14th International Conference, FASE 2011, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26--April 3, 2011, Proceedings / / edited by Dimitra Giannakopoulou, Fernando Orejas
| Fundamental Approaches to Software Engineering [[electronic resource] ] : 14th International Conference, FASE 2011, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26--April 3, 2011, Proceedings / / edited by Dimitra Giannakopoulou, Fernando Orejas |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIII, 464 p. 172 illus., 41 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer networks Computer science Compilers (Computer programs) Computer programming Electronic data processing—Management Software Engineering Computer Communication Networks Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques IT Operations |
| ISBN | 3-642-19811-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465891603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Transformation [[electronic resource] ] : 12th International Conference, ICGT 2019, Held as Part of STAF 2019, Eindhoven, The Netherlands, July 15–16, 2019, Proceedings / / edited by Esther Guerra, Fernando Orejas
| Graph Transformation [[electronic resource] ] : 12th International Conference, ICGT 2019, Held as Part of STAF 2019, Eindhoven, The Netherlands, July 15–16, 2019, Proceedings / / edited by Esther Guerra, Fernando Orejas |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 231 p. 303 illus., 32 illus. in color.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Compilers (Computer programs) Software engineering Computer programming Artificial intelligence—Data processing Discrete Mathematics in Computer Science Compilers and Interpreters Software Engineering Programming Techniques Data Science |
| ISBN | 3-030-23611-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theory -- Analysis and Verification -- Tools and Applications -- Transformation Rules Construction and Matching. |
| Record Nr. | UNISA-996465589703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Transformation : 12th International Conference, ICGT 2019, Held as Part of STAF 2019, Eindhoven, The Netherlands, July 15–16, 2019, Proceedings / / edited by Esther Guerra, Fernando Orejas
| Graph Transformation : 12th International Conference, ICGT 2019, Held as Part of STAF 2019, Eindhoven, The Netherlands, July 15–16, 2019, Proceedings / / edited by Esther Guerra, Fernando Orejas |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (X, 231 p. 303 illus., 32 illus. in color.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Compilers (Computer programs) Software engineering Computer programming Artificial intelligence—Data processing Discrete Mathematics in Computer Science Compilers and Interpreters Software Engineering Programming Techniques Data Science |
| ISBN | 3-030-23611-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theory -- Analysis and Verification -- Tools and Applications -- Transformation Rules Construction and Matching. |
| Record Nr. | UNINA-9910337860103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Recent Trends in Algebraic Development Techniques [[electronic resource] ] : 17th International Workshop, WADT 2004, Barcelona, Spain, March 27-29, 2004, Revised Selected Papers / / edited by José Luiz Fiadeiro, Peter Mosses, Fernando Orejas
| Recent Trends in Algebraic Development Techniques [[electronic resource] ] : 17th International Workshop, WADT 2004, Barcelona, Spain, March 27-29, 2004, Revised Selected Papers / / edited by José Luiz Fiadeiro, Peter Mosses, Fernando Orejas |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer science Machine theory Computer science—Mathematics Software Engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Symbolic and Algebraic Manipulation |
| ISBN | 9783540319597 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Technical Paper -- Behavior-Preserving Refinement Relations Between Dynamic Software Architectures -- Contributed Papers -- Modelling Mobility with Petri Hypernets -- Cryptomorphisms at Work -- Towards a Formal Specification of an Electronic Payment System in CSP-CASL -- Algebraic Semantics of Design Abstractions for Context-Awareness -- CCC – The Casl Consistency Checker -- Ontologies for the Semantic Web in Casl -- Theoroidal Maps as Algebraic Simulations -- Behavioural Semantics of Algebraic Specifications in Arbitrary Logical Systems -- A Simple Refinement Language for Casl -- A Distributed and Mobile Component System Based on the Ambient Calculus -- Application and Formal Specification of Sorted Term-Position Algebras -- From Conditional to Unconditional Rewriting -- Type Class Polymorphism in an Institutional Framework -- Architectural Specifications for Reactive Systems. |
| Record Nr. | UNISA-996465697003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Trends in Data Type Specification [[electronic resource] ] : 9th Workshop on Specification of Abstract Data Types Joint with the 4th COMPASS Workshop, Caldes de Malavella, Spain, October 26 - 30, 1992. Selected Papers / / edited by Hartmut Ehrig, Fernando Orejas
| Recent Trends in Data Type Specification [[electronic resource] ] : 9th Workshop on Specification of Abstract Data Types Joint with the 4th COMPASS Workshop, Caldes de Malavella, Spain, October 26 - 30, 1992. Selected Papers / / edited by Hartmut Ehrig, Fernando Orejas |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (VIII, 356 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer logic Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
| ISBN | 3-540-48361-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards an algebraic semantics for the object paradigm -- Rewriting techniques for software engineering -- Identity and existence, and types in algebra -- Overloading and inheritance -- A SMoLCS based kit for defining high-level algebraic Petri nets -- Institutions for very abstract specifications -- About the “correctness” and “adequacy” of PLUSS specifications -- Semantic constructions in the specification language Glider -- On certification of specifications for TROLL light objects -- Translating TROLL light concepts to Maude -- Algebraic high level nets -- 2-Categorical specification of partial algebras -- A behavioural algebraic framework for modular system design with reuse -- On fibred adjunctions and completeness for fibred categories -- Implementing inequality and nondeterministic specifications with bi-rewriting systems -- A semantic basis for logic-independent transformation -- Unified algebras and abstract syntax -- Structured inheritance for algebraic class specifications -- Towards a theory for the animation of algebraic specifications -- Second-order proof systems for algebraic specification languages -- An institution of object behaviour. |
| Record Nr. | UNISA-996466255203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Trends in Data Type Specification [[electronic resource] ] : 7th Workshop on Specification of Abstract Data Types, Wusterhausen/Dosse, Germany, April 17-20, 1990. Proceedings / / edited by Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel
| Recent Trends in Data Type Specification [[electronic resource] ] : 7th Workshop on Specification of Abstract Data Types, Wusterhausen/Dosse, Germany, April 17-20, 1990. Proceedings / / edited by Hartmut Ehrig, Klaus P. Jantke, Fernando Orejas, Horst Reichel |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 384 p.) |
| Disciplina | 005.7/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Programming languages (Electronic computers) Computer logic Software engineering Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Software Engineering |
| ISBN | 3-540-38416-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | ADT implementation and completion by induction from examples -- An association of Algebraic term nets and abstract data types for specifying real communication protocols -- The specification language GSBL -- Composition of algebraic high-level nets -- A match operation for rule-based modular system design -- Towards object-oriented algebraic specifications -- Inductive completion for transformation of equational specifications -- A notion of implementation for the specification language OBSCURE -- Model-theoretic specifications and back-and-forth equivalences -- Universal algebra in higher types -- Clausal rewriting: Applications and implementation -- Constraints for behavioural specifications -- Entities: An institution for dynamic systems -- A 2-category approach to critical pair completion -- A kernel specification formalism with higher-order parameterisation -- Extended ML: Past, present and future -- Dependent types considered necessary for specification languages -- Generic types in a language for data directed design -- Design of a compiler for lazy pattern driven narrowing. |
| Record Nr. | UNISA-996465662403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
