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] ] : 15th Conference; Bangalore, India, December 1995. Proceedings / / edited by P.S. Thiagarajan
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 15th Conference; Bangalore, India, December 1995. Proceedings / / edited by P.S. Thiagarajan |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XIII, 523 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Combinatorics Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-49263-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Looking for MUM and DAD: Text-text comparisons do help -- Branch and bound on the network model -- A near optimal algorithm for the extended cow-path problem in the presence of relative errors -- Efficient algorithms for vertex arboricity of planar graphs -- A condition for the three colourability of planar locally path graphs -- A framework for the specification of reactive and concurrent systems in Z -- Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems -- Verifying part of the ACCESS.bus protocol using PVS -- Reusing batch parsers as incremental parsers -- The expressive power of indeterminate primitives in asynchronous computation -- The transformation calculus -- Equational axiomatization of bicoercibility for polymorphic types -- From causal consistency to sequential consistency in shared memory systems -- Observation of software for distributed systems with RCL -- Partiality and approximation schemes for local consistency in networks of constraints -- Maximal extensions of simplification orderings -- Average polynomial time is hard for exponential time under sn-reductions -- On self-testing without the generator bottleneck -- Observing behaviour categorically -- An algorithm for reducing binary branchings -- On the complexity of bisimilarity for value-passing processes -- On the expressive power of CCS -- Polarized name passing -- Path balance heuristic for self-adjusting binary search trees -- Pattern matching in compressed texts -- All-pairs min-cut in sparse networks -- Minimizing space usage in evaluation of expression trees -- Smooth surfaces for multi-scale shape representation -- On parallel complexity of planar triangulations -- Computing a largest empty anchored cylinder, and related problems -- Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time -- Determinizing Büchi asynchronous automata -- Achilles and the tortoise climbing up the arithmetical hierarchy -- Generalized temporal verification diagrams -- Model checking of probabilistic and nondeterministic systems. |
| Record Nr. | UNISA-996465582503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 14th Conference, Madras, India, December 15 - 17, 1994. Proceedings / / edited by P.S. Thiagarajan
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 14th Conference, Madras, India, December 15 - 17, 1994. Proceedings / / edited by P.S. Thiagarajan |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XII, 460 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Algorithms Computer logic Combinatorics Computer graphics Theory of Computation Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Computer Graphics |
| ISBN | 3-540-49054-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Efficient resolution of singularities of plane curves -- On the interactive complexity of graph reliability -- Matching upper and lower bounds for simulations of several tapes on one multidimensional tape -- The complexity of computing over quasigroups -- Non-commutative computation, depth reduction, and skew circuits (extended abstract) -- Inductive definitions and type theory an introduction (preliminary version) -- Interpreter verification for a functional language -- An epistemic foundation for logic programming with uncertainty -- On typed calculi with a merge operator -- Incremental algorithms for the single-source shortest path problem -- An O(n) algorithm for realizing degree sequences -- Coloring semi-random graphs in polynomial expected time -- Finite-state strategies in regular infinite games -- Location of the largest empty rectangle among arbitrary obstacles -- Efficient parallel and linear time sequential split decomposition (extended abstract) -- Algorithms for convex visibility problems -- Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems -- Localities and failures (extended summary) -- Priority and abstraction in process algebra -- On the computational power of operators in ICSP with fairness -- Decidability of timed language-inclusion for networks of real-time communicating sequential processes -- My favorite ten complexity theorems of the past decade -- Solving a unification problem under constrained substitutions using tree automata -- Automata-driven efficient subterm unification -- Randomized approximation algorithms in combinatorial optimization -- A limited-backtrack greedy schema for approximation algorithms -- On approximation scheme preserving reductibility and its applications -- Approximation schemes using L-reductions -- An explanation of splaying -- Proving non-reachability by modulo-place-invariants -- Soundness and completeness of UNITY logic -- Efficient algorithms for the transformation between different types of binary decision diagrams -- Extending the limits of sequentially phased reasoning -- Foundations for faster external sorting -- Branching rules for satisfiability -- Using linear arithmetic procedure for generating induction schemes. |
| Record Nr. | UNISA-996466150603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Petri Nets and Other Models of Concurrency - ICATPN 2006 [[electronic resource] ] : 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, Turku, Finland, June 26-30, 2006, Proceedings / / edited by Susanna Donatelli, P.S. Thiagarajan
| Petri Nets and Other Models of Concurrency - ICATPN 2006 [[electronic resource] ] : 27th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, Turku, Finland, June 26-30, 2006, Proceedings / / edited by Susanna Donatelli, P.S. Thiagarajan |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XI, 441 p.) |
| Disciplina | 511.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Computer science—Mathematics Discrete mathematics Computer networks Microprocessors Computer architecture Operating systems (Computers) Theory of Computation Software Engineering Discrete Mathematics in Computer Science Computer Communication Networks Processor Architectures Operating Systems |
| ISBN | 3-540-34700-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Invariant Based Programming -- On the Integration of UML and Petri Nets in Software Development -- Component Tools: Integrating Petri Nets with Other Formal Methods -- Using Colored Petri Nets and Tools to Support Mobile Terminal and Network Software Development -- Full Papers -- Compensation in Workflow Nets -- The Synthesis Problem of Netcharts -- Non-sequential Behaviour of Dynamic Nets -- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets -- On the Computation of Stubborn Sets of Colored Petri Nets -- On the Construction of Pullbacks for Safe Petri Nets -- From Petri Nets to Differential Equations – An Integrative Approach for Biochemical Network Analysis -- How Expressive Are Petri Net Schemata? -- A New Approach to the Evaluation of Non Markovian Stochastic Petri Nets -- Nested Nets for Adaptive Systems -- Analyzing Software Performance and Energy Consumption of Embedded Systems by Probabilistic Modeling: An Approach Based on Coloured Petri Nets -- Infinite Process Semantics of Inhibitor Nets -- Towards Synthesis of Petri Nets from Scenarios -- Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions -- On the Step Explosion Problem -- Prospective Analysis of Cooperative Provision of Industrial Services Using Coloured Petri Nets -- Tool Papers -- Can I Execute My Scenario in Your Net? VipTool Tells You! -- Exhost-PIPE: PIPE Extended for Two Classes of Monitoring Petri Nets -- ArgoSPE: Model-Based Software Performance Engineering -- Petriweb: A Repository for Petri Nets -- Geist3D, a Simulation Tool for Geometry-Driven Petri Nets -- The BRITNeY Suite Animation Tool. |
| Record Nr. | UNISA-996465519103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||