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.
CASL Reference Manual [[electronic resource] ] : The Complete Documentation of the Common Algebraic Specification Language / / edited by Peter D. Mosses
| CASL Reference Manual [[electronic resource] ] : The Complete Documentation of the Common Algebraic Specification Language / / edited by Peter D. Mosses |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XVIII, 534 p.) |
| Disciplina | 005.13/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer science Programming languages (Electronic computers) Computer logic Software Engineering Computer Science, general Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
| ISBN | 3-540-24648-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | CASL Summary -- I. Casl Summary -- CASL Syntax -- II. Casl Syntax -- CASL Semantics -- III. Casl Semantics -- CASL Logic -- IV. Casl Logic -- CASL Libraries -- V. Casl Libraries. |
| Record Nr. | UNISA-996465533103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CASL Reference Manual : The Complete Documentation of the Common Algebraic Specification Language / / edited by Peter D. Mosses
| CASL Reference Manual : The Complete Documentation of the Common Algebraic Specification Language / / edited by Peter D. Mosses |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XVIII, 534 p.) |
| Disciplina | 005.13/3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer science Programming languages (Electronic computers) Computer logic Software Engineering Computer Science, general Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
| ISBN | 3-540-24648-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | CASL Summary -- I. Casl Summary -- CASL Syntax -- II. Casl Syntax -- CASL Semantics -- III. Casl Semantics -- CASL Logic -- IV. Casl Logic -- CASL Libraries -- V. Casl Libraries. |
| Record Nr. | UNINA-9910144204503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
CASL User Manual [[electronic resource] ] : Introduction to Using the Common Algebraic Specification Language / / by Michel Bidoit, Peter D. Mosses
| CASL User Manual [[electronic resource] ] : Introduction to Using the Common Algebraic Specification Language / / by Michel Bidoit, Peter D. Mosses |
| Autore | Bidoit Michel |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 246 p.) |
| Disciplina | 005.13/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-44397-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Background -- 1 Introduction -- 2 Underlying Concepts -- Casl Specifications -- 3 Getting Started -- 4 Partial Functions -- 5 Subsorting -- 6 Structuring Specifications -- 7 Generic Specifications -- 8 Specifying the Architecture of Implementations -- 9 Libraries -- Carrying On -- 10 Foundations -- 11 Tools -- 12 Basic Libraries -- 13 Case Study: The Steam-Boiler Control System -- Appendices -- A Casl Quick Reference -- B Points to Bear in Mind -- C The Steam-Boiler Control Specification Problem. |
| Record Nr. | UNISA-996466049403316 |
Bidoit Michel
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CASL User Manual : Introduction to Using the Common Algebraic Specification Language / / by Michel Bidoit, Peter D. Mosses
| CASL User Manual : Introduction to Using the Common Algebraic Specification Language / / by Michel Bidoit, Peter D. Mosses |
| Autore | Bidoit Michel |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 246 p.) |
| Disciplina | 005.13/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-44397-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Background -- 1 Introduction -- 2 Underlying Concepts -- Casl Specifications -- 3 Getting Started -- 4 Partial Functions -- 5 Subsorting -- 6 Structuring Specifications -- 7 Generic Specifications -- 8 Specifying the Architecture of Implementations -- 9 Libraries -- Carrying On -- 10 Foundations -- 11 Tools -- 12 Basic Libraries -- 13 Case Study: The Steam-Boiler Control System -- Appendices -- A Casl Quick Reference -- B Points to Bear in Mind -- C The Steam-Boiler Control Specification Problem. |
| Record Nr. | UNINA-9910145798203321 |
|
Bidoit Michel
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
TAPSOFT '95: Theory and Practice of Software Development [[electronic resource] ] : 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22 - 26, 1995. Proceedings / / edited by Peter D. Mosses, Mogens Nielsen, Michael I. Schwartzbach
| TAPSOFT '95: Theory and Practice of Software Development [[electronic resource] ] : 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22 - 26, 1995. Proceedings / / edited by Peter D. Mosses, Mogens Nielsen, Michael I. Schwartzbach |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XVI, 820 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computers Computer logic Mathematical logic Software Engineering/Programming and Operating Systems Software Engineering Programming Languages, Compilers, Interpreters Computation by Abstract Devices Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-49233-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A decade of TAPSOFT -- Theory and practice of software development -- Rational spaces and set constraints -- Formal methods and social context in software development -- Testing can be formal, too -- Anatomy of the Pentium bug -- Rational mechanics and natural mathematics -- First-order logic on finite trees -- Decidability of equivalence for deterministic synchronized tree automata -- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable -- ?I: A symmetric calculus based on internal mobility -- Complete inference systems for weak bisimulation equivalences in the ?-calculus -- Reasoning about higher-order processes -- Confluence of processes and systems of objects -- An algebraic approach to temporal logic -- On behavioural abstraction and behavioural satisfaction in higher-order logic -- Assumption/guarantee specifications in linear-time temporal logic (extended abstract) -- Fine hierarchy of regular ?-languages -- Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time -- Semi-trace morphisms and rational transductions -- Nonfinite axiomatizability of shuffle inequalities -- On the category of Petri net computations -- High undecidability of weak bisimilarity for Petri nets -- Polynomial algorithms for the synthesis of bounded nets -- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems -- Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) -- On the expressive power of algebraic graph grammars with application conditions -- Generated models and the ?-rule: The nondeterministic case -- CPO models for a class of GSOS languages -- Statecharts, transition structures and transformations -- An imperative object calculus -- A refinement of import/export declarations in modular logic programming and its semantics -- Strictness and totality analysis with conjunction -- Generic techniques for source-level debugging and dynamic program slicing -- Reasoning with executable specifications -- Calculating software generators from solution specifications -- Comparing flow-based binding-time analyses -- Can you trust your data -- Static and dynamic processor allocation for higher-order concurrent languages -- Mechanized inductive proof of properties of a simple code optimizer -- Describing a Signal Analyzer in the process algebra PMC — A case study -- A gentle introduction to specification engineering using a case study in telecommunications -- Precise interprocedural dataflow analysis with applications to constant propagation -- Formal specification and prototyping of a program specializer -- Proving the correctness of recursion-based automatic program transformations -- Reactive system specification and refinement -- Measuring concurrency of regular distributed computations -- Non-speculative and upward invocation of continuations in a parallel language -- A model inference system for generic specification with application to code sharing -- Relations as abstract datatypes: An institution to specify relations between algebras -- Performance-oriented formal specifications — the LotoTis approach -- Signal: A formal design environment for real-time systems -- The META-Frame: An environment for flexible tool management -- STeP: The Stanford Temporal Prover -- The HOL-UNITY verification system -- PLATO: A tool to assist programming as term rewriting and theorem proving -- LOFT: A tool for assisting selection of test data sets from algebraic specifications -- The SMoLCS ToolSet -- The Asf+Sdf Meta-environment documentation tools for free -- The B-Toolkit demonstration -- Object Oriented Semantics Directed Compiler Generation: A prototype. |
| Record Nr. | UNISA-996466127803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics [[electronic resource] ] : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
| Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics [[electronic resource] ] : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 636 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Computers Computer graphics Computer communication systems Data Structures and Information Theory Programming Languages, Compilers, Interpreters Theory of Computation Data Structures Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44929-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain ? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and ?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local ?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the ?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics. |
| Record Nr. | UNISA-996465430603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
| Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 636 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Computers Computer graphics Computer communication systems Data Structures and Information Theory Programming Languages, Compilers, Interpreters Theory of Computation Data Structures Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44929-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain ? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and ?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local ?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the ?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics. |
| Record Nr. | UNINA-9910767552203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||