Static driver verifier, a formal verification tool for windows device drivers

2005 ◽  
Author(s):  
V. Levin
Keyword(s):  
Formal Verification ◽  
Device Drivers ◽  
Verification Tool

An Open-Bisimilarity Based Automated Verification Tool for -Calculus Family of Process Calculi

2012 ◽  
Vol 4 (1) ◽  
pp. 55-83
Author(s):  
Shahram Rahimi ◽  
Rishath A. S. Rias ◽  
Elham S. Khorasani
Keyword(s):  
Expert System ◽  
Formal Verification ◽  
Interactive Systems ◽  
Automated Verification ◽  
Efficient System ◽  
Verification Tool ◽  
Verification Methods ◽  
System Verification ◽  
And Performance ◽  
The Right

The complexity of designing concurrent and highly-evolving interactive systems has grown to a point where system verification has become a hurdle. Fortunately, formal verification methods have arrived at the right time. They detect errors, inconsistencies and incompleteness at early development stages of a system formally modeled using a formal specification language. -calculus (Milner, 1999) is one such formal language which provides strong mathematical base that can be used for verifying system specifications. But manually verifying the specifications of concurrent systems is a very tedious and error-prone work, especially if the specifications are large. Consequently, an automated verification tool would be essential for efficient system design and development. In addition, formal verification tools are vital ingredient to fully harness the potential of component-based software composition. The authors developed such an automated verification tool which is highly portable and seamlessly integrates with the visualization, reduction and performance evaluation tools introduced (Ahmad & Rahimi, 2008; Rahimi, 2006; Rahimi et al., 2001, 2008) to provide a comprehensive tool for designing and analyzing multi process/agent systems. Open-Bisimulation (Sangiorgi, 1996) concept is utilized as the theoretical base for the design and implementation of the tool which incorporates an expert system implemented in Java Expert System Shell (JESS) (Friedman-Hill, 2003).

Formal Verification of Secrecy, Coercion Resistance and Verifiability Properties for a Remote Electronic Voting Protocol

2013 ◽  
Vol 7 (2) ◽  
pp. 57-85
Author(s):  
Khaoula Marzouki ◽  
Amira Radhouani ◽  
Narjes Ben Rajeb
Keyword(s):  
Formal Verification ◽  
Electronic Voting ◽  
Automated Verification ◽  
Verification Tool ◽  
Verification Methods ◽  
Pi Calculus ◽  
Security Properties

Electronic voting protocols have many advantages over traditional voting but they are complex and subject to many kinds of attacks. Therefore, the use of formal verification methods is crucial to ensure some security properties. We propose to model a recent protocol of remote electronic voting in the applied Pi-calculus. We focalized on some security properties such as fairness which expresses the impossibility of obtaining partial results, eligibility which requires that only legitimate voters can vote, coercion resistance which ensures that no voter may vote under pressure, and verifiability which supposes that anyone can verify the accuracy of the final result. We proved either manually or using the automated verification tool ProVerif that the protocol satisfies these security properties.

A Formal Verification Tool for UML Behavioral Diagrams

2014 ◽  
pp. 696-711 ◽  
Author(s):  
Luciana Brasil Rebelo dos Santos ◽  
Eduardo Rohde Eras ◽  
Valdivino Alexandre de Santiago Júnior ◽  
Nandamudi Lankalapalli Vijaykumar
Keyword(s):  
Formal Verification ◽  
Verification Tool

scholarly journals Dunuen: A User-Friendly Formal Verification Tool

2019 ◽  
Vol 159 ◽  
pp. 1431-1438
Author(s):  
Giovanni Capobianco ◽  
Umberto Di Giacomo ◽  
Francesco Mercaldo ◽  
Antonella Santone
Keyword(s):  
Formal Verification ◽  
Verification Tool ◽  
User Friendly

Formal Verification Tool Evaluation For Unmanned Aircraft Containing Complex Functions

2020 ◽  
Author(s):  
Heber Herencia-Zapana ◽  
James Lopez ◽  
Glen Gallagher ◽  
Baoluo Meng ◽  
Cameron Patterson ◽  
...  
Keyword(s):  
Formal Verification ◽  
Unmanned Aircraft ◽  
Tool Evaluation ◽  
Verification Tool ◽  
Complex Functions

Hamilton–Jacobi Reachability: Some Recent Theoretical Advances and Applications in Unmanned Airspace Management

2018 ◽  
Vol 1 (1) ◽  
pp. 333-358 ◽  
Author(s):  
Mo Chen ◽  
Claire J. Tomlin
Keyword(s):  
Nonlinear Systems ◽  
Everyday Life ◽  
Formal Verification ◽  
Autonomous Systems ◽  
High Dimensional ◽  
System Decomposition ◽  
Computational Burden ◽  
Safety Critical ◽  
Verification Tool ◽  
Difficult Challenge

Autonomous systems are becoming pervasive in everyday life, and many of these systems are complex and safety-critical. Formal verification is important for providing performance and safety guarantees for these systems. In particular, Hamilton–Jacobi (HJ) reachability is a formal verification tool for nonlinear and hybrid systems; however, it is computationally intractable for analyzing complex systems, and computational burden is in general a difficult challenge in formal verification. In this review, we begin by briefly presenting background on reachability analysis with an emphasis on the HJ formulation. We then present recent work showing how high-dimensional reachability verification can be made more tractable by focusing on two areas of development: system decomposition for general nonlinear systems, and traffic protocols for unmanned airspace management. By tackling the curse of dimensionality, tractable verification of practical systems is becoming a reality, paving the way for more pervasive and safer automation.

Sign in / Sign up

Export Citation Format

Share Document