CONCUR 2008 - Concurrency Theory [[electronic resource] ] : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings / / edited by Franck van Breugel, Marsha Chechik |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 524 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer networks Computer science Programming Techniques Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming |
ISBN | 3-540-85361-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century -- Service Choreography and Orchestration with Conversations -- Knowledge and Information in Probabilistic Systems -- Taming Concurrency: A Program Verification Perspective -- Contributed Papers -- A Model of Dynamic Separation for Transactional Memory -- Completeness and Nondeterminism in Model Checking Transactional Memories -- Semantics of Deterministic Shared-Memory Systems -- A Scalable and Oblivious Atomicity Assertion -- R-Automata -- Distributed Timed Automata with Independently Evolving Clocks -- A Context-Free Process as a Pushdown Automaton -- Modeling Computational Security in Long-Lived Systems -- Contract-Directed Synthesis of Simple Orchestrators -- Environment Assumptions for Synthesis -- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning -- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs -- Subsequence Invariants -- Invariants for Parameterised Boolean Equation Systems -- Unfolding-Based Diagnosis of Systems with an Evolving Topology -- On the Construction of Sorted Reactive Systems -- Dynamic Partial Order Reduction Using Probe Sets -- A Space-Efficient Probabilistic Simulation Algorithm -- Least Upper Bounds for Probability Measures and Their Applications to Abstractions -- Abstraction for Stochastic Systems by Erlang’s Method of Stages -- On the Minimisation of Acyclic Models -- Quasi-Static Scheduling of Communicating Tasks -- Strategy Construction for Parity Games with Imperfect Information -- Mixing Lossy and Perfect Fifo Channels -- On the Reachability Analysis of Acyclic Networks of Pushdown Systems -- Spatial and Behavioral Types in the Pi-Calculus -- A Spatial Equational Logic for the Applied ?-Calculus -- Structured Interactional Exceptions in Session Types -- Global Progress in Dynamically Interleaved Multiparty Sessions -- Normed BPA vs. Normed BPP Revisited -- A Rule Format for Associativity -- Deriving Structural Labelled Transitions for Mobile Ambients -- Termination Problems in Chemical Kinetics -- Towards a Unified Approach to Encodability and Separation Results for Process Calculi -- A Notion of Glue Expressiveness for Component-Based Systems. |
Record Nr. | UNISA-996465997703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
CONCUR 2008 - Concurrency Theory : 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings / / edited by Franck van Breugel, Marsha Chechik |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 524 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Computer networks Computer science Programming Techniques Computer Communication Networks Theory of Computation Computer Science Logic and Foundations of Programming |
ISBN | 3-540-85361-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century -- Service Choreography and Orchestration with Conversations -- Knowledge and Information in Probabilistic Systems -- Taming Concurrency: A Program Verification Perspective -- Contributed Papers -- A Model of Dynamic Separation for Transactional Memory -- Completeness and Nondeterminism in Model Checking Transactional Memories -- Semantics of Deterministic Shared-Memory Systems -- A Scalable and Oblivious Atomicity Assertion -- R-Automata -- Distributed Timed Automata with Independently Evolving Clocks -- A Context-Free Process as a Pushdown Automaton -- Modeling Computational Security in Long-Lived Systems -- Contract-Directed Synthesis of Simple Orchestrators -- Environment Assumptions for Synthesis -- Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning -- SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs -- Subsequence Invariants -- Invariants for Parameterised Boolean Equation Systems -- Unfolding-Based Diagnosis of Systems with an Evolving Topology -- On the Construction of Sorted Reactive Systems -- Dynamic Partial Order Reduction Using Probe Sets -- A Space-Efficient Probabilistic Simulation Algorithm -- Least Upper Bounds for Probability Measures and Their Applications to Abstractions -- Abstraction for Stochastic Systems by Erlang’s Method of Stages -- On the Minimisation of Acyclic Models -- Quasi-Static Scheduling of Communicating Tasks -- Strategy Construction for Parity Games with Imperfect Information -- Mixing Lossy and Perfect Fifo Channels -- On the Reachability Analysis of Acyclic Networks of Pushdown Systems -- Spatial and Behavioral Types in the Pi-Calculus -- A Spatial Equational Logic for the Applied ?-Calculus -- Structured Interactional Exceptions in Session Types -- Global Progress in Dynamically Interleaved Multiparty Sessions -- Normed BPA vs. Normed BPP Revisited -- A Rule Format for Associativity -- Deriving Structural Labelled Transitions for Mobile Ambients -- Termination Problems in Chemical Kinetics -- Towards a Unified Approach to Encodability and Separation Results for Process Calculi -- A Notion of Glue Expressiveness for Component-Based Systems. |
Record Nr. | UNINA-9910483383303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Formal methods : 25th international symposium, FM 2023, Lübeck, Germany, March 6-10, 2023, proceedings / / edited by Marsha Chechik, Joost-Pieter Katoen, and Martin Leucker |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (661 pages) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Computer Science |
Soggetto topico | Formal methods (Computer science) |
ISBN | 3-031-27481-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Keynotes -- Symbolic Computation in Automated Program Reasoning -- The next big thing: from embedded systems to embodied actors -- Intelligent and Dependable Decision-Making Under Uncertainty -- A Coq formalization of Lebesgue Induction Principle and Tonelli’s Theorem -- SAT/SMT -- Railway Scheduling Using Boolean Satisfiability Modulo Simulations -- SMT Sampling via Model-Guided Approximation -- Efficient SMT-based Network Fault Tolerance Verification -- Verification I -- Formalising the Prevention of Microarchitectural Timing Channels by Operating Systems -- Can we Communicate? Using Dynamic Logic to Verify Team Automata -- The ScalaFix equation solver -- HHLPy: Practical Verification of Hybrid Systems using Hoare Logic -- Quantitative Verification -- symQV: Automated Symbolic Verification of Quantum Programs -- PFL: a Probabilistic Logic for Fault Trees -- Energy Buechi Problems -- QMaude: quantitative specification and verification in rewriting logic -- Concurrency and Memory Models -- Minimisation of Spatial Models using Branching Bisimilarity -- Reasoning about Promises in Weak Memory Models with Event Structures -- A fine-grained semantics for arrays and pointers under weak memory models -- VeyMont: Parallelising Verified Programs instead of Verifying Parallel Programs -- Verification 2 -- Verifying At the Level of Java Bytecode -- Abstract Alloy Instances -- Monitoring the Internet Computer -- Word Equations in Synergy with Regular Constraints -- Formal Methods in AI -- Verifying Feedforward Neural Networks for Classification in Isabelle/HOL -- SMPT: A Testbed for Reachabilty Methods in Generalized Petri Nets -- The Octatope Abstract Domain for Verification of Neural Networks -- Program Semantics and Verification Technique for AI-centred Programs -- Safety and Reliability -- Tableaux for Realizability of Safety Specifications -- A Decision Diagram Operation for Reachability -- Formal Modelling of Safety Architecture for Responsibility-Aware Autonomous Vehicle via Event-B Refinement -- A Runtime Environment for Contract Automata -- Industry Day -- Formal and Executable Semantics of the Ethereum Virtual Machine in Dafny -- Shifting Left for Early Detection of Machine-Learning Bugs -- A Systematic Approach to Automotive Security -- Specification-Guided Critical Scenario Identification for Automated Driving -- Runtime Monitoring for Out-of-Distribution Detection in Object Detection Neural Networks -- Backdoor Mitigation in Deep Neural Networks via Strategic Retraining -- veriFIRE: Verifying an Industrial, Learning-Based Wildfire Detection System. |
Record Nr. | UNINA-9910678257703321 |
Cham, Switzerland : , : Springer, , [2023] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Formal methods : 25th international symposium, FM 2023, Lübeck, Germany, March 6-10, 2023, proceedings / / edited by Marsha Chechik, Joost-Pieter Katoen, and Martin Leucker |
Edizione | [1st ed. 2023.] |
Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
Descrizione fisica | 1 online resource (661 pages) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Computer Science |
Soggetto topico | Formal methods (Computer science) |
ISBN | 3-031-27481-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Keynotes -- Symbolic Computation in Automated Program Reasoning -- The next big thing: from embedded systems to embodied actors -- Intelligent and Dependable Decision-Making Under Uncertainty -- A Coq formalization of Lebesgue Induction Principle and Tonelli’s Theorem -- SAT/SMT -- Railway Scheduling Using Boolean Satisfiability Modulo Simulations -- SMT Sampling via Model-Guided Approximation -- Efficient SMT-based Network Fault Tolerance Verification -- Verification I -- Formalising the Prevention of Microarchitectural Timing Channels by Operating Systems -- Can we Communicate? Using Dynamic Logic to Verify Team Automata -- The ScalaFix equation solver -- HHLPy: Practical Verification of Hybrid Systems using Hoare Logic -- Quantitative Verification -- symQV: Automated Symbolic Verification of Quantum Programs -- PFL: a Probabilistic Logic for Fault Trees -- Energy Buechi Problems -- QMaude: quantitative specification and verification in rewriting logic -- Concurrency and Memory Models -- Minimisation of Spatial Models using Branching Bisimilarity -- Reasoning about Promises in Weak Memory Models with Event Structures -- A fine-grained semantics for arrays and pointers under weak memory models -- VeyMont: Parallelising Verified Programs instead of Verifying Parallel Programs -- Verification 2 -- Verifying At the Level of Java Bytecode -- Abstract Alloy Instances -- Monitoring the Internet Computer -- Word Equations in Synergy with Regular Constraints -- Formal Methods in AI -- Verifying Feedforward Neural Networks for Classification in Isabelle/HOL -- SMPT: A Testbed for Reachabilty Methods in Generalized Petri Nets -- The Octatope Abstract Domain for Verification of Neural Networks -- Program Semantics and Verification Technique for AI-centred Programs -- Safety and Reliability -- Tableaux for Realizability of Safety Specifications -- A Decision Diagram Operation for Reachability -- Formal Modelling of Safety Architecture for Responsibility-Aware Autonomous Vehicle via Event-B Refinement -- A Runtime Environment for Contract Automata -- Industry Day -- Formal and Executable Semantics of the Ethereum Virtual Machine in Dafny -- Shifting Left for Early Detection of Machine-Learning Bugs -- A Systematic Approach to Automotive Security -- Specification-Guided Critical Scenario Identification for Automated Driving -- Runtime Monitoring for Out-of-Distribution Detection in Object Detection Neural Networks -- Backdoor Mitigation in Deep Neural Networks via Strategic Retraining -- veriFIRE: Verifying an Industrial, Learning-Based Wildfire Detection System. |
Record Nr. | UNISA-996517755403316 |
Cham, Switzerland : , : Springer, , [2023] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Fundamental Approaches to Software Engineering [[electronic resource] ] : 12th International Conference, FASE 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009, Proceedings / / edited by Marsha Chechik, Martin Wirsing |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 488 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Compilers (Computer programs) Computer programming Computer science Software Engineering Compilers and Interpreters Programming Techniques Computer Science Logic and Foundations of Programming Theory of Computation |
ISBN | 3-642-00593-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Scalable Analysis of Scalable Systems -- Scalable Analysis of Scalable Systems -- Model-Driven Development -- Rewriting Logic Semantics and Verification of Model Transformations -- Confluence in Domain-Independent Product Line Transformations -- Object Flow Definition for Refined Activity Diagrams -- A Category-Theoretical Approach to the Formalisation of Version Control in MDE -- Synthesis and Adaptation -- Controller Synthesis from LSC Requirements -- Interface Generation and Compositional Verification in JavaPathfinder -- A Formal Way from Text to Code Templates -- Context-Aware Adaptive Services: The PLASTIC Approach -- Modeling -- Synchronous Modeling and Validation of Priority Inheritance Schedulers -- Describing and Analyzing Behaviours over Tabular Specifications Using (Dyn)Alloy -- Testing and Debugging -- Reducing the Costs of Bounded-Exhaustive Testing -- Logical Testing -- Cross-Entropy-Based Replay of Concurrent Programs -- Model Analysis -- Control Dependence for Extended Finite State Machines -- Proving Consistency of Pure Methods and Model Fields -- On the Implementation of @pre -- Formal Specification and Analysis of Timing Properties in Software Systems -- Patterns -- Formal Foundation for Pattern-Based Modelling -- Problem-Oriented Documentation of Design Patterns -- Security -- Certification of Smart-Card Applications in Common Criteria -- Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks -- A Formal Connection between Security Automata and JML Annotations -- Queries and Error Handling -- Algorithms for Automatically Computing the Causal Paths of Failures -- Mining API Error-Handling Specifications from Source Code -- SNIFF: A Search Engine for Java Using Free-Form Queries -- Inquiry and Introspection for Non-deterministic Queries in Mobile Networks -- Tools (Demos) and Program Analysis -- hol-TestGen -- CADS*: Computer-Aided Development of Self-* Systems -- HAVE: Detecting Atomicity Violations via Integrated Dynamic and Static Analysis -- Accurate and Efficient Structural Characteristic Feature Extraction for Clone Detection -- Enhanced Property Specification and Verification in BLAST -- Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. |
Record Nr. | UNISA-996466031203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Fundamental approaches to software engineering : 12th International Conference, FASE 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings / / Marsha Chechik, Martin Wirsing (Eds.) |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer, c2009 |
Descrizione fisica | 1 online resource (XIII, 488 p.) |
Disciplina | 005.1 |
Altri autori (Persone) |
ChechikMarsha
WirsingM (Martin) |
Collana | Lecture notes in computer science |
Soggetto topico |
Software engineering
Software architecture |
ISBN | 3-642-00593-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Scalable Analysis of Scalable Systems -- Scalable Analysis of Scalable Systems -- Model-Driven Development -- Rewriting Logic Semantics and Verification of Model Transformations -- Confluence in Domain-Independent Product Line Transformations -- Object Flow Definition for Refined Activity Diagrams -- A Category-Theoretical Approach to the Formalisation of Version Control in MDE -- Synthesis and Adaptation -- Controller Synthesis from LSC Requirements -- Interface Generation and Compositional Verification in JavaPathfinder -- A Formal Way from Text to Code Templates -- Context-Aware Adaptive Services: The PLASTIC Approach -- Modeling -- Synchronous Modeling and Validation of Priority Inheritance Schedulers -- Describing and Analyzing Behaviours over Tabular Specifications Using (Dyn)Alloy -- Testing and Debugging -- Reducing the Costs of Bounded-Exhaustive Testing -- Logical Testing -- Cross-Entropy-Based Replay of Concurrent Programs -- Model Analysis -- Control Dependence for Extended Finite State Machines -- Proving Consistency of Pure Methods and Model Fields -- On the Implementation of @pre -- Formal Specification and Analysis of Timing Properties in Software Systems -- Patterns -- Formal Foundation for Pattern-Based Modelling -- Problem-Oriented Documentation of Design Patterns -- Security -- Certification of Smart-Card Applications in Common Criteria -- Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks -- A Formal Connection between Security Automata and JML Annotations -- Queries and Error Handling -- Algorithms for Automatically Computing the Causal Paths of Failures -- Mining API Error-Handling Specifications from Source Code -- SNIFF: A Search Engine for Java Using Free-Form Queries -- Inquiry and Introspection for Non-deterministic Queries in Mobile Networks -- Tools (Demos) and Program Analysis -- hol-TestGen -- CADS*: Computer-Aided Development of Self-* Systems -- HAVE: Detecting Atomicity Violations via Integrated Dynamic and Static Analysis -- Accurate and Efficient Structural Characteristic Feature Extraction for Clone Detection -- Enhanced Property Specification and Verification in BLAST -- Finding Loop Invariants for Programs over Arrays Using a Theorem Prover. |
Altri titoli varianti | FASE 2009 |
Record Nr. | UNINA-9910483792503321 |
Berlin ; ; Heidelberg, : Springer, c2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings / / edited by Marsha Chechik, Jean-François Raskin |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XIX, 961 p. 220 illus.) |
Disciplina | 004.21 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Software Engineering Theory of Computation |
ISBN | 3-662-49674-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Robots at the Edge of the Cloud -- Finding Recurrent Sets with Backward Analysis and Trace Partitioning -- Tactics for the Dafny Program Verifier -- Synthesizing Ranking Functions from Bits and Pieces -- Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems -- Probabilistic and Stochastic Systems Efficient Syntax-driven Lumping of Differential Equations -- Faster Statistical Model Checking for Unbounded Temporal Properties -- Safety-constrained Reinforcement Learning for MDPs -- Safety Verification of Continuous-Space Pure Jump Markov Processes -- Abstract Learning Frameworks for Synthesis -- Synthesizing Piece-wise Functions by Learning Classifiers -- An Automaton Learning Approach to Solving Safety Games over Infinite Graphs -- Uncertainty Propagation using Probabilistic Affine Forms and Concentration of Measure Inequalities -- Online and Compositional Learning of Controllers with Application to Floor Heating -- Deductive Proofs of Almost Sure Persistence and Recurrence Properties -- Probabilistic CTL* : The Deductive Way -- Parametric Runtime Verification of C Programs -- Coqoon: an IDE for interactive proof development in Coq -- Multi-core symbolic bisimulation minimization -- Advances in Symbolic Probabilistic Model Checking with PRISM -- PRISM-PSY: Precise GPU-Accelerated Parameter Synthesis for Stochastic Systems -- T2: Temporal Property Verification -- RTD-Finder: A Tool for Compositional Verification of Real-Time Component-based Systems -- TcT: Tyrolean Complexity Tool -- Integrated Environment for Diagnosing Verification Errors -- JDart: A Dynamic Symbolic Analysis Framework -- Diagnostic Information for Control-Flow Analysis of Workflow Graphs -- Approaching the Coverability Problem Continuously -- On Atomicity in Presence of Non-atomic Writes -- Formalizing and Checking Thread Refinement for Data-Race-Free Execution Models -- The xSAP Safety Analysis Platform -- FACT: A Probabilistic Model Checker for Formal Verification with Confidence Intervals -- PrDK: Protocol Programming with Automata -- DLC: Compiling a Concurrent System Formal Specification to a Distributed Implementation -- PRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games -- Cerberus: Automated Synthesis of Enforcement Mechanisms for Security-sensitive Business Processes -- Developing & Debugging Proof Strategies by Tinkering -- v2c - A Verilog to C Translator Tool -- Parameterized Compositional Model Checking -- An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation -- Interpolants in Nonlinear Theories over the Reals -- PTIME Computation of Transitive Closures of Octagonal Relations -- Verification of Linear Controller Software -- Partial Order Reduction for Event-driven Multi-threaded Programs -- Acceleration in Multi-Pushdown Systems -- Reduction of Nondeterministic Tree Automata -- Online Timed Pattern Matching using Derivatives -- Hybridization based CEGAR for Hybrid Automata with Affine Dynamics -- Complementing Semi-deterministic Buechi Automata -- Reasoning About Information Flow Security of Separation Kernels with Channel-based Communication -- Some Complexity Results for Stateful Network Verification -- Characteristic Formulae for Session Types -- Bit-Vector Optimization -- Runtime Monitoring with Union-Find Structures -- Competition on Software Verification: SV-COMP -- Reliable and Reproducible Competition Results with BenchExec and Witnesses (Report on SV-COMP 2016). |
Record Nr. | UNISA-996465708403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Tools and Algorithms for the Construction and Analysis of Systems : 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings / / edited by Marsha Chechik, Jean-François Raskin |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XIX, 961 p. 220 illus.) |
Disciplina | 004.21 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Compilers (Computer programs) Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Compilers and Interpreters Software Engineering Theory of Computation |
ISBN | 3-662-49674-7 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Robots at the Edge of the Cloud -- Finding Recurrent Sets with Backward Analysis and Trace Partitioning -- Tactics for the Dafny Program Verifier -- Synthesizing Ranking Functions from Bits and Pieces -- Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems -- Probabilistic and Stochastic Systems Efficient Syntax-driven Lumping of Differential Equations -- Faster Statistical Model Checking for Unbounded Temporal Properties -- Safety-constrained Reinforcement Learning for MDPs -- Safety Verification of Continuous-Space Pure Jump Markov Processes -- Abstract Learning Frameworks for Synthesis -- Synthesizing Piece-wise Functions by Learning Classifiers -- An Automaton Learning Approach to Solving Safety Games over Infinite Graphs -- Uncertainty Propagation using Probabilistic Affine Forms and Concentration of Measure Inequalities -- Online and Compositional Learning of Controllers with Application to Floor Heating -- Deductive Proofs of Almost Sure Persistence and Recurrence Properties -- Probabilistic CTL* : The Deductive Way -- Parametric Runtime Verification of C Programs -- Coqoon: an IDE for interactive proof development in Coq -- Multi-core symbolic bisimulation minimization -- Advances in Symbolic Probabilistic Model Checking with PRISM -- PRISM-PSY: Precise GPU-Accelerated Parameter Synthesis for Stochastic Systems -- T2: Temporal Property Verification -- RTD-Finder: A Tool for Compositional Verification of Real-Time Component-based Systems -- TcT: Tyrolean Complexity Tool -- Integrated Environment for Diagnosing Verification Errors -- JDart: A Dynamic Symbolic Analysis Framework -- Diagnostic Information for Control-Flow Analysis of Workflow Graphs -- Approaching the Coverability Problem Continuously -- On Atomicity in Presence of Non-atomic Writes -- Formalizing and Checking Thread Refinement for Data-Race-Free Execution Models -- The xSAP Safety Analysis Platform -- FACT: A Probabilistic Model Checker for Formal Verification with Confidence Intervals -- PrDK: Protocol Programming with Automata -- DLC: Compiling a Concurrent System Formal Specification to a Distributed Implementation -- PRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games -- Cerberus: Automated Synthesis of Enforcement Mechanisms for Security-sensitive Business Processes -- Developing & Debugging Proof Strategies by Tinkering -- v2c - A Verilog to C Translator Tool -- Parameterized Compositional Model Checking -- An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation -- Interpolants in Nonlinear Theories over the Reals -- PTIME Computation of Transitive Closures of Octagonal Relations -- Verification of Linear Controller Software -- Partial Order Reduction for Event-driven Multi-threaded Programs -- Acceleration in Multi-Pushdown Systems -- Reduction of Nondeterministic Tree Automata -- Online Timed Pattern Matching using Derivatives -- Hybridization based CEGAR for Hybrid Automata with Affine Dynamics -- Complementing Semi-deterministic Buechi Automata -- Reasoning About Information Flow Security of Separation Kernels with Channel-based Communication -- Some Complexity Results for Stateful Network Verification -- Characteristic Formulae for Session Types -- Bit-Vector Optimization -- Runtime Monitoring with Union-Find Structures -- Competition on Software Verification: SV-COMP -- Reliable and Reproducible Competition Results with BenchExec and Witnesses (Report on SV-COMP 2016). |
Record Nr. | UNINA-9910484587903321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Verified Software. Theories, Tools, and Experiments [[electronic resource] ] : 8th International Conference, VSTTE 2016, Toronto, ON, Canada, July 17–18, 2016, Revised Selected Papers / / edited by Sandrine Blazy, Marsha Chechik |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XIV, 199 p. 36 illus.) |
Disciplina | 005.14 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Computer logic Programming languages (Electronic computers) Computer programming Mathematical logic Artificial intelligence Software Engineering Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-319-48869-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Education -- requirements modeling -- specification languages -- specification/verification -- formal calculi -- software design methods -- automatic code generation -- refinement methodologies -- compositional analysis -- verification tools -- Tool integration -- Benchmarks -- Challenge problems -- Integrated verification environments. . |
Record Nr. | UNISA-996465619903316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Verified Software. Theories, Tools, and Experiments : 8th International Conference, VSTTE 2016, Toronto, ON, Canada, July 17–18, 2016, Revised Selected Papers / / edited by Sandrine Blazy, Marsha Chechik |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XIV, 199 p. 36 illus.) |
Disciplina | 005.14 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Computer logic Programming languages (Electronic computers) Computer programming Mathematical logic Artificial intelligence Software Engineering Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-319-48869-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Education -- requirements modeling -- specification languages -- specification/verification -- formal calculi -- software design methods -- automatic code generation -- refinement methodologies -- compositional analysis -- verification tools -- Tool integration -- Benchmarks -- Challenge problems -- Integrated verification environments. . |
Record Nr. | UNINA-9910484808703321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|