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...

Fuld beskrivelse

Bibliografiske detaljer
Main Authors:	Antonino, P, Gibson-Robinson, T, Roscoe, A
Format:	Journal article
Udgivet:	Springer 2019

Lignende værker

Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
af: Antonino, P, et al.
Udgivet: (2019)

Efficient deadlock freedom checking using local analysis and SAT checking
af: Antonio, P, et al.
Udgivet: (2016)

The automatic detection of token structures and invariants using SAT checking
af: Antonino, P, et al.
Udgivet: (2017)

SAT solving in CSP trace refinement
af: Palikareva, H, et al.
Udgivet: (2012)

SAT−solving in CSP trace refinement
af: Palikareva, H, et al.
Udgivet: (2011)

SAT-solving in CSP trace refinement
af: Palikareva, H, et al.
Udgivet: (2012)

SAT−Solving in CSP Trace Refinement
af: Palikareva, H, et al.
Udgivet: (2012)

Faster FDR Counterexample Generation Using SAT−Solving
af: Palikareva, H, et al.
Udgivet: (2009)

ExpliSAT: Guiding SAT−Based Software Verification with Explicit States
af: Barner, S, et al.
Udgivet: (2007)

Approximating Succinct MaxSat.
af: Schallhart, C, et al.
Udgivet: (2005)

Construction and SAT−based verification of Contextual Unfoldings
af: Schwoon, S, et al.
Udgivet: (2011)

SAT-based scalable formal verification solutions /
af: 262924 Ganai, Malay, et al.
Udgivet: (2007)

Efficient Method to Approximately Solve Retrial Systems with Impatience
af: Jose Manuel Gimenez-Guzman, et al.
Udgivet: (2012-01-01)

Back to Basics: Solving Games with SAT
af: QUER, S.
Udgivet: (2016-08-01)

Logic for fun : solving puzzles with SAT solvers
af: Foo, Zhong Xian
Udgivet: (2016)

An Approximate Method for Solving Optimal Control Problems for Discrete Systems Based on Local Approximation of an Attainability Set
af: V. A. Baturin
Udgivet: (2017-03-01)

Thermal Design and Verification of Spherical Scientific Satellite Q-SAT
af: Yunhan He, et al.
Udgivet: (2021-01-01)

SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits
af: Huiyu Tan, et al.
Udgivet: (2024-09-01)

SAT and SMT-Based Verification of Security Protocols Including Time Aspects
af: Sabina Szymoniak, et al.
Udgivet: (2021-04-01)

Local Consistency and SAT−Solvers
af: Jeavons, P, et al.
Udgivet: (2012)

Local Consistency and SAT-Solvers
af: Petke, J, et al.
Udgivet: (2010)

Local consistency and SAT−solvers
af: Jeavons, P, et al.
Udgivet: (2010)

Local consistency and SAT−solvers
af: Jeavons, P, et al.
Udgivet: (2012)

Local Consistency and SAT-Solvers
af: Jeavons, P, et al.
Udgivet: (2012)

Efficient CTL Verification via Horn Constraints Solving
af: Tewodros A. Beyene, et al.
Udgivet: (2016-07-01)

Selection of search strategies for solving 3-SAT problems
af: Pułka Andrzej
Udgivet: (2014-06-01)

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving
af: Robert Nieuwenhuis, et al.
Udgivet: (2021-01-01)

Investigation of a CubeSat in Orbit Anomaly through Verification on Ground
af: Fabrizio Stesina, et al.
Udgivet: (2020-04-01)

Local multiquadric approximation for solving boundary value problems
af: Lee, Chi King, et al.
Udgivet: (2014)

Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
af: Yunlong Yu, et al.
Udgivet: (2023-06-01)

Error metrics determination in functionally approximated circuits using SAT solvers.
af: Sa'ed Abed, et al.
Udgivet: (2020-01-01)

Resolvable Networks—A Graphical Tool for Representing and Solving SAT
af: Gábor Kusper, et al.
Udgivet: (2021-10-01)

Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS
af: Xiaojuan Liao, et al.
Udgivet: (2023-08-01)

Occam in the specification and verification of microprocessors
af: Roscoe, A
Udgivet: (1992)

The automated verification of timewise refinement
af: Roscoe, A
Udgivet: (2013)

Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules
af: Xiaoming Wan, et al.
Udgivet: (2023-01-01)

Verifying concurrent systems by approximation
af: Antonino, P
Udgivet: (2018)

Efficiency analysis of SAT solvers in logic locking applications
af: Liu, Zhiyuan
Udgivet: (2024)

Distributed verification and hardness of distributed approximation
af: Sarma, Atish Das., et al.
Udgivet: (2013)

FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA
af: Young-Kyu Choi, et al.
Udgivet: (2024-01-01)