Computer Aided Verification [[electronic resource] ] : 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings / / edited by Kousha Etessami, Sriram K. Rajamani |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XVI, 568 p.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Machine theory Artificial intelligence Logic design Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Artificial Intelligence Logic Design |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Randomized Algorithms for Program Analysis and Verification -- Validating a Modern Microprocessor -- Algorithmic Algebraic Model Checking I: Challenges from Systems Biology -- Tools Competition -- SMT-COMP: Satisfiability Modulo Theories Competition -- Abstraction and Refinement -- Predicate Abstraction via Symbolic Decision Procedures -- Interpolant-Based Transition Relation Approximation -- Concrete Model Checking with Abstract Matching and Refinement -- Abstraction for Falsification -- Bounded Model Checking -- Bounded Model Checking of Concurrent Programs -- Incremental and Complete Bounded Model Checking for Full PLTL -- Abstraction Refinement for Bounded Model Checking -- Symmetry Reduction in SAT-Based Model Checking -- Tool Papers I -- Saturn: A SAT-Based Tool for Bug Detection -- JVer: A Java Verifier -- Building Your Own Software Model Checker Using the Bogor Extensible Model Checking Framework -- Wolf – Bug Hunter for Concurrent Software Using Formal Methods -- Model Checking x86 Executables with CodeSurfer/x86 and WPDS++ -- The ComFoRT Reasoning Framework -- Verification of Hardware, Microcode, and Synchronous Systems -- Formal Verification of Pentium ® 4 Components with Symbolic Simulation and Inductive Invariants -- Formal Verification of Backward Compatibility of Microcode -- Compositional Analysis of Floating-Point Linear Numerical Filters -- Syntax-Driven Reachable State Space Construction of Synchronous Reactive Programs -- Games and Probabilistic Verification -- Program Repair as a Game -- Improved Probabilistic Models for 802.11 Protocol Verification -- Probabilistic Verification for “Black-Box” Systems -- On Statistical Model Checking of Stochastic Systems -- Tool Papers II -- The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications -- The Orchids Intrusion Detection Tool -- TVOC: A Translation Validator for Optimizing Compilers -- Cogent: Accurate Theorem Proving for Program Verification -- F-Soft: Software Verification Platform -- Decision Procedures and Applications -- Yet Another Decision Procedure for Equality Logic -- DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic -- Efficient Satisfiability Modulo Theories via Delayed Theory Combination -- Automata and Transition Systems -- Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking -- Efficient Monitoring of ?-Languages -- Verification of Tree Updates for Optimization -- Expand, Enlarge and Check... Made Efficient -- Tool Papers III -- IIV: An Invisible Invariant Verifier -- Action Language Verifier, Extended -- Romeo: A Tool for Analyzing Time Petri Nets -- TRANSYT:A Tool for the Verification of Asynchronous Concurrent Systems -- Ymer: A Statistical Model Checker -- Program Analysis and Verification I -- Extended Weighted Pushdown Systems -- Incremental Algorithms for Inter-procedural Analysis of Safety Properties -- A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs -- Program Analysis and Verification II -- Data Structure Specifications via Local Equality Axioms -- Linear Ranking with Reachability -- Reasoning About Threads Communicating via Locks -- Applications of Learning -- Abstraction Refinement via Inductive Learning -- Automated Assume-Guarantee Reasoning for Simulation Conformance -- Symbolic Compositional Verification by Learning Assumptions. |
Record Nr. | UNINA-9910484912003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computer Aided Verification [[electronic resource] ] : 8th International Conference, CAV '96, New Brunswick, NJ, USA, July 31 - August 3, 1996. Proceedings / / edited by Rajeev Alur, Thomas Henzinger |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (XIII, 479 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Computers Computer hardware Software engineering Mathematical logic Special purpose computers Logics and Meanings of Programs Theory of Computation Computer Hardware Software Engineering Mathematical Logic and Formal Languages Special Purpose and Application-Based Systems |
ISBN | 3-540-68599-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Symbolic verification of communication protocols with infinite state spaces using QDDs -- A conjunctively decomposed boolean representation for symbolic model checking -- Symbolic model checking using algebraic geometry -- A partition refinement algorithm for the ?-calculus -- Polynomial time algorithms for testing probabilistic bisimulation and simulation -- Pushdown processes: Games and model checking -- Module checking -- Automatic verification of parameterized synchronous systems -- HORNSAT, model checking, verification and games -- Verifying the SRT division algorithm using theorem proving techniques -- Modular verification of SRT division -- Mechanically verifying a family of multiplier circuits -- Verifying systems with replicated components in mur? -- Verification of arithmetic circuits by comparing two similar circuits -- Automated deduction and formal methods -- A platform for combining deductive with algorithmic verification -- Verifying invariants using theorem proving -- Deductive model checking -- Automated verification by induction with associative-commutative operators -- Analysis of timed systems based on time-abstracting bisimulations -- Verification of an Audio Protocol with bus collision using Uppaal -- Selective quantitative analysis and interval model checking: Verifying different facets of a system -- Verifying continuous time Markov chains -- Verifying safety properties of differential equations -- Temporal verification by diagram transformations -- Protocol verification by aggregation of distributed transactions -- Atomicity refinement and trace reduction theorems -- Powerful techniques for the automatic generation of invariants -- Saving space by fully exploiting invisible transitions -- Using on-the-fly verification techniques for the generation of test suites -- Automatic translation of natural language system specifications into temporal logic -- Verification of fair transition systems -- The state of Spin -- The Mur ? verification system -- The NCSU Concurrency Workbench -- The Concurrency Factory: A development environment for concurrent systems -- XVERSA: An integrated graphical and textual toolset for the specification and analysis of resource-bound real-time systems -- EVP: Integration of FDTs for the analysis and verification of communication protocols -- PVS: Combining specification, proof checking, and model checking -- STeP: Deductive-algorithmic verification of reactive and real-time systems -- Symbolic model checking -- COSPAN -- VIS: A system for verification and synthesis -- MDG tools for the verification of RTL designs -- CADP a protocol validation and verification toolbox -- The FC2TOOLS set -- The Real-Time Graphical Interval Logic toolset -- The METAFrame'95 environment -- Verification Support Environment -- Marrella: A tool for simulation and verification -- Verifying the safety of a practical concurrent garbage collector -- Verification by behaviour abstraction. |
Record Nr. | UNISA-996465658903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computer Aided Verification [[electronic resource] ] : Fourth International Workshop, CAV '92, Montreal, Canada, June 29 - July 1, 1992. Proceedings / / edited by Gregor von Bochmann, David K. Probst |
Edizione | [1st ed. 1993.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
Descrizione fisica | 1 online resource (IX, 426 p.) |
Disciplina | 005.1015113 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Operating systems (Computers) Software engineering Electronics Microelectronics Mathematical logic Logics and Meanings of Programs Operating Systems Software Engineering/Programming and Operating Systems Software Engineering Electronics and Microelectronics, Instrumentation Mathematical Logic and Foundations |
ISBN | 3-540-47572-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computer-hindered verification (humans can do it too) -- Modular abstractions for verifying real-time distributed systems -- Layering techniques for development of parallel systems -- Efficient local correctness checking -- Mechanical verification of concurrent systems with TLA -- Using a theorem prover for reasoning about concurrent algorithms -- Verifying a logic synthesis tool in Nuprl: A case study in software verification -- Higher-level specification and verification with BDDs -- Symbolic bisimulation minimisation -- Towards a verification technique for large synchronous circuits -- Verifying timed behavior automata with nonbinary delay constraints -- Timing verification by successive approximation -- A verification strategy for timing constrained systems -- Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits -- State space caching revisited -- Verification in process algebra of the distributed control of track vehicles—A case study -- Design verification of a microprocessor using branching time regular temporal logic -- A case study in safety-critical design -- Automatic reduction in CTL compositional model checking -- Compositional model checking for linear-time temporal logic -- Property preserving simulations -- Verification with real-time COSPAN -- Model-checking for real-time systems specified in Lotos -- Decidability of bisimulation equivalences for parallel timer processes -- A proof assistant for symbolic model-checking -- Tableau recycling -- Crocos: An integrated environment for interactive verification of SDL specifications -- Verifying general safety and liveness properties with integer programming -- Generating diagnostic information for behavioral preorders -- A verification procedure via invariant for extended communicating finite-state machines -- Efficient ?-regular language containment -- Faster model checking for the modal Mu-Calculus. |
Record Nr. | UNISA-996466078003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Conceptual Modelling and Its Theoretical Foundations [[electronic resource] ] : Essays Dedicated to Bernhard Thalheim on the Occasion of his 60th Birthday / / edited by Antje Düsterhöft, Meike Klettke, Klaus-Dieter Schewe |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (VIII, 329 p.) |
Disciplina | 005.1015113 |
Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
Soggetto topico |
Computer logic
Mathematical logic Software engineering Computers Artificial intelligence Programming languages (Electronic computers) Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering Models and Principles Artificial Intelligence Programming Languages, Compilers, Interpreters |
ISBN | 3-642-28279-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465874103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Concrete Semantics [[electronic resource] ] : With Isabelle/HOL / / by Tobias Nipkow, Gerwin Klein |
Autore | Nipkow Tobias |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XIII, 298 p. 87 illus., 1 illus. in color.) |
Disciplina | 005.1015113 |
Soggetto topico |
Computer logic
Programming languages (Electronic computers) Mathematical logic Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
ISBN | 3-319-10542-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Introduction -- Programming and Proving -- Case Study: IMP Expressions -- Logic and Proof Beyond Equality -- Isar: A Language for Structured Proofs -- IMP: A Simple Imperative Language -- Compiler -- Types -- Program Analysis -- Denotational Semantics -- Hoare Logic -- Abstract Interpretation -- App. A, Auxiliary Definitions -- App. B, Symbols -- References. |
Record Nr. | UNINA-9910298989403321 |
Nipkow Tobias | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
CONCUR 2009 - Concurrency Theory [[electronic resource] ] : 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings / / edited by Mario Bravetti, Gianluigi Zavattaro |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 638 p.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Computer programming Computer science—Mathematics Computer Science Logic and Foundations of Programming Programming Techniques Theory of Computation Models of Computation Mathematics of Computing |
ISBN | 3-642-04081-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Perspectives on Transactional Memory -- The Effect of Tossing Coins in Omega-Automata -- Bigraphical Categories -- BlenX Static and Dynamic Semantics -- Contributed Papers -- Flow Policy Awareness for Distributed Mobile Code -- Volume and Entropy of Regular Timed Languages: Discretization Approach -- A Logical Interpretation of the ?-Calculus into the ?-Calculus, Preserving Spine Reduction and Types -- Encoding Asynchronous Interactions Using Open Petri Nets -- Distributed Asynchronous Automata -- Algebra for Infinite Forests with an Application to the Temporal Logic EF -- Deriving Syntax and Axioms for Quantitative Regular Behaviours -- Weighted Bisimulation in Linear Algebraic Form -- A Logic-Based Framework for Reasoning about Composite Data Structures -- Measuring Permissivity in Finite Games -- Contracts for Mobile Processes -- Power of Randomization in Automata on Infinite Strings -- Probabilistic Weighted Automata -- Partially-Commutative Context-Free Processes -- Testing Finitary Probabilistic Processes -- A Demonic Approach to Information in Probabilistic Systems -- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour -- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs -- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers -- Model-Checking Games for Fixpoint Logics with Partial Order Models -- Reachability in Succinct and Parametric One-Counter Automata -- Winning Regions of Pushdown Parity Games: A Saturation Method -- Concurrent Kleene Algebra -- Concavely-Priced Probabilistic Timed Automata -- Compositional Control Synthesis for Partially Observable Systems -- Howe’s Method for Calculi with Passivation -- On the Relationship between ?-Calculus and Finite Place/Transition Petri Nets -- Modeling Radio Networks -- Time-Bounded Verification -- Secure Enforcement for Global Process Specifications -- On Convergence of Concurrent Systems under Regular Interactions -- Computing Stuttering Simulations -- Weak Time Petri Nets Strike Back! -- A General Testability Theory -- Counterexamples in Probabilistic LTL Model Checking for Markov Chains -- Query-Based Model Checking of Ad Hoc Network Protocols -- Strict Divergence for Probabilistic Timed Automata. |
Record Nr. | UNISA-996465628903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
CONCUR 2009 - Concurrency Theory [[electronic resource] ] : 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009, Proceedings / / edited by Mario Bravetti, Gianluigi Zavattaro |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 638 p.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Computer programming Computer science—Mathematics Computer Science Logic and Foundations of Programming Programming Techniques Theory of Computation Models of Computation Mathematics of Computing |
ISBN | 3-642-04081-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Perspectives on Transactional Memory -- The Effect of Tossing Coins in Omega-Automata -- Bigraphical Categories -- BlenX Static and Dynamic Semantics -- Contributed Papers -- Flow Policy Awareness for Distributed Mobile Code -- Volume and Entropy of Regular Timed Languages: Discretization Approach -- A Logical Interpretation of the ?-Calculus into the ?-Calculus, Preserving Spine Reduction and Types -- Encoding Asynchronous Interactions Using Open Petri Nets -- Distributed Asynchronous Automata -- Algebra for Infinite Forests with an Application to the Temporal Logic EF -- Deriving Syntax and Axioms for Quantitative Regular Behaviours -- Weighted Bisimulation in Linear Algebraic Form -- A Logic-Based Framework for Reasoning about Composite Data Structures -- Measuring Permissivity in Finite Games -- Contracts for Mobile Processes -- Power of Randomization in Automata on Infinite Strings -- Probabilistic Weighted Automata -- Partially-Commutative Context-Free Processes -- Testing Finitary Probabilistic Processes -- A Demonic Approach to Information in Probabilistic Systems -- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour -- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs -- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers -- Model-Checking Games for Fixpoint Logics with Partial Order Models -- Reachability in Succinct and Parametric One-Counter Automata -- Winning Regions of Pushdown Parity Games: A Saturation Method -- Concurrent Kleene Algebra -- Concavely-Priced Probabilistic Timed Automata -- Compositional Control Synthesis for Partially Observable Systems -- Howe’s Method for Calculi with Passivation -- On the Relationship between ?-Calculus and Finite Place/Transition Petri Nets -- Modeling Radio Networks -- Time-Bounded Verification -- Secure Enforcement for Global Process Specifications -- On Convergence of Concurrent Systems under Regular Interactions -- Computing Stuttering Simulations -- Weak Time Petri Nets Strike Back! -- A General Testability Theory -- Counterexamples in Probabilistic LTL Model Checking for Markov Chains -- Query-Based Model Checking of Ad Hoc Network Protocols -- Strict Divergence for Probabilistic Timed Automata. |
Record Nr. | UNINA-9910483828403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
CONCUR 2013 -- Concurrency Theory [[electronic resource] ] : 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013, Proceedings / / edited by Pedro R. D'Argenio, Hernan Melgratti |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XIV, 562 p. 83 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Computer science—Mathematics Mathematical statistics Computer Science Logic and Foundations of Programming Software Engineering Probability and Statistics in Computer Science |
ISBN | 3-642-40184-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Process Semantics and Modal Transition Systems.- VAS and Pushdown Systems.- Pi Calculus and Interaction Nets -- Linearizability and Verification of Concurrent Programs -- Verification of Infinite Models, Model Measure and Reversibility.- Stochastic Models.- Message-Based Interacting Processes.- Principles of Automatic Verification -- Games and Control Synthesis. |
Record Nr. | UNISA-996466032403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
CONCUR 2013 -- Concurrency Theory [[electronic resource] ] : 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013, Proceedings / / edited by Pedro R. D'Argenio, Hernan Melgratti |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XIV, 562 p. 83 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Computer science—Mathematics Mathematical statistics Computer Science Logic and Foundations of Programming Software Engineering Probability and Statistics in Computer Science |
ISBN | 3-642-40184-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Process Semantics and Modal Transition Systems.- VAS and Pushdown Systems.- Pi Calculus and Interaction Nets -- Linearizability and Verification of Concurrent Programs -- Verification of Infinite Models, Model Measure and Reversibility.- Stochastic Models.- Message-Based Interacting Processes.- Principles of Automatic Verification -- Games and Control Synthesis. |
Record Nr. | UNINA-9910484318803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Concurrency, Security, and Puzzles [[electronic resource] ] : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday / / edited by Thomas Gibson-Robinson, Philippa Hopcroft, Ranko Lazić |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XVIII, 319 p. 58 illus.) |
Disciplina | 005.1015113 |
Collana | Programming and Software Engineering |
Soggetto topico |
Computer logic
Software engineering Programming languages (Electronic computers) Mathematical logic Computer communication systems Computer programming Logics and Meanings of Programs Software Engineering Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Computer Communication Networks Programming Techniques |
ISBN | 3-319-51046-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Bill Roscoe, on his 60th Birthday -- A Tribute to Bill Roscoe, on the Occasion of his 60th Birthday -- Herding Cats, Oxford Style -- Stealthy Protocols: Metrics and Open Problems -- A Specification Theory of Real-Time Processes -- Towards Verification of Cyber-Physical Systems with UTP and Isabelle/HOL -- FDR: From Theory to Industrial Application -- Information Flow, Distributed Systems, and Refinement, by Example -- Abstractions for Transition Systems with Applications to Stubborn Sets -- A Hybrid Relational Modelling Language -- What Makes Petri Nets Harder to Verify: Stack or Data -- Analysing Lock-Free Linearizable Datatypes Using CSP -- Discrete Random Variables over Domains, Revisited -- A Demonic Lattice of Information -- A Brief History of Security Protocols -- More Stubborn Set Methods for Process Algebras -- A Branching Time Model of CSP -- Virtualization Based Development. . |
Record Nr. | UNINA-9910483113703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|