Efficient verification of comcurrent systems using local analysis based approximations and SAT solving

Efficient verification of comcurrent systems using local analysis based approximations and SAT solving

This work develops a type of local analysis that can prove concurrent systems deadlock free. As opposed to examining the overall behaviour of a system, local analysis consists of examining the behaviour of small parts of the system to yield a given property. We analyse pairs of interacting component...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς:	Antonino, P, Gibson-Robinson, T, Roscoe, A
Μορφή:	Journal article
Έκδοση:	Springer 2019

Παρόμοια τεκμήρια

Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
ανά: Antonino, P, κ.ά.
Έκδοση: (2019)

Efficient deadlock freedom checking using local analysis and SAT checking
ανά: Antonio, P, κ.ά.
Έκδοση: (2016)

The automatic detection of token structures and invariants using SAT checking
ανά: Antonino, P, κ.ά.
Έκδοση: (2017)

SAT solving in CSP trace refinement
ανά: Palikareva, H, κ.ά.
Έκδοση: (2012)

SAT−solving in CSP trace refinement
ανά: Palikareva, H, κ.ά.
Έκδοση: (2011)

SAT-solving in CSP trace refinement
ανά: Palikareva, H, κ.ά.
Έκδοση: (2012)

SAT−Solving in CSP Trace Refinement
ανά: Palikareva, H, κ.ά.
Έκδοση: (2012)

Faster FDR Counterexample Generation Using SAT−Solving
ανά: Palikareva, H, κ.ά.
Έκδοση: (2009)

ExpliSAT: Guiding SAT−Based Software Verification with Explicit States
ανά: Barner, S, κ.ά.
Έκδοση: (2007)

Approximating Succinct MaxSat.
ανά: Schallhart, C, κ.ά.
Έκδοση: (2005)

Construction and SAT−based verification of Contextual Unfoldings
ανά: Schwoon, S, κ.ά.
Έκδοση: (2011)

SAT-based scalable formal verification solutions /
ανά: 262924 Ganai, Malay, κ.ά.
Έκδοση: (2007)

Efficient Method to Approximately Solve Retrial Systems with Impatience
ανά: Jose Manuel Gimenez-Guzman, κ.ά.
Έκδοση: (2012-01-01)

Back to Basics: Solving Games with SAT
ανά: QUER, S.
Έκδοση: (2016-08-01)

Logic for fun : solving puzzles with SAT solvers
ανά: Foo, Zhong Xian
Έκδοση: (2016)

An Approximate Method for Solving Optimal Control Problems for Discrete Systems Based on Local Approximation of an Attainability Set
ανά: V. A. Baturin
Έκδοση: (2017-03-01)

Thermal Design and Verification of Spherical Scientific Satellite Q-SAT
ανά: Yunhan He, κ.ά.
Έκδοση: (2021-01-01)

SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits
ανά: Huiyu Tan, κ.ά.
Έκδοση: (2024-09-01)

SAT and SMT-Based Verification of Security Protocols Including Time Aspects
ανά: Sabina Szymoniak, κ.ά.
Έκδοση: (2021-04-01)

Local Consistency and SAT−Solvers
ανά: Jeavons, P, κ.ά.
Έκδοση: (2012)

Local Consistency and SAT-Solvers
ανά: Petke, J, κ.ά.
Έκδοση: (2010)

Local consistency and SAT−solvers
ανά: Jeavons, P, κ.ά.
Έκδοση: (2010)

Local consistency and SAT−solvers
ανά: Jeavons, P, κ.ά.
Έκδοση: (2012)

Local Consistency and SAT-Solvers
ανά: Jeavons, P, κ.ά.
Έκδοση: (2012)

Efficient CTL Verification via Horn Constraints Solving
ανά: Tewodros A. Beyene, κ.ά.
Έκδοση: (2016-07-01)

Selection of search strategies for solving 3-SAT problems
ανά: Pułka Andrzej
Έκδοση: (2014-06-01)

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving
ανά: Robert Nieuwenhuis, κ.ά.
Έκδοση: (2021-01-01)

Investigation of a CubeSat in Orbit Anomaly through Verification on Ground
ανά: Fabrizio Stesina, κ.ά.
Έκδοση: (2020-04-01)

Local multiquadric approximation for solving boundary value problems
ανά: Lee, Chi King, κ.ά.
Έκδοση: (2014)

Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
ανά: Yunlong Yu, κ.ά.
Έκδοση: (2023-06-01)

Error metrics determination in functionally approximated circuits using SAT solvers.
ανά: Sa'ed Abed, κ.ά.
Έκδοση: (2020-01-01)

Resolvable Networks—A Graphical Tool for Representing and Solving SAT
ανά: Gábor Kusper, κ.ά.
Έκδοση: (2021-10-01)

Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS
ανά: Xiaojuan Liao, κ.ά.
Έκδοση: (2023-08-01)

Occam in the specification and verification of microprocessors
ανά: Roscoe, A
Έκδοση: (1992)

The automated verification of timewise refinement
ανά: Roscoe, A
Έκδοση: (2013)

Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules
ανά: Xiaoming Wan, κ.ά.
Έκδοση: (2023-01-01)

Verifying concurrent systems by approximation
ανά: Antonino, P
Έκδοση: (2018)

Efficiency analysis of SAT solvers in logic locking applications
ανά: Liu, Zhiyuan
Έκδοση: (2024)

Distributed verification and hardness of distributed approximation
ανά: Sarma, Atish Das., κ.ά.
Έκδοση: (2013)

FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA
ανά: Young-Kyu Choi, κ.ά.
Έκδοση: (2024-01-01)