Linked e-resources
Details
Table of Contents
Dependable Cyber-Physical Systems
From Finitely Many Simulations to Flowpipes
Toward Automatic Verification of Quantum Programs
Place Bisimulation and Liveness for Open Petri Nets
Divergence Detection for CCSL Specification via Clock Causality Chain
Performance Evaluation on Modern Concurrent Data Structures
GPU-accelerated Steady-state Computation of Large Probabilistic Boolean Networks
Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques
Computing Specification-Sensitive Abstractions for Program Verification
Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models
Identifying XML Schema Constraints Using Temporal Logic
Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET
Importance Sampling for Stochastic Timed Automata
Semipositivity in Separation Logic with Two Variables
Distributed Computation of Fixed Points on Dependency Graphs
A Complete Approximation Theory for Weighted Transition Systems
Zephyrus2: On the Fly Deployment Optimization Using SMT and CP Technologies
Exploiting Symmetry for Efficient Verification of Infinite-state Component-based Systems
Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties
Time-bounded Statistical Analysis of Resource-constrained Business Processes with Distributed Probabilistic Systems
Failure Estimation of Behavioral Specifications. .
From Finitely Many Simulations to Flowpipes
Toward Automatic Verification of Quantum Programs
Place Bisimulation and Liveness for Open Petri Nets
Divergence Detection for CCSL Specification via Clock Causality Chain
Performance Evaluation on Modern Concurrent Data Structures
GPU-accelerated Steady-state Computation of Large Probabilistic Boolean Networks
Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques
Computing Specification-Sensitive Abstractions for Program Verification
Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models
Identifying XML Schema Constraints Using Temporal Logic
Schedulability Analysis of Timed Regular Tasks by Under-Approximation on WCET
Importance Sampling for Stochastic Timed Automata
Semipositivity in Separation Logic with Two Variables
Distributed Computation of Fixed Points on Dependency Graphs
A Complete Approximation Theory for Weighted Transition Systems
Zephyrus2: On the Fly Deployment Optimization Using SMT and CP Technologies
Exploiting Symmetry for Efficient Verification of Infinite-state Component-based Systems
Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach
An Efficient Synthesis Algorithm for Parametric Markov Chains Against Linear Time Properties
Time-bounded Statistical Analysis of Resource-constrained Business Processes with Distributed Probabilistic Systems
Failure Estimation of Behavioral Specifications. .