Proof Strategy for Automated Sisal Program Verification

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.

Download Full-text

Lattice-based SMT for program verification

Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design - MEMOCODE '19 ◽

10.1145/3359986.3361214 ◽

2019 ◽

Author(s):

Karine Even-Mendoza ◽

Antti E. J. Hyvärinen ◽

Hana Chockler ◽

Natasha Sharygina

Keyword(s):

Program Verification

Download Full-text

Introduction to the special issue on computational logic for verification

Theory and Practice of Logic Programming ◽

10.1017/s1471068418000029 ◽

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.

Download Full-text

A case for teaching program verification

Proceedings of the fourteenth SIGCSE technical symposium on Computer science education - SIGCSE '83 ◽

10.1145/800038.801003 ◽

1983 ◽

Author(s):

Ali Mili

Keyword(s):

Program Verification ◽

Teaching Program

Download Full-text