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.
Advances in computing science - ASIAN '99 : 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 : proceedings / / P. S. Thiagarajan, Roland Yap, editors
| Advances in computing science - ASIAN '99 : 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 : proceedings / / P. S. Thiagarajan, Roland Yap, editors |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer Verlag, , [1999] |
| Descrizione fisica | 1 online resource (XII, 408 p.) |
| Disciplina | 004.071 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Electronic data processing - Ability testing
Computer science - Research |
| ISBN | 3-540-46674-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing -- Emerging Application Domains and the Computing Fabric -- Regular Papers -- The Game of the Name in Cryptographic Tables -- A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs -- Rapid Prototyping Techniques for Fuzzy Controllers -- Transactional Cache Management with A periodic Invalidation Scheme in Mobile Environments -- Observable Sharing for Functional Circuit Description -- Relating May and Must Testing Semantics for Discrete Timed Process Algebras -- A Framework for Formal Reasoning about Open Distributed Systems -- Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic -- Verifying Probabilistic Programs Using a Hoare like Logic -- An Expressive Extension of TLC -- Completeness and Decidability of a Fragment of Duration Calculus with Iteration -- Logical Relations in Circuit Verification -- Lemma Generalization and Non-unit Lemma Matching for Model Elimination -- On Automating Inductive and Non-inductive Termination Methods -- Asynchronous Links in the PBC and M-Nets -- Demand-Driven Model Checking for Context-Free Processes -- Programming the Mobility Behaviour of Agents by Composing Itineraries -- Faster Model Checking for Open Systems -- An Argumentation Approach to Semantics of Declarative Programs with Defeasible Inheritance -- Entailment of Non-structural Subtype Constraints -- A CPS-Transform of Constructive Classical Logic -- Formal Verification of the MCS List-Based Queuing Lock -- BDD-Nodes Can Be More Expressive -- Formal Verification of Descriptions with Distinct Order of Memory Operations -- Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs -- On L k (Q) Types and Boundedness of IFP(Q) on Finite Structures -- Separators Are as Simple as Cutsets -- Ant Colony Optimization for the Ship Berthing Problem -- Poster Session Abstracts -- Security Modeling and Evaluation for the Mobile Code Paradigm -- CASA - Structured Design of a Specification Language for Intelligent Agents -- An Efficient Location Management by Optimal Location Area Partitioning in PCS Networks -- Programming with Explicit Regions -- A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic -- Formal Verification of Secret Sharing Protocol Using Coq -- On Feasibility, Boundedness and Redundancy of Systems of Linear Constraints over R 2-Plane -- Deduction in Logic of Association Rules -- Asynchronous Migration in Parallel Genetic Programming -- Verification Results for a Multimedia Protocol -- Multipoint-to-Point ABR Service with Fair Intelligent Congestion Control in ATM Networks. |
| Record Nr. | UNINA-9910143615103321 |
| Berlin ; ; Heidelberg : , : Springer Verlag, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Advances in computing science - ASIAN '99 : 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 : proceedings / / P. S. Thiagarajan, Roland Yap, editors
| Advances in computing science - ASIAN '99 : 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 : proceedings / / P. S. Thiagarajan, Roland Yap, editors |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer Verlag, , [1999] |
| Descrizione fisica | 1 online resource (XII, 408 p.) |
| Disciplina | 004.071 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Electronic data processing - Ability testing
Computer science - Research |
| ISBN | 3-540-46674-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing -- Emerging Application Domains and the Computing Fabric -- Regular Papers -- The Game of the Name in Cryptographic Tables -- A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs -- Rapid Prototyping Techniques for Fuzzy Controllers -- Transactional Cache Management with A periodic Invalidation Scheme in Mobile Environments -- Observable Sharing for Functional Circuit Description -- Relating May and Must Testing Semantics for Discrete Timed Process Algebras -- A Framework for Formal Reasoning about Open Distributed Systems -- Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic -- Verifying Probabilistic Programs Using a Hoare like Logic -- An Expressive Extension of TLC -- Completeness and Decidability of a Fragment of Duration Calculus with Iteration -- Logical Relations in Circuit Verification -- Lemma Generalization and Non-unit Lemma Matching for Model Elimination -- On Automating Inductive and Non-inductive Termination Methods -- Asynchronous Links in the PBC and M-Nets -- Demand-Driven Model Checking for Context-Free Processes -- Programming the Mobility Behaviour of Agents by Composing Itineraries -- Faster Model Checking for Open Systems -- An Argumentation Approach to Semantics of Declarative Programs with Defeasible Inheritance -- Entailment of Non-structural Subtype Constraints -- A CPS-Transform of Constructive Classical Logic -- Formal Verification of the MCS List-Based Queuing Lock -- BDD-Nodes Can Be More Expressive -- Formal Verification of Descriptions with Distinct Order of Memory Operations -- Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs -- On L k (Q) Types and Boundedness of IFP(Q) on Finite Structures -- Separators Are as Simple as Cutsets -- Ant Colony Optimization for the Ship Berthing Problem -- Poster Session Abstracts -- Security Modeling and Evaluation for the Mobile Code Paradigm -- CASA - Structured Design of a Specification Language for Intelligent Agents -- An Efficient Location Management by Optimal Location Area Partitioning in PCS Networks -- Programming with Explicit Regions -- A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic -- Formal Verification of Secret Sharing Protocol Using Coq -- On Feasibility, Boundedness and Redundancy of Systems of Linear Constraints over R 2-Plane -- Deduction in Logic of Association Rules -- Asynchronous Migration in Parallel Genetic Programming -- Verification Results for a Multimedia Protocol -- Multipoint-to-Point ABR Service with Fair Intelligent Congestion Control in ATM Networks. |
| Record Nr. | UNISA-996466368803316 |
| Berlin ; ; Heidelberg : , : Springer Verlag, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings / / edited by Jean-Francois Raskin, P.S. Thiagarajan
| Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings / / edited by Jean-Francois Raskin, P.S. Thiagarajan |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (X, 372 p.) |
| Disciplina | 003.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Computers, Special purpose Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Special Purpose and Application-Based Systems |
| ISBN | 3-540-75454-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Abstraction of Probabilistic Systems -- From Analysis to Design -- Efficient On-the-Fly Algorithms for Partially Observable Timed Games -- Undecidability of Universality for Timed Automata with Minimal Resources -- On Timed Models of Gene Networks -- Costs Are Expensive! -- Hypervolume Approximation in Timed Automata Model Checking -- Counter-Free Input-Determined Timed Automata -- Towards Budgeting in Real-Time Calculus: Deferrable Servers -- Automatic Abstraction Refinement for Timed Automata -- Dynamical Properties of Timed Automata Revisited -- Robust Sampling for MITL Specifications -- On the Expressiveness of MTL Variants over Dense Time -- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable -- Efficient Detection of Zeno Runs in Timed Automata -- Partial Order Reduction for Verification of Real-Time Components -- Guided Controller Synthesis for Climate Controller Using Uppaal Tiga -- Symbolic Reachability Analysis of Lazy Linear Hybrid Automata -- Combining Formal Verification with Observed System Execution Behavior to Tune System Parameters -- Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times -- Designing Consistent Multimedia Documents: The RT-LOTOS Methodology -- AMT: A Property-Based Monitoring Tool for Analog Systems -- Region Stability Proofs for Hybrid Systems -- CSL Model Checking Algorithms for Infinite-State Structured Markov Chains -- Symbolic Simulation-Checking of Dense-Time Automata. |
| Record Nr. | UNISA-996465917403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Modeling and Analysis of Timed Systems : 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings / / edited by Jean-Francois Raskin, P.S. Thiagarajan
| Formal Modeling and Analysis of Timed Systems : 5th International Conference, FORMATS 2007, Salzburg, Austria, October 3-5, 2007, Proceedings / / edited by Jean-Francois Raskin, P.S. Thiagarajan |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (X, 372 p.) |
| Disciplina | 003.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Computers, Special purpose Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Special Purpose and Application-Based Systems |
| ISBN | 3-540-75454-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Abstraction of Probabilistic Systems -- From Analysis to Design -- Efficient On-the-Fly Algorithms for Partially Observable Timed Games -- Undecidability of Universality for Timed Automata with Minimal Resources -- On Timed Models of Gene Networks -- Costs Are Expensive! -- Hypervolume Approximation in Timed Automata Model Checking -- Counter-Free Input-Determined Timed Automata -- Towards Budgeting in Real-Time Calculus: Deferrable Servers -- Automatic Abstraction Refinement for Timed Automata -- Dynamical Properties of Timed Automata Revisited -- Robust Sampling for MITL Specifications -- On the Expressiveness of MTL Variants over Dense Time -- Quantitative Model Checking Revisited: Neither Decidable Nor Approximable -- Efficient Detection of Zeno Runs in Timed Automata -- Partial Order Reduction for Verification of Real-Time Components -- Guided Controller Synthesis for Climate Controller Using Uppaal Tiga -- Symbolic Reachability Analysis of Lazy Linear Hybrid Automata -- Combining Formal Verification with Observed System Execution Behavior to Tune System Parameters -- Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times -- Designing Consistent Multimedia Documents: The RT-LOTOS Methodology -- AMT: A Property-Based Monitoring Tool for Analog Systems -- Region Stability Proofs for Hybrid Systems -- CSL Model Checking Algorithms for Infinite-State Structured Markov Chains -- Symbolic Simulation-Checking of Dense-Time Automata. |
| Record Nr. | UNINA-9910484183903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||