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.
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 11th Conference, New Delhi, India, December 17-19, 1991. Proceedings / / edited by Somenath Biswas, Kesav V. Nori
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 11th Conference, New Delhi, India, December 17-19, 1991. Proceedings / / edited by Somenath Biswas, Kesav V. Nori |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XI, 425 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer logic Programming languages (Electronic computers) Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Computation by Abstract Devices Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-46612-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Program checking -- Randomizing reductions of search problems -- Time analysis, cost equivalence and program refinement -- AC-equation solving -- On the operational interpretation of complex types -- Tense logics for local reasoning in distributed systems -- Failures semantics for a simple process language with refinement -- Correctness of programs over poor signatures -- Complexity issues for vacillatory function identification -- A purely algebraic proof of McNaughton's theorem on infinite words -- The structure and complexity of minimal NFA's over a unary alphabet -- Relativised cellular automata and complexity classes -- Computing the order of a locally testable automaton -- On the structure and complexity of infinite sets with minimal perfect hash functions -- NP-hard sets and creativeness over constant time languages -- Complete problems involving boolean labelled structures and projection translations --Is BP.⊕Pa probabilistic class? -- Fast stable in-place sorting with O(n) data moves -- A theorem on the approximation of set cover and vertex cover -- A fast algorithm for the principal partition of a graph -- Uniform circuits and exclusive read PRAMs -- Contracting planar graphs efficiently in parallel -- Fast deterministic selection on mesh-connected processor arrays -- Improved selection in totally monotone arrays -- Designing secure communication protocols from trust specifications -- Computing the shortest path tree in a weak visibility polygon -- Usefulness of angle-sweep over line-sweep -- Petri nets and transition systems (Abstract for an invited talk). |
| Record Nr. | UNISA-996465324103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings / / edited by Kesav V. Nori, C.E. Veni Madhavan
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings / / edited by Kesav V. Nori, C.E. Veni Madhavan |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XII, 424 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer programming Algorithms Computer logic Theory of Computation Software Engineering/Programming and Operating Systems Software Engineering Programming Techniques Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN | 3-540-46313-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Reasoning about linear constraints using parametric queries -- Discriminant circumscription -- Complexity of algebraic specifications -- A new method for undecidability proofs of first order theories -- Generating plans in linear logic -- Automata-theoretic techniques for image generation and compression -- Recognizable infinite tree sets and their complexity -- The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata -- Towards constructive program derivation in VDM -- A new method for proving termination of AC-rewrite systems -- Efficient parallel algorithms for optical computing with the DFT primitive -- The power of collision: Randomized parallel algorithms for chaining and integer sorting -- Fast parallel algorithms for cographs -- Optimally representing euclidean space discretely for analogically simulating physical phenomena -- Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs -- Randomized parallel selection -- A fast parallel algorithm for finding a maximal bipartite set -- On the parallel evaluation of classes of circuits -- Voronoi diagrams of moving points in the plane -- Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design -- On some largest empty orthoconvex polygons in a point set -- Defining process fairness for non-interleaving concurrency -- Observational logics and concurrency models -- Distributed reset -- Refinement and composition of transition-based rely-guarantee specifications with auxiliary variables -- Efficient algorithms for crash recovery in distributed systems -- A non-standard inductive semantics -- Relating full abstraction results for different programming languages -- Towards a theory of commonsense visual reasoning -- Natural language processing, complexity theory and logic. |
| Record Nr. | UNISA-996465606103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Eighth Conference, Pune, India, December 21-23, 1988. Proceedings / / edited by Kesav V. Nori, Sanjeev Kumar
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Eighth Conference, Pune, India, December 21-23, 1988. Proceedings / / edited by Kesav V. Nori, Sanjeev Kumar |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (XII, 528 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Architecture, Computer Computers Algorithms Computer logic Software Engineering/Programming and Operating Systems Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Software Engineering Logics and Meanings of Programs |
| ISBN | 3-540-46030-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Planar point location revisited (A guided tour of a decade of research) -- Computing a viewpoint of a set of points inside a polygon -- Analysis of preflow push algorithms for maximum network flow -- A new linear algorithm for the two path problem on chordal graphs -- Extending planar graph algorithms to K 3,3-free graphs -- Constant-space string-matching -- Inherent nonslicibility of rectangular duals in VLSI floorplanning -- Path planning with local information -- Linear broadcast routing -- Predicting deadlock in store-and-forward networks -- On parallel sorting and addition with concurrent writes -- An optimal parallel algorithm for sorting presorted files -- Superlinear speedup in parallel state-space search -- Circuit definitions of nondeterministic complexity classes -- Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes -- Padding, commitment and self-reducibility -- The complexity of a counting finite-state automaton -- A hierarchy theorem for pram-based complexity classes -- A natural deduction treatment of operational semantics -- Uniformly applicative structures, a theory of computability and polyadic functions -- A proof technique for register atomicity -- Relation level semantics -- A constructive set theory for program development -- McCarthy's amb cannot implement fair merge -- GHC — A language for a new age of parallel programming -- Accumulators: New logic variable abstractions for functional languages -- A resolution rule for well-formed formulae -- Algebraic and operational semantics of positive/negative conditional algebraic specifications -- Semi-unification -- A method to check knowledge base consistency -- Knowledgebases as structured theories -- On functional independencies -- A generic algorithm for transaction processing during network partitioning. |
| Record Nr. | UNISA-996465297303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Seventh Conference, Pune, India, December 17-19, 1987. Proceedings / / edited by Kesav V. Nori
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : Seventh Conference, Pune, India, December 17-19, 1987. Proceedings / / edited by Kesav V. Nori |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (IX, 541 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Architecture, Computer Computer programming Algorithms Computers Software Engineering/Programming and Operating Systems Computer System Implementation Software Engineering Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-48033-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic operational semantics -- On ambiguity of DTOL systems -- The equivalence problem for n-tape finite automata with simple cycles -- Relating the degree of ambiguity of finite automata to the succinctness of their representation -- Automata, games, and positive monadic theories of trees -- An algorithm for colouring perfect planar graphs -- Efficient algorithms for domination and Hamilton circuit problems on permutation graphs -- Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs -- Improved bounds for covering general polygons with rectangles -- Submodule construction as equation solving in CCS -- Computations in undistinguished networks -- A distributed algorithm to implement n-party rendezvous -- Merge and termination in process algebra -- Parallelism and programming: A perspective -- On optimal parallelization of sorting networks -- Parallel algorithms for approximate edge colouring of simple graphs -- An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks -- An O(n2) algorithm for fan-out free query optimization -- Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols -- Optimizing join queries in distributed databases -- Reasoning in systems of equations and inequations -- Specification=program+types -- Paraconsistent logic programming -- Semantics of distributed Horn clause programs -- The calculus of constructions : State of the art -- Modules for re-use -- Hierarchical refinement of A Z specification -- Lazy pattern matching in the ML language -- Program development using lambda abstraction -- Relativized Arthur-Merlin versus Merlin-Arthur games -- Probabilistic quantifiers vs. distrustful adversaries -- On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas -- A look-ahead interpreter for sequential Prolog and its implementation -- Extension of weakest precondition formalism to a low level language -- Retrospection on the PQCC compiler structure -- Some recent applications of knowledge. |
| Record Nr. | UNISA-996465810403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||