scholarly journals A Widening Approach to Multithreaded Program Verification

2014 ◽  
Vol 36 (4) ◽  
pp. 1-29 ◽  
Author(s):  
Alexander Kaiser ◽  
Daniel Kroening ◽  
Thomas Wahl
Keyword(s):  
Program Verification ◽  
Multithreaded Program

scholarly journals An SAT-Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Long Zhang ◽  
Wanxia Qu ◽  
Yinjia Huo ◽  
Yang Guo ◽  
Sikun Li
Keyword(s):  
Model Checking ◽  
Program Verification ◽  
Safety Properties ◽  
Memory Consumption ◽  
Mobile Crowdsourcing ◽  
Multithreaded Programs ◽  
Finite State Model ◽  
Finite State ◽  
Multithreaded Program ◽  
Novel Algorithm

This paper focused on the safety verification of the multithreaded programs for mobile crowdsourcing networks. A novel algorithm was proposed to find a way to apply IC3, which is typically the fastest algorithm for SAT-based finite state model checking, in a very clever manner to solve the safety problem of multithreaded programs. By computing a series of overapproximation reachability, the safety properties can be verified by the SAT-based model checking algorithms. The results show that the new algorithm outperforms all the recently published works, especially on memory consumption (an advantage that comes from IC3).

scholarly journals Program verification using templates over predicate abstraction

2009 ◽  
Vol 44 (6) ◽  
pp. 223-234 ◽  
Author(s):  
Saurabh Srivastava ◽  
Sumit Gulwani
Keyword(s):  
Program Verification ◽  
Predicate Abstraction

Higher-order multi-parameter tree transducers and recursion schemes for program verification

2010 ◽  
Vol 45 (1) ◽  
pp. 495-508 ◽  
Author(s):  
Naoki Kobayashi ◽  
Naoshi Tabuchi ◽  
Hiroshi Unno
Keyword(s):  
Program Verification ◽  
Higher Order ◽  
Tree Transducers

Implementing and using finite automata toolkits

1996 ◽  
Vol 2 (4) ◽  
pp. 295-302 ◽  
Author(s):  
BRUCE W. WATSON
Keyword(s):  
Flight Control ◽  
Program Verification ◽  
Finite Automata ◽  
Circuit Simulation ◽  
Implementation Strategies ◽  
Digital Circuit ◽  
General Purpose ◽  
Genetic Sequencing ◽  
Java Program ◽  
Fire Engine

Finite automata and various extensions of them, such as transducers, are used in areas as diverse as compilers, spelling checking, natural language grammar checking, communication protocol design, digital circuit simulation, digital flight control, speech recognition and synthesis, genetic sequencing, and Java program verification. Unfortunately, as the number of applications has grown, so has the variety of implementations and implementation techniques. Typically, programmers will be confused enough to resort to their text books for the most elementary algorithms. Recently, advances have been made in taxonomizing algorithms for constructing and minimizing automata and in evaluating various implementation strategies Watson 1995. Armed with this, a number of general-purpose toolkits have been developed at universities and companies. One of these, FIRE Lite, was developed at the Eindhoven University of Technology, while its commercial successor, FIRE Engine II, has been developed at Ribbit Software Systems Inc. Both of these toolkits provide implementations of all of the known algorithms for constructing automata from regular expressions, and all of the known algorithms for minimizing deterministic finite automata. While the two toolkits have a great deal in common, we will concentrate on the structure and use of the noncommercial FIRE Lite. The prototype version of FIRE Lite was designed with compilers in mind. More recently, computation linguists and communications protocol designers have become interested in using the toolkit. This has led to the development of a much more general interface to FIRE Lite, including the support of both Mealy and Moore regular transducers. While such a toolkit may appear extremely complex, there are only a few choices to be made. We also consider a ‘recipe’ for making good use of the toolkits. Lastly, we consider the future of FIRE Lite. While FIRE Engine II has obvious commercial value, we are committed to maintaining a version which is freely available for academic use.

scholarly journals Introduction to the special issue on computational logic for verification

2018 ◽  
Vol 18 (2) ◽  
pp. 122-125
Author(s):  
GERMÁN VIDAL
Keyword(s):  
Computer Science ◽  
Program Verification ◽  
Computational Logic ◽  
Special Issue

Logic underlies many fundamental techniques in computer science. It helps us to rigorously formalize these techniques and prove them correct. The last decade has witnessed a growing interest in the use of computational logic methods for program verification. It has attracted researchers from both computational logic and program verification communities, giving rise to a fruitful exchange of ideas and experiences.

Sign in / Sign up

Export Citation Format

Share Document