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.
Algebra and Coalgebra in Computer Science [[electronic resource] ] : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings / / edited by Alexander Kurz, Marina Lenisa
| Algebra and Coalgebra in Computer Science [[electronic resource] ] : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009, Proceedings / / edited by Alexander Kurz, Marina Lenisa |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 457 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Models of Computation Theory of Computation |
| ISBN | 3-642-03741-0 |
| Classificazione |
DAT 500f
DAT 702f MAT 110f SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic Effects and Recursive Equations -- Adequacy for Infinitary Algebraic Effects (Abstract) -- Algebras for Parameterised Monads -- Kleene Monads: Handling Iteration in a Framework of Generic Effects -- Complete Iterativity for Algebras with Effects -- Semantics of Higher-Order Recursion Schemes -- Theory of Coalgebra -- Coalgebraic Components in a Many-Sorted Microcosm -- Complementation of Coalgebra Automata -- Characterising Behavioural Equivalence: Three Sides of One Coin -- Coinduction -- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) -- Circular Coinduction: A Proof Theoretical Foundation -- Bisimulation -- Approximating Labelled Markov Processes Again! -- Weak Bisimilarity Coalgebraically -- Coalgebraic Symbolic Semantics -- Relating Coalgebraic Notions of Bisimulation -- Traces, Executions and Schedulers, Coalgebraically -- Non-strongly Stable Orders Also Define Interesting Simulation Relations -- Stone Duality -- Stone Duality and the Recognisable Languages over an Algebra -- Free Heyting Algebras: Revisited -- Distributive Lattice-Structured Ontologies -- A Duality Theorem for Real C * Algebras -- Game Theory -- Conway Games, Coalgebraically -- A Semantical Approach to Equilibria and Rationality -- Graph Transformation -- Van Kampen Colimits as Bicolimits in Span -- Unfolding Grammars in Adhesive Categories -- Software Development Techniques -- Views on Behaviour Protocols and Their Semantic Foundation -- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation -- Constructor-Based Institutions -- CALCO Tools Workshop -- DBtk: A Toolkit for Directed Bigraphs -- Constraint-Muse: A Soft-Constraint Based System for Music Therapy -- CIRC: A Behavioral Verification Tool Based on Circular Coinduction -- The Priced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools. |
| Record Nr. | UNISA-996465311303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebra and coalgebra in computer science : third international conference, CALCO 2009, Udine, Italy, September 7-10, 2009, proceedings / / Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.)
| Algebra and coalgebra in computer science : third international conference, CALCO 2009, Udine, Italy, September 7-10, 2009, proceedings / / Alexander Kurz, Marina Lenisa, Andrzej Tarlecki (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (XI, 457 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
KurzAlexander
LenisaMarina TarleckiAndrzej |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Algebra - Data processing
Computational complexity Computer science Logic design |
| ISBN | 3-642-03741-0 |
| Classificazione |
DAT 500f
DAT 702f MAT 110f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic Effects and Recursive Equations -- Adequacy for Infinitary Algebraic Effects (Abstract) -- Algebras for Parameterised Monads -- Kleene Monads: Handling Iteration in a Framework of Generic Effects -- Complete Iterativity for Algebras with Effects -- Semantics of Higher-Order Recursion Schemes -- Theory of Coalgebra -- Coalgebraic Components in a Many-Sorted Microcosm -- Complementation of Coalgebra Automata -- Characterising Behavioural Equivalence: Three Sides of One Coin -- Coinduction -- Let’s See How Things Unfold: Reconciling the Infinite with the Intensional (Extended Abstract) -- Circular Coinduction: A Proof Theoretical Foundation -- Bisimulation -- Approximating Labelled Markov Processes Again! -- Weak Bisimilarity Coalgebraically -- Coalgebraic Symbolic Semantics -- Relating Coalgebraic Notions of Bisimulation -- Traces, Executions and Schedulers, Coalgebraically -- Non-strongly Stable Orders Also Define Interesting Simulation Relations -- Stone Duality -- Stone Duality and the Recognisable Languages over an Algebra -- Free Heyting Algebras: Revisited -- Distributive Lattice-Structured Ontologies -- A Duality Theorem for Real C * Algebras -- Game Theory -- Conway Games, Coalgebraically -- A Semantical Approach to Equilibria and Rationality -- Graph Transformation -- Van Kampen Colimits as Bicolimits in Span -- Unfolding Grammars in Adhesive Categories -- Software Development Techniques -- Views on Behaviour Protocols and Their Semantic Foundation -- Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation -- Constructor-Based Institutions -- CALCO Tools Workshop -- DBtk: A Toolkit for Directed Bigraphs -- Constraint-Muse: A Soft-Constraint Based System for Music Therapy -- CIRC: A Behavioral Verification Tool Based on Circular Coinduction -- The Priced-Timed Maude Tool -- A Tool Proving Well-Definedness of Streams Using Termination Tools. |
| Record Nr. | UNINA-9910484370903321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic methodology and software technology : 12th International Conference, AMAST 2008 Urbana, il, USA, July 28-31, 2008, proceedings / / Jose Meseguer, Grigore Rosu (Eds.)
| Algebraic methodology and software technology : 12th International Conference, AMAST 2008 Urbana, il, USA, July 28-31, 2008, proceedings / / Jose Meseguer, Grigore Rosu (Eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XIII, 434 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Software engineering |
| ISBN | 3-540-79980-X |
| Classificazione |
004
DAT 335f MAT 110f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Marrying Words and Trees -- Simulation Using Orchestration -- Liberate Computer User from Programming -- An Algebra for Features and Feature Composition -- Petri Nets Are Dioids -- Towards an Efficient Implementation of Tree Automata Completion -- Calculating Invariants as Coreflexive Bisimulations -- Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines -- A Declarative Debugger for Maude -- Long-Run Cost Analysis by Approximation of Linear Operators over Dioids -- Towards Validating a Platoon of Cristal Vehicles Using CSP||B -- Explaining Verification Conditions -- Towards Formal Verification of ToolBus Scripts -- A Formal Analysis of Complex Type Flaw Attacks on Security Protocols -- Abstract Interpretation Plugins for Type Systems -- Separation Logic Contracts for a Java-Like Language with Fork/Join -- An Algebraic Semantics for Contract-Based Software Components -- Implementing a Categorical Information System -- Constant Complements, Reversibility and Universal View Updates -- Coinductive Properties of Causal Maps -- Extending Timed Process Algebra with Discrete Stochastic Time -- Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving -- Evolving Specification Engineering -- Verification of Java Programs with Generics -- Domain Axioms for a Family of Near-Semirings -- Generating Specialized Rules and Programs for Demand-Driven Analysis -- Non Expansive ?-Bisimulations -- A Hybrid Approach for Safe Memory Management in C -- Service Specification and Matchmaking Using Description Logic -- System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries -- The Verification of the On-Chip COMA Cache Coherence Protocol. |
| Record Nr. | UNISA-996465435903316 |
| Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic methodology and software technology : 12th International Conference, AMAST 2008 Urbana, il, USA, July 28-31, 2008, proceedings / / Jose Meseguer, Grigore Rosu (Eds.)
| Algebraic methodology and software technology : 12th International Conference, AMAST 2008 Urbana, il, USA, July 28-31, 2008, proceedings / / Jose Meseguer, Grigore Rosu (Eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XIII, 434 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Software engineering |
| ISBN | 3-540-79980-X |
| Classificazione |
004
DAT 335f MAT 110f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Marrying Words and Trees -- Simulation Using Orchestration -- Liberate Computer User from Programming -- An Algebra for Features and Feature Composition -- Petri Nets Are Dioids -- Towards an Efficient Implementation of Tree Automata Completion -- Calculating Invariants as Coreflexive Bisimulations -- Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines -- A Declarative Debugger for Maude -- Long-Run Cost Analysis by Approximation of Linear Operators over Dioids -- Towards Validating a Platoon of Cristal Vehicles Using CSP||B -- Explaining Verification Conditions -- Towards Formal Verification of ToolBus Scripts -- A Formal Analysis of Complex Type Flaw Attacks on Security Protocols -- Abstract Interpretation Plugins for Type Systems -- Separation Logic Contracts for a Java-Like Language with Fork/Join -- An Algebraic Semantics for Contract-Based Software Components -- Implementing a Categorical Information System -- Constant Complements, Reversibility and Universal View Updates -- Coinductive Properties of Causal Maps -- Extending Timed Process Algebra with Discrete Stochastic Time -- Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving -- Evolving Specification Engineering -- Verification of Java Programs with Generics -- Domain Axioms for a Family of Near-Semirings -- Generating Specialized Rules and Programs for Demand-Driven Analysis -- Non Expansive ?-Bisimulations -- A Hybrid Approach for Safe Memory Management in C -- Service Specification and Matchmaking Using Description Logic -- System Demonstration of Spiral: Generator for High-Performance Linear Transform Libraries -- The Verification of the On-Chip COMA Cache Coherence Protocol. |
| Record Nr. | UNINA-9910767522803321 |
| Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 18th International Symposium, AAECC-18, Tarragona, Sapin, June 8-12, 2009, Proceedings / / edited by Maria Bras-Amorós, Tom Høholdt
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes [[electronic resource] ] : 18th International Symposium, AAECC-18, Tarragona, Sapin, June 8-12, 2009, Proceedings / / edited by Maria Bras-Amorós, Tom Høholdt |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (IX, 243 p.) |
| Disciplina | 005.72 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Cryptography Data encryption (Computer science) Computer science—Mathematics Discrete mathematics Data structures (Computer science) Algorithms Coding and Information Theory Cryptology Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Data Structures and Information Theory |
| ISBN | 3-642-02181-6 |
| Classificazione |
DAT 465f
DAT 584f DAT 702f MAT 110f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Codes -- The Order Bound for Toric Codes -- An Extension of the Order Bound for AG Codes -- Sparse Numerical Semigroups -- From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm -- Rank for Some Families of Quaternary Reed-Muller Codes -- Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes -- Simulation of the Sum-Product Algorithm Using Stratified Sampling -- A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent -- On Elliptic Convolutional Goppa Codes -- The Minimum Hamming Distance of Cyclic Codes of Length 2p s -- There Are Not Non-obvious Cyclic Affine-invariant Codes -- On Self-dual Codes over Z 16 -- Cryptography -- A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications -- Word Oriented Cascade Jump ??LFSR -- On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling -- Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions -- Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE -- Algebra -- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields -- New Commutative Semifields and Their Nuclei -- Spreads in Projective Hjelmslev Geometries -- On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings -- Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t -- Extended Abstracts -- Interesting Examples on Maximal Irreducible Goppa Codes -- Repeated Root Cyclic and Negacyclic Codes over Galois Rings -- Construction of Additive Reed-Muller Codes -- Gröbner Representations of Binary Matroids -- A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product -- Novel Efficient Certificateless Aggregate Signatures -- Bounds on the Number of Users for Random 2-Secure Codes. |
| Record Nr. | UNISA-996465835103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applied algebra, algebraic algorithms and error-correcting codes : 18th international conference, AAECC-18, Tarragona, Spain, June 8-12, 2009. proceedings / / Maria Bras-Amoros, Tom Hoholdt (Eds.)
| Applied algebra, algebraic algorithms and error-correcting codes : 18th international conference, AAECC-18, Tarragona, Spain, June 8-12, 2009. proceedings / / Maria Bras-Amoros, Tom Hoholdt (Eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (IX, 243 p.) |
| Disciplina | 005.72 |
| Altri autori (Persone) |
Bras-AmarosMaria
HoholdtTom |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Error-correcting codes (Information theory)
Algebra - Data processing Algorithms |
| ISBN | 3-642-02181-6 |
| Classificazione |
DAT 465f
DAT 584f DAT 702f MAT 110f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Codes -- The Order Bound for Toric Codes -- An Extension of the Order Bound for AG Codes -- Sparse Numerical Semigroups -- From the Euclidean Algorithm for Solving a Key Equation for Dual Reed–Solomon Codes to the Berlekamp–Massey Algorithm -- Rank for Some Families of Quaternary Reed-Muller Codes -- Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes -- Simulation of the Sum-Product Algorithm Using Stratified Sampling -- A Systems Theory Approach to Periodically Time-Varying Convolutional Codes by Means of Their Invariant Equivalent -- On Elliptic Convolutional Goppa Codes -- The Minimum Hamming Distance of Cyclic Codes of Length 2p s -- There Are Not Non-obvious Cyclic Affine-invariant Codes -- On Self-dual Codes over Z 16 -- Cryptography -- A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications -- Word Oriented Cascade Jump ??LFSR -- On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling -- Very-Efficient Anonymous Password-Authenticated Key Exchange and Its Extensions -- Efficient Constructions of Deterministic Encryption from Hybrid Encryption and Code-Based PKE -- Algebra -- Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields -- New Commutative Semifields and Their Nuclei -- Spreads in Projective Hjelmslev Geometries -- On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings -- Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t -- Extended Abstracts -- Interesting Examples on Maximal Irreducible Goppa Codes -- Repeated Root Cyclic and Negacyclic Codes over Galois Rings -- Construction of Additive Reed-Muller Codes -- Gröbner Representations of Binary Matroids -- A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product -- Novel Efficient Certificateless Aggregate Signatures -- Bounds on the Number of Users for Random 2-Secure Codes. |
| Record Nr. | UNINA-9910484968703321 |
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||