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

Bibliografski detalji
Glavni autori:	Antonino, P, Gibson-Robinson, T, Roscoe, A
Format:	Journal article
Izdano:	Springer 2019

Slični predmeti

Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
od: Antonino, P, i dr.
Izdano: (2019)

Efficient deadlock freedom checking using local analysis and SAT checking
od: Antonio, P, i dr.
Izdano: (2016)

The automatic detection of token structures and invariants using SAT checking
od: Antonino, P, i dr.
Izdano: (2017)

SAT solving in CSP trace refinement
od: Palikareva, H, i dr.
Izdano: (2012)

SAT−solving in CSP trace refinement
od: Palikareva, H, i dr.
Izdano: (2011)

SAT-solving in CSP trace refinement
od: Palikareva, H, i dr.
Izdano: (2012)

SAT−Solving in CSP Trace Refinement
od: Palikareva, H, i dr.
Izdano: (2012)

Faster FDR Counterexample Generation Using SAT−Solving
od: Palikareva, H, i dr.
Izdano: (2009)

ExpliSAT: Guiding SAT−Based Software Verification with Explicit States
od: Barner, S, i dr.
Izdano: (2007)

Approximating Succinct MaxSat.
od: Schallhart, C, i dr.
Izdano: (2005)

Construction and SAT−based verification of Contextual Unfoldings
od: Schwoon, S, i dr.
Izdano: (2011)

SAT-based scalable formal verification solutions /
od: 262924 Ganai, Malay, i dr.
Izdano: (2007)

Efficient Method to Approximately Solve Retrial Systems with Impatience
od: Jose Manuel Gimenez-Guzman, i dr.
Izdano: (2012-01-01)

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

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

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

Thermal Design and Verification of Spherical Scientific Satellite Q-SAT
od: Yunhan He, i dr.
Izdano: (2021-01-01)

SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits
od: Huiyu Tan, i dr.
Izdano: (2024-09-01)

SAT and SMT-Based Verification of Security Protocols Including Time Aspects
od: Sabina Szymoniak, i dr.
Izdano: (2021-04-01)

Local Consistency and SAT−Solvers
od: Jeavons, P, i dr.
Izdano: (2012)

Local Consistency and SAT-Solvers
od: Petke, J, i dr.
Izdano: (2010)

Local consistency and SAT−solvers
od: Jeavons, P, i dr.
Izdano: (2010)

Local consistency and SAT−solvers
od: Jeavons, P, i dr.
Izdano: (2012)

Local Consistency and SAT-Solvers
od: Jeavons, P, i dr.
Izdano: (2012)

Efficient CTL Verification via Horn Constraints Solving
od: Tewodros A. Beyene, i dr.
Izdano: (2016-07-01)

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

Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving
od: Robert Nieuwenhuis, i dr.
Izdano: (2021-01-01)

Investigation of a CubeSat in Orbit Anomaly through Verification on Ground
od: Fabrizio Stesina, i dr.
Izdano: (2020-04-01)

Local multiquadric approximation for solving boundary value problems
od: Lee, Chi King, i dr.
Izdano: (2014)

Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
od: Yunlong Yu, i dr.
Izdano: (2023-06-01)

Error metrics determination in functionally approximated circuits using SAT solvers.
od: Sa'ed Abed, i dr.
Izdano: (2020-01-01)

Resolvable Networks—A Graphical Tool for Representing and Solving SAT
od: Gábor Kusper, i dr.
Izdano: (2021-10-01)

Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS
od: Xiaojuan Liao, i dr.
Izdano: (2023-08-01)

Occam in the specification and verification of microprocessors
od: Roscoe, A
Izdano: (1992)

The automated verification of timewise refinement
od: Roscoe, A
Izdano: (2013)

Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules
od: Xiaoming Wan, i dr.
Izdano: (2023-01-01)

Verifying concurrent systems by approximation
od: Antonino, P
Izdano: (2018)

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

Distributed verification and hardness of distributed approximation
od: Sarma, Atish Das., i dr.
Izdano: (2013)

FYalSAT: High-Throughput Stochastic Local Search K-SAT Solver on FPGA
od: Young-Kyu Choi, i dr.
Izdano: (2024-01-01)