Symbolic Reachability Analysis of B Through ProB and LTSmin

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-33693-0_18
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Achieving Speedups in Distributed Symbolic Reachability Analysis Through Asynchronous Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Reachability Analysis of Communicating Pushdown Systems

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Reachability Analysis on Distributed Executions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Forensic Analysis of Autonomous System Reachability

2006English

Optimal Dyck Reachability for Data-Dependence and Alias Analysis

Proceedings of the ACM on Programming Languages
2018English

Reachability Analysis of Hybrid Systems via Predicate Abstraction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Exploiting Reachability and Cardinality in Higher-Order Flow Analysis

Journal of Functional Programming
Software
2008English

Generalized Fair Reachability Analysis for Cyclic Protocols

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
1996English

Symbolic Signal Processing and System Analysis

Facta universitatis - series: Electronics and Energetics
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy