top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
CONCUR 2006 - Concurrency Theory [[electronic resource] ] : 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 / / edited by Christel Baier, Holger Hermanns
CONCUR 2006 - Concurrency Theory [[electronic resource] ] : 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 / / edited by Christel Baier, Holger Hermanns
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XIII, 525 p.)
Disciplina 004/.35
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer systems
Computer science
Compilers (Computer programs)
Computer programming
Computer networks
Computer System Implementation
Computer Science Logic and Foundations of Programming
Theory of Computation
Compilers and Interpreters
Programming Techniques
Computer Communication Networks
ISBN 3-540-37377-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Contributions -- Modeling Timed Concurrent Systems -- Some Remarks on Definability of Process Graphs -- Sanity Checks in Formal Verification -- Invited Tutorials -- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi -- Probability and Nondeterminism in Operational Models of Concurrency -- Model Checking -- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems -- Proving Liveness by Backwards Reachability -- Model Checking Quantified Computation Tree Logic -- Process Calculi -- Liveness, Fairness and Impossible Futures -- Checking a Mutex Algorithm in a Process Algebra with Fairness -- A Complete Axiomatic Semantics for the CSP Stable-Failures Model -- Transition Systems of Elementary Net Systems with Localities -- Minimization and Equivalence Checking -- Operational Determinism and Fast Algorithms -- Minimization, Learning, and Conformance Testing of Boolean Programs -- A Capability Calculus for Concurrency and Determinism -- Types -- A New Type System for Deadlock-Free Processes -- Sortings for Reactive Systems -- Dynamic Access Control in a Concurrent Object Calculus -- Semantics -- Concurrent Rewriting for Graphs with Equivalences -- Event Structure Semantics for Nominal Calculi -- Encoding ?Duce in the ??-Calculus -- Probability -- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification -- Probabilistic I/O Automata: Theories of Two Equivalences -- Reachability in Recursive Markov Decision Processes -- Strategy Improvement for Stochastic Rabin and Streett Games -- Bisimulation and Simulation -- Weak Bisimulation Up to Elaboration -- Generic Forward and Backward Simulations -- On Finite Alphabets and Infinite Bases III: Simulation -- Real Time -- Inference of Event-Recording Automata Using Timed Decision Trees -- Controller Synthesis for MTL Specifications -- On Interleaving in Timed Automata -- Formal Languages -- A Language for Task Orchestration and Its Semantic Properties -- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words -- Second-Order Simple Grammars.
Record Nr. UNISA-996465601303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
CONCUR 2006 - Concurrency Theory : 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 / / edited by Christel Baier, Holger Hermanns
CONCUR 2006 - Concurrency Theory : 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 / / edited by Christel Baier, Holger Hermanns
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XIII, 525 p.)
Disciplina 004/.35
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer systems
Computer science
Compilers (Computer programs)
Computer programming
Computer networks
Computer System Implementation
Computer Science Logic and Foundations of Programming
Theory of Computation
Compilers and Interpreters
Programming Techniques
Computer Communication Networks
ISBN 3-540-37377-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Contributions -- Modeling Timed Concurrent Systems -- Some Remarks on Definability of Process Graphs -- Sanity Checks in Formal Verification -- Invited Tutorials -- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi -- Probability and Nondeterminism in Operational Models of Concurrency -- Model Checking -- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems -- Proving Liveness by Backwards Reachability -- Model Checking Quantified Computation Tree Logic -- Process Calculi -- Liveness, Fairness and Impossible Futures -- Checking a Mutex Algorithm in a Process Algebra with Fairness -- A Complete Axiomatic Semantics for the CSP Stable-Failures Model -- Transition Systems of Elementary Net Systems with Localities -- Minimization and Equivalence Checking -- Operational Determinism and Fast Algorithms -- Minimization, Learning, and Conformance Testing of Boolean Programs -- A Capability Calculus for Concurrency and Determinism -- Types -- A New Type System for Deadlock-Free Processes -- Sortings for Reactive Systems -- Dynamic Access Control in a Concurrent Object Calculus -- Semantics -- Concurrent Rewriting for Graphs with Equivalences -- Event Structure Semantics for Nominal Calculi -- Encoding ?Duce in the ??-Calculus -- Probability -- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification -- Probabilistic I/O Automata: Theories of Two Equivalences -- Reachability in Recursive Markov Decision Processes -- Strategy Improvement for Stochastic Rabin and Streett Games -- Bisimulation and Simulation -- Weak Bisimulation Up to Elaboration -- Generic Forward and Backward Simulations -- On Finite Alphabets and Infinite Bases III: Simulation -- Real Time -- Inference of Event-Recording Automata Using Timed Decision Trees -- Controller Synthesis for MTL Specifications -- On Interleaving in Timed Automata -- Formal Languages -- A Language for Task Orchestration and Its Semantic Properties -- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words -- Second-Order Simple Grammars.
Record Nr. UNINA-9910483851903321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Lectures on Formal Methods and Performance Analysis [[electronic resource] ] : First EEF/Euro Summer School on Trends in Computer Science Berg en Dal, The Netherlands, July 3-7, 2000. Revised Lectures / / edited by Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen
Lectures on Formal Methods and Performance Analysis [[electronic resource] ] : First EEF/Euro Summer School on Trends in Computer Science Berg en Dal, The Netherlands, July 3-7, 2000. Revised Lectures / / edited by Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (VII, 434 p.)
Disciplina 004.0151
Collana Lecture Notes in Computer Science
Soggetto topico Software engineering
Computer engineering
Computer logic
Computer system failures
Computer communication systems
Software Engineering/Programming and Operating Systems
Computer Engineering
Logics and Meanings of Programs
Software Engineering
System Performance and Evaluation
Computer Communication Networks
ISBN 3-540-44667-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Formal Methods for Performance Evaluation -- Markovian Models for Performance and Dependability Evaluation -- to Stochastic Petri Nets -- Non-Markovian Analysis -- Process Algebra and Markov Chains -- Verification of Randomized Distributed Algorithms -- Constructing Automata from Temporal Logic Formulas: A Tutorial? -- Exploiting Structure in Solution: Decomposing Compositional Models -- Stochastic Activity Networks: Formal Definitions and Concepts? -- Distributed and Structured Analysis Approaches to Study Large and Complex Systems? -- General Distributions in Process Algebra.
Record Nr. UNISA-996465812203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Lectures on Formal Methods and Performance Analysis : First EEF/Euro Summer School on Trends in Computer Science Berg en Dal, The Netherlands, July 3-7, 2000. Revised Lectures / / edited by Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen
Lectures on Formal Methods and Performance Analysis : First EEF/Euro Summer School on Trends in Computer Science Berg en Dal, The Netherlands, July 3-7, 2000. Revised Lectures / / edited by Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (VII, 434 p.)
Disciplina 004.0151
Collana Lecture Notes in Computer Science
Soggetto topico Software engineering
Computer engineering
Computer logic
Computer system failures
Computer communication systems
Software Engineering/Programming and Operating Systems
Computer Engineering
Logics and Meanings of Programs
Software Engineering
System Performance and Evaluation
Computer Communication Networks
ISBN 3-540-44667-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Formal Methods for Performance Evaluation -- Markovian Models for Performance and Dependability Evaluation -- to Stochastic Petri Nets -- Non-Markovian Analysis -- Process Algebra and Markov Chains -- Verification of Randomized Distributed Algorithms -- Constructing Automata from Temporal Logic Formulas: A Tutorial? -- Exploiting Structure in Solution: Decomposing Compositional Models -- Stochastic Activity Networks: Formal Definitions and Concepts? -- Distributed and Structured Analysis Approaches to Study Large and Complex Systems? -- General Distributions in Process Algebra.
Record Nr. UNINA-9910143595603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Measurement, Modelling and Evaluation of Computing Systems [[electronic resource] ] : 20th International GI/ITG Conference, MMB 2020, Saarbrücken, Germany, March 16–18, 2020, Proceedings / / edited by Holger Hermanns
Measurement, Modelling and Evaluation of Computing Systems [[electronic resource] ] : 20th International GI/ITG Conference, MMB 2020, Saarbrücken, Germany, March 16–18, 2020, Proceedings / / edited by Holger Hermanns
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XVIII, 279 p. 573 illus., 59 illus. in color.)
Disciplina 621.382
Collana Programming and Software Engineering
Soggetto topico Software engineering
Architecture, Computer
Application software
Computer communication systems
Special purpose computers
Artificial intelligence
Software Engineering
Computer System Implementation
Information Systems Applications (incl. Internet)
Computer Communication Networks
Special Purpose and Application-Based Systems
Artificial Intelligence
ISBN 3-030-43024-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Performance Analytics of a Virtual Reality Streaming Model -- To Fail Or Not To Fail: Predicting Hard Disk Drive Failure Time Windows -- Concurrent MDPs with Finite Markovian Policies -- A Stochastic Automata Network Description for Spatial DNA-Methylation Models -- An ns-3 Model for Multipath Communication with Terrestrial and Satellite Links -- Model-based Performance Predictions for SDN-based Networks -- Performance Analysis for Loss Systems with Many Subscribers -- On the Stochastic End-to-End Delay Analysis in Sink Trees Under Independent and Dependent Arrivals -- Graph-based Mobility Models: Asymptotic and Stationary Node Distribution -- Parallelization of EM-Algorithms for Markovian Arrival Processes -- It Sometimes Works: A Lifting Algorithm for Repair of Stochastic Process Algebra Models -- An Efficient Brute Force Approach to Fit Finite Mixture Distributions -- Freight Train Scheduling in Railway Systems -- A Domain Specific Language and Toolset for Requirements Analysis of Safety-Critical Cyber-Physical Systems -- Automated Rare Event Simulation for Fault Tree Analysis via Minimal Cut Sets.
Record Nr. UNISA-996418310803316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Measurement, Modelling and Evaluation of Computing Systems : 20th International GI/ITG Conference, MMB 2020, Saarbrücken, Germany, March 16–18, 2020, Proceedings / / edited by Holger Hermanns
Measurement, Modelling and Evaluation of Computing Systems : 20th International GI/ITG Conference, MMB 2020, Saarbrücken, Germany, March 16–18, 2020, Proceedings / / edited by Holger Hermanns
Edizione [1st ed. 2020.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Descrizione fisica 1 online resource (XVIII, 279 p. 573 illus., 59 illus. in color.)
Disciplina 621.382
004.6
Collana Programming and Software Engineering
Soggetto topico Software engineering
Architecture, Computer
Application software
Computer communication systems
Special purpose computers
Artificial intelligence
Software Engineering
Computer System Implementation
Information Systems Applications (incl. Internet)
Computer Communication Networks
Special Purpose and Application-Based Systems
Artificial Intelligence
ISBN 3-030-43024-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Performance Analytics of a Virtual Reality Streaming Model -- To Fail Or Not To Fail: Predicting Hard Disk Drive Failure Time Windows -- Concurrent MDPs with Finite Markovian Policies -- A Stochastic Automata Network Description for Spatial DNA-Methylation Models -- An ns-3 Model for Multipath Communication with Terrestrial and Satellite Links -- Model-based Performance Predictions for SDN-based Networks -- Performance Analysis for Loss Systems with Many Subscribers -- On the Stochastic End-to-End Delay Analysis in Sink Trees Under Independent and Dependent Arrivals -- Graph-based Mobility Models: Asymptotic and Stationary Node Distribution -- Parallelization of EM-Algorithms for Markovian Arrival Processes -- It Sometimes Works: A Lifting Algorithm for Repair of Stochastic Process Algebra Models -- An Efficient Brute Force Approach to Fit Finite Mixture Distributions -- Freight Train Scheduling in Railway Systems -- A Domain Specific Language and Toolset for Requirements Analysis of Safety-Critical Cyber-Physical Systems -- Automated Rare Event Simulation for Fault Tree Analysis via Minimal Cut Sets.
Record Nr. UNINA-9910410056103321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Process Algebra and Probabilistic Methods: Performance Modeling and Verification [[electronic resource] ] : Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25-26, 2002 Proceedings / / edited by Holger Hermanns, Roberto Segala
Process Algebra and Probabilistic Methods: Performance Modeling and Verification [[electronic resource] ] : Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25-26, 2002 Proceedings / / edited by Holger Hermanns, Roberto Segala
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (X, 222 p.)
Disciplina 511.3
Collana Lecture Notes in Computer Science
Soggetto topico Algebra
Software engineering
Mathematical models
Computer logic
Programming languages (Electronic computers)
Software Engineering/Programming and Operating Systems
Mathematical Modeling and Industrial Mathematics
Logics and Meanings of Programs
Software Engineering
Programming Languages, Compilers, Interpreters
ISBN 3-540-45605-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Contributions -- Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs -- Probability and Timing: Challenges for Secure Programming -- Selected Papers -- Security Analysis of a Probabilistic Non-repudiation Protocol -- The Mean Value of the Maximum -- Reduction and Refinement Strategies for Probabilistic Analysis -- Action Refinement for Probabilistic Processes with True Concurrency Models -- Probabilistic Unfoldings and Partial Order Fairness in Petri Nets -- Possibilistic and Probabilistic Abstraction-Based Model Checking -- Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling -- Model Checking CSL until Formulae with Random Time Bounds -- Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol -- Deriving Symbolic Representations from Stochastic Process Algebras -- Short Abstracts -- A Generalization of Equational Proof Theory? -- An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems -- Probabilistic Abstract Interpretation and Statistical Testing -- Approximate Verification of Probabilistic Systems.
Record Nr. UNISA-996466371603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Process Algebra and Probabilistic Methods: Performance Modeling and Verification : Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25-26, 2002 Proceedings / / edited by Holger Hermanns, Roberto Segala
Process Algebra and Probabilistic Methods: Performance Modeling and Verification : Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark, July 25-26, 2002 Proceedings / / edited by Holger Hermanns, Roberto Segala
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (X, 222 p.)
Disciplina 511.3
Collana Lecture Notes in Computer Science
Soggetto topico Algebra
Software engineering
Mathematical models
Computer logic
Programming languages (Electronic computers)
Software Engineering/Programming and Operating Systems
Mathematical Modeling and Industrial Mathematics
Logics and Meanings of Programs
Software Engineering
Programming Languages, Compilers, Interpreters
ISBN 3-540-45605-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Contributions -- Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs -- Probability and Timing: Challenges for Secure Programming -- Selected Papers -- Security Analysis of a Probabilistic Non-repudiation Protocol -- The Mean Value of the Maximum -- Reduction and Refinement Strategies for Probabilistic Analysis -- Action Refinement for Probabilistic Processes with True Concurrency Models -- Probabilistic Unfoldings and Partial Order Fairness in Petri Nets -- Possibilistic and Probabilistic Abstraction-Based Model Checking -- Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling -- Model Checking CSL until Formulae with Random Time Bounds -- Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol -- Deriving Symbolic Representations from Stochastic Process Algebras -- Short Abstracts -- A Generalization of Equational Proof Theory? -- An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems -- Probabilistic Abstract Interpretation and Statistical Testing -- Approximate Verification of Probabilistic Systems.
Record Nr. UNINA-9910143882303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings / / edited by Holger Hermanns, Jens Palsberg
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings / / edited by Holger Hermanns, Jens Palsberg
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XVI, 512 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Software engineering
Computer science
Computer networks
Algorithms
Software Engineering
Computer Science Logic and Foundations of Programming
Computer Communication Networks
ISBN 3-540-33057-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Contributions -- Weighted Pushdown Systems and Trust-Management Systems -- Parametrization and Slicing -- Automatic Verification of Parameterized Data Structures -- Parameterized Verification of ?-Calculus Systems -- Easy Parameterized Verification of Biphase Mark and 8N1 Protocols -- Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs -- Symbolic Techniques -- New Metrics for Static Variable Ordering in Decision Diagrams -- Widening ROBDDs with Prime Implicants -- Efficient Guided Symbolic Reachability Using Reachability Expressions -- Satisfiability -- SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver -- SAT-Based Software Certification -- Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants -- Exploration of the Capabilities of Constraint Programming for Software Verification -- Abstraction -- Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems -- Why Waste a Perfectly Good Abstraction? -- Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking -- Approximating Predicate Images for Bit-Vector Logic -- Model Checking Algorithms -- Finitary Winning in ?-Regular Games -- Efficient Model Checking for LTL with Partial Order Snapshots -- A Local Shape Analysis Based on Separation Logic -- Program Verification -- Compositional Model Extraction for Higher-Order Concurrent Programs -- A Region Graph Based Approach to Termination Proofs -- Verifying Concurrent Message-Passing C Programs with Recursive Calls -- Automata-Based Verification of Programs with Tree Updates -- Runtime Diagnostics -- An Experimental Comparison of the Effectiveness of Control Flow Based Testing Approaches on Seeded Faults -- Exploiting Traces in Program Analysis -- Quantitative Techniques -- Model-Checking Markov Chains in the Presence of Uncertainties -- Safety Metric Temporal Logic Is Fully Decidable -- Simulation-Based Graph Similarity -- Tool Demonstrations -- PRISM: A Tool for Automatic Verification of Probabilistic Systems -- DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation -- mcmas: A Model Checker for Multi-agent Systems -- MSCan – A Tool for Analyzing MSC Specifications -- Refinement -- A Practical and Complete Approach to Predicate Refinement -- Counterexample Driven Refinement for Abstract Interpretation -- Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
Record Nr. UNISA-996465811903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Tools and Algorithms for the Construction and Analysis of Systems : 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings / / edited by Holger Hermanns, Jens Palsberg
Tools and Algorithms for the Construction and Analysis of Systems : 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings / / edited by Holger Hermanns, Jens Palsberg
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XVI, 512 p.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Software engineering
Computer science
Computer networks
Algorithms
Software Engineering
Computer Science Logic and Foundations of Programming
Computer Communication Networks
ISBN 3-540-33057-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Contributions -- Weighted Pushdown Systems and Trust-Management Systems -- Parametrization and Slicing -- Automatic Verification of Parameterized Data Structures -- Parameterized Verification of ?-Calculus Systems -- Easy Parameterized Verification of Biphase Mark and 8N1 Protocols -- Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs -- Symbolic Techniques -- New Metrics for Static Variable Ordering in Decision Diagrams -- Widening ROBDDs with Prime Implicants -- Efficient Guided Symbolic Reachability Using Reachability Expressions -- Satisfiability -- SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver -- SAT-Based Software Certification -- Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants -- Exploration of the Capabilities of Constraint Programming for Software Verification -- Abstraction -- Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems -- Why Waste a Perfectly Good Abstraction? -- Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking -- Approximating Predicate Images for Bit-Vector Logic -- Model Checking Algorithms -- Finitary Winning in ?-Regular Games -- Efficient Model Checking for LTL with Partial Order Snapshots -- A Local Shape Analysis Based on Separation Logic -- Program Verification -- Compositional Model Extraction for Higher-Order Concurrent Programs -- A Region Graph Based Approach to Termination Proofs -- Verifying Concurrent Message-Passing C Programs with Recursive Calls -- Automata-Based Verification of Programs with Tree Updates -- Runtime Diagnostics -- An Experimental Comparison of the Effectiveness of Control Flow Based Testing Approaches on Seeded Faults -- Exploiting Traces in Program Analysis -- Quantitative Techniques -- Model-Checking Markov Chains in the Presence of Uncertainties -- Safety Metric Temporal Logic Is Fully Decidable -- Simulation-Based Graph Similarity -- Tool Demonstrations -- PRISM: A Tool for Automatic Verification of Probabilistic Systems -- DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation -- mcmas: A Model Checker for Multi-agent Systems -- MSCan – A Tool for Analyzing MSC Specifications -- Refinement -- A Practical and Complete Approach to Predicate Refinement -- Counterexample Driven Refinement for Abstract Interpretation -- Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
Record Nr. UNINA-9910768468103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui