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.
Concurrency: Theory, Language, and Architecture [[electronic resource] ] : UK/Japan Workshop, Oxford, UK, September 25–27, 1989, Proceedings / / edited by Akinori Yonezawa, Takayasu Ito
| Concurrency: Theory, Language, and Architecture [[electronic resource] ] : UK/Japan Workshop, Oxford, UK, September 25–27, 1989, Proceedings / / edited by Akinori Yonezawa, Takayasu Ito |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 341 p. 14 illus.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computer programming Computers Computer logic Microprocessors Programming languages (Electronic computers) Computer System Implementation Programming Techniques Computation by Abstract Devices Logics and Meanings of Programs Processor Architectures Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-46452-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An introduction to modal and temporal logics for CCS -- Some results on the ?-calculus -- Analysing TM FS : A study of nondeterminism in real-time concurrency -- Using the temporal logic RDL for design specifications -- Logic of execution: An outline -- Exception handling and real time features in an object-oriented concurrent language -- Reuse of concurrent object descriptions -- The computational field model for open distributed environments (extended abstract) -- Concurrent programming in COB -- A parallel object oriented language Fleng++ and its control system on the parallel machine PIE64 -- An operational semantics of ANDOR-II, a parallel logic programming language with AND- and OR- parallelism -- Premature return — Another interpretation of the future construct — (An extended abstract) -- Semantic specifications for the rewrite rule machine -- Graph rewriting as a computational model -- An ultra-multiprocessing machine architecture for efficient parallel execution of functional languages -- A hierarchical approach to hardware design -- Transformational derivation of systolic arrays -- Locally computable coding for unary operations -- Overview of the workshop -- Abstracts of talks. |
| Record Nr. | UNISA-996465414303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parallel Lisp: Languages and Systems [[electronic resource] ] : US/Japan Workshop on Parallel Lisp, Sendai, Japan, June 5-8, 1989, Proceedings / / edited by Takayasu Ito, Robert H. Jr. Halstead
| Parallel Lisp: Languages and Systems [[electronic resource] ] : US/Japan Workshop on Parallel Lisp, Sendai, Japan, June 5-8, 1989, Proceedings / / edited by Takayasu Ito, Robert H. Jr. Halstead |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XIV, 370 p.) |
| Disciplina | 005.2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Programming languages (Electronic computers) Artificial intelligence Microprocessors Computer system failures Computer programming Computer System Implementation Programming Languages, Compilers, Interpreters Artificial Intelligence Processor Architectures System Performance and Evaluation Programming Techniques |
| ISBN | 3-540-47143-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New ideas in parallel lisp: Language design, implementation, and programming tools -- A parallel lisp language PaiLisp and its kernel specification -- Continuing into the future: On the interaction of futures and first-class continuations -- Speculative computation in multilisp -- Garbage collection in multischeme -- Qlisp: An Interim Report -- Low-cost process creation and dynamic partitioning in Qlisp -- Concurrent scheme -- The design of automatic parallelizers for symbolic and numeric programs -- A reflective object oriented concurrent language ABCL/R -- Optimistic and pessimistic synchronization in distributed computing -- Toward a new computing model for an open distributed environment -- Concurrent programming in TAO — Practice and experience -- A pseudo network approach to inter-processor communication on a shared-memory multi-processor MacELIS -- Mul-T: A high-performance parallel lisp -- Integrating parallel lisp with modern unix-based operating systems -- mUtilisp: a lisp dialect for parallel processing -- PM1 and PMLisp: An experimental machine and its lisp system for research on MIMD massively parallel computation -- Design of the shared memory system for multi-processor lisp machines and its implementation on the evlis machine -- TOP-1 multiprocessor workstation. |
| Record Nr. | UNISA-996465782903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parallel Symbolic Computing: Languages, Systems, and Applications [[electronic resource] ] : US/Japan Workshop, Cambridge, MA, USA, October 14-17, 1992. Proceedings / / edited by Robert H.Jr. Halstead, Takayasu Ito
| Parallel Symbolic Computing: Languages, Systems, and Applications [[electronic resource] ] : US/Japan Workshop, Cambridge, MA, USA, October 14-17, 1992. Proceedings / / edited by Robert H.Jr. Halstead, Takayasu Ito |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (X, 426 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computer programming Software engineering Programming languages (Electronic computers) Computer System Implementation Programming Techniques Software Engineering Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-48133-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Overview of papers from the U.S./Japan workshop on parallel symbolic computing -- Prioritization in parallel symbolic computing -- A priority control system for OR-parallel Prolog and its performance evaluation -- Extending the Multilisp sponsor model to deal with intertask synchronization side effects -- Distillations of dynamic partitioning experience -- A message passing implementation of lazy task creation -- P-continuation based implementation of PaiLisp interpreter -- Running higher-order unification in PaiLisp -- HyperDEBU: A multiwindow debugger for parallel logic programs -- MulTVision: A tool for visualizing parallel program executions -- Managing side effects on shared data -- Design of a concurrent and distributed language -- TS/Scheme: Distributed data structures in Lisp -- A SIMD environment TUPLE for parallel list processing -- Architecture independence and coordination -- Persistent immutable shared abstractions -- Asynchrony and real-time in distributed systems -- Asynchronous communication model based on linear logic -- Parallel inference system research in the Japanese FGCS project -- Massively parallel symbolic computing -- Sparcle: A multithreaded VLSI processor for parallel computing -- A new architecture design paradigm for parallel computing in scheme -- Customizable policy management in the Sting operating system -- An efficient implementation scheme of concurrent object-oriented languages on stock multicomputers (extended abstract) -- Panel discussion I: Massively parallel architectures and symbolic computation -- Panel Discussion II: Applications for parallel symbolic computation. |
| Record Nr. | UNISA-996466071503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parallel Symbolic Languages and Systems [[electronic resource] ] : International Workshop, PSLS '95, Beaune, France, October (2-4), 1995. Proceedings / / edited by Takayasu Ito, Robert H. Jr. Halstead, Christian Queinnec
| Parallel Symbolic Languages and Systems [[electronic resource] ] : International Workshop, PSLS '95, Beaune, France, October (2-4), 1995. Proceedings / / edited by Takayasu Ito, Robert H. Jr. Halstead, Christian Queinnec |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 370 p.) |
| Disciplina | 005.2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Operating systems (Computers) Programming languages (Electronic computers) Computer programming Software engineering Microprocessors Computer System Implementation Operating Systems Programming Languages, Compilers, Interpreters Programming Techniques Software Engineering Processor Architectures |
| ISBN | 3-540-68332-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Lazy remote procedure call and its implementation in a parallel variant of C -- Efficient evaluation strategies for structured concurrency constructs in parallel Scheme systems -- The semantics of pcall and fork in the presence of first-class continuations and side-effects -- Understanding the performance of parallel symbolic programs -- A debugging scheme for fine-grain threads on massively parallel processors with a small amount of log information —Replay and race detection— -- Distributed prograph: Extended abstract -- Experiences with strong moding in concurrent logic/constraint programming -- Portable parallel irregular applications -- Understanding language support for irregular parallelism -- Efficient parallel graph coloring with prioritization -- Group-based fields -- Parallel symbolic computing in Cid -- An overview of MPC++ -Extended abstract- -- Fault tolerance via replication in coarse grain data-flow -- Experience with parallel symbolic applications in Orca -- KLIC: A portable parallel implementation of a concurrent logic programming language -- DMeroon overview of a distributed class-based causally-coherent data model -- A re-implementation of TransPive: Lessons from the experience -- The role of distributed Lisp in open hypermedia information systems -- Foundations for a virtual multicomputer -Progress report- -- Process calculi at work — An account of the LCS project. |
| Record Nr. | UNISA-996465605703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Aspects of Computer Software [[electronic resource] ] : Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings / / edited by Martin Abadi, Takayasu Ito
| Theoretical Aspects of Computer Software [[electronic resource] ] : Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings / / edited by Martin Abadi, Takayasu Ito |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 648 p.) |
| Disciplina | 005.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Software engineering Mathematical logic Theory of Computation Logics and Meanings of Programs Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages |
| ISBN | 3-540-69530-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Strong normalisation in higher-order action calculi -- Extending ML with semi-explicit higher-order polymorphism -- Optimal representations of polymorphic types with subtyping (Extended abstract) -- Cyclic lambda calculi -- Type system for specializing polymorphism -- On strictness and totality -- Sound specialization in the presence of computational effects -- An axiomatic approach to binary logical relations with applications to data refinement -- Infinitary domain logic for finitary transition systems -- Some results in the join-calculus -- Local model checking for value-passing processes (Extended abstract) -- Data refinement of remote procedures -- A type-theoretic approach to deadlock-freedom of asynchronous systems -- Composable semantic models for actor theories -- “Classical” programming-with-proofs in ? Sym PA : An analysis of non-confluence -- Environments, continuation semantics and indexed categories -- Comparing object encodings -- System F with width-subtyping and record updating -- Relational interpretations of recursive types in an operational setting (Summary) -- Extending a logical framework with a modal connective for validity -- Using reflection to build efficient and certified decision procedures -- Sets in types, types in sets -- Combining Petri nets and PA-processes -- Symbolic model-checking method based on approximations and binary decision diagrams for real-time systems -- Types and models for higher-order action calculi -- Finite-state transducers as regular Böhm trees -- Secrecy by typing in security protocols. |
| Record Nr. | UNINA-9910144919103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Aspects of Computer Software [[electronic resource] ] : Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings / / edited by Martin Abadi, Takayasu Ito
| Theoretical Aspects of Computer Software [[electronic resource] ] : Third International Symposium, TACS'97, Sendai, Japan, September 23 - 26, 1997, Proceedings / / edited by Martin Abadi, Takayasu Ito |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 648 p.) |
| Disciplina | 005.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer logic Software engineering Mathematical logic Theory of Computation Logics and Meanings of Programs Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages |
| ISBN | 3-540-69530-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Strong normalisation in higher-order action calculi -- Extending ML with semi-explicit higher-order polymorphism -- Optimal representations of polymorphic types with subtyping (Extended abstract) -- Cyclic lambda calculi -- Type system for specializing polymorphism -- On strictness and totality -- Sound specialization in the presence of computational effects -- An axiomatic approach to binary logical relations with applications to data refinement -- Infinitary domain logic for finitary transition systems -- Some results in the join-calculus -- Local model checking for value-passing processes (Extended abstract) -- Data refinement of remote procedures -- A type-theoretic approach to deadlock-freedom of asynchronous systems -- Composable semantic models for actor theories -- “Classical” programming-with-proofs in ? Sym PA : An analysis of non-confluence -- Environments, continuation semantics and indexed categories -- Comparing object encodings -- System F with width-subtyping and record updating -- Relational interpretations of recursive types in an operational setting (Summary) -- Extending a logical framework with a modal connective for validity -- Using reflection to build efficient and certified decision procedures -- Sets in types, types in sets -- Combining Petri nets and PA-processes -- Symbolic model-checking method based on approximations and binary decision diagrams for real-time systems -- Types and models for higher-order action calculi -- Finite-state transducers as regular Böhm trees -- Secrecy by typing in security protocols. |
| Record Nr. | UNISA-996465518203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Aspects of Computer Software [[electronic resource] ] : International Conference TACS ’91, Sendai, Japan, September 24–27, 1991. Proceedings / / edited by Takayasu Ito, Albert R. Meyer
| Theoretical Aspects of Computer Software [[electronic resource] ] : International Conference TACS ’91, Sendai, Japan, September 24–27, 1991. Proceedings / / edited by Takayasu Ito, Albert R. Meyer |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (X, 776 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer programming Computer logic Computers Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Software Engineering Programming Techniques Logics and Meanings of Programs Computation by Abstract Devices |
| ISBN | 3-540-47617-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A semantics for type checking -- Type inference in polymorphic type discipline -- Monotone recursive definition of predicates and its realizability interpretation -- Adding proof objects and inductive definition mechanisms to frege structures -- From term models to domains -- An abstract interpretation for ML equality kinds -- Full abstraction and the Context Lemma (preliminary report) -- An efficiency preorder for processes -- On nets, algebras and modularity -- Towards a complete hierarchy of compositional dataflow models -- Type theory as a foundation for computer science -- What is in a step: On the semantics of statecharts -- Proving termination of general Prolog programs -- On abstraction and the expressive power of programming languages -- Role of logic programming in the FGCS project -- Authentication and delegation with smart-cards -- Data flow analysis as model checking -- On the adequacy of dependence-based representations for programs with heaps -- From programming-by-example to proving-by-example -- From LP to LP: Programming with constraints -- Polynomial recursion analysis in pascal like programs -- Complexity of proving program correctness -- Some normalization properties of martin-löf's type theory, and applications -- Parametricity of extensionally collapsed term models of polymorphism and their categorical properties -- Programs with continuations and linear logic -- ?-Calculus semantics of object-oriented programming languages -- Wrapper semantics of an object-oriented programming language with state -- Sharing actions and attributes in modal action logic -- First order data types and first order logic -- Efficient program synthesis: Semantics, logic, complexity -- Principal type-schemes of BCI-lambda-terms -- Intersection and union types -- The coherence of languages with intersection types -- Singleton, union and intersection types for program extraction -- Subtyping + extensionality: Confluence of ??top reduction in F? -- An extension of system F with subtyping -- Will logicians be replaced by machines?. |
| Record Nr. | UNISA-996465286503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| 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 | ||
| ||
Theory and Practice of Parallel Programming [[electronic resource] ] : International Workshop TPPP '94, Sendai, Japan, November 7-9, 1994. Proceedings / / edited by Takayasu Ito, Akinori Yonezawa
| Theory and Practice of Parallel Programming [[electronic resource] ] : International Workshop TPPP '94, Sendai, Japan, November 7-9, 1994. Proceedings / / edited by Takayasu Ito, Akinori Yonezawa |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (VIII, 488 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Software engineering Microprocessors Computer system failures Computer programming Computer System Implementation Software Engineering/Programming and Operating Systems Processor Architectures System Performance and Evaluation Programming Techniques Software Engineering |
| ISBN | 3-540-49218-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Time and information in sequential and concurrent computation -- Notes on P-algebra 1: Process structure -- Simulating guarded programs in linear logic -- Sharing mutable objects and controlling groups of tasks in a concurrent and distributed language -- Multi-threaded PaiLisp with granularity adaptive parallel execution -- StackThreads: An abstract machine for scheduling fine-grain threads on stock CPUs -- Higher-order concurrent linear logic programming -- A parallel object-oriented language OCore -- Concurrent objects in a process calculus -- A formalism for remotely interacting processes -- ProCSuS: A meta system for concurrent process calculi based on SOS -- First-class synchronous operations -- Self-describing files + smart modules= parallel program visualization -- A performance debugger for parallel logic programming language fleng -- First class continuation facilities in concurrent programming language Harmony/2 -- Locality abstractions for parallel and distributed computing -- An algorithm for efficient global garbage collection on massively parallel computers (extend abstract) -- I/O mode analysis in concurrent logic programming -- Advanced component interface specification -- Graph notation for concurrent combinators -- A calculus for exploiting data parallelism on recursively defined data -- The data-parallel C language NCX and its implementation strategies -- A dataflow-based massively parallel programming language “V” and its implementation on a stock parallel machine -- Programming with distributed data structure for EM-X multiprocessor. |
| Record Nr. | UNISA-996466115503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||