Adapting programming languages technologies for finite-state verification

ACM SIGSOFT Software Engineering Notes ◽

10.1145/340855.340885 ◽

2000 ◽

Vol 25 (1) ◽

pp. 46-49

Author(s):

Matthew B. Dwyer ◽

John Hatcliff

Keyword(s):

Programming Languages ◽

Finite State ◽

Finite State Verification

Download Full-text

The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification

Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001 ◽

10.1109/icse.2001.919079 ◽

2005 ◽

Cited By ~ 7

Author(s):

J.M. Cobleigh ◽

L.A. Clarke ◽

L.J. Ostenveil

Keyword(s):

Data Flow ◽

Flow Analysis ◽

Data Flow Analysis ◽

Finite State ◽

The Right ◽

Finite State Verification

Download Full-text

Property specification patterns for finite-state verification

Proceedings of the second workshop on Formal methods in software practice - FMSP '98 ◽

10.1145/298595.298598 ◽

1998 ◽

Cited By ~ 215

Author(s):

Matthew B. Dwyer ◽

George S. Avrunin ◽

James C. Corbett

Keyword(s):

Finite State ◽

Property Specification ◽

Finite State Verification

Download Full-text

Bounds: From Parameterised to Finite-State Verification

2011 Eleventh International Conference on Application of Concurrency to System Design ◽

10.1109/acsd.2011.24 ◽

2011 ◽

Cited By ~ 2

Author(s):

Antti Siirtola

Keyword(s):

Finite State ◽

Finite State Verification

Download Full-text

Patterns in property specifications for finite-state verification

Proceedings of the 21st international conference on Software engineering - ICSE '99 ◽

10.1145/302405.302672 ◽

1999 ◽

Cited By ~ 662

Author(s):

Matthew B. Dwyer ◽

George S. Avrunin ◽

James C. Corbett

Keyword(s):

Finite State ◽

Finite State Verification

Download Full-text

Finite state verification (abstract only)

ACM SIGSOFT Software Engineering Notes ◽

10.1145/347636.348946 ◽

2000 ◽

Vol 25 (5) ◽

pp. 146-146

Author(s):

Lori A. Clarke

Keyword(s):

Finite State ◽

Finite State Verification

Download Full-text

Finite-state verification for high performance computing

Proceedings of the second international workshop on Software engineering for high performance computing system applications - SE-HPCS '05 ◽

10.1145/1145319.1145340 ◽

2005 ◽

Cited By ~ 2

Author(s):

George S. Avrunin ◽

Stephen F. Siegel ◽

Andrew R. Siegel

Keyword(s):

High Performance Computing ◽

High Performance ◽

Finite State ◽

Finite State Verification ◽

Performance Computing

Download Full-text

Finite state verification (abstract only)

Proceedings of the International Symposium on Software Testing and Analysis - ISSTA '00 ◽

10.1145/347324.348946 ◽

2000 ◽

Author(s):

Lori A. Clarke

Keyword(s):

Finite State ◽

Finite State Verification

Download Full-text

THE USE OF FINITE STATE MACHINES IN GRAPHICAL PROGRAMMING LANGUAGES

PROCESSING, TRANSMISSION AND PROTECTION OF INFORMATION IN COMPUTER SYSTEMS ◽

10.31799/978-5-8088-1452-3-2020-1-148-150 ◽

2020 ◽

Author(s):

A. S. Dubrovin ◽

◽

V. N. Elizarov ◽

Keyword(s):

Programming Languages ◽

Finite State Machines ◽

State Machines ◽

Graphical Programming ◽

Finite State

Download Full-text

Finite State Verification of Intelligent Transportation Systems

Journal of Computing in Civil Engineering ◽

10.1061/(asce)0887-3801(2000)14:1(38) ◽

2000 ◽

Vol 14 (1) ◽

pp. 38-50

Author(s):

John W. Baugh ◽

GopalaKrishna Reddy Kakivaya

Keyword(s):

Intelligent Transportation Systems ◽

Intelligent Transportation ◽

Transportation Systems ◽

Finite State ◽

Finite State Verification

Download Full-text

RULE BASED EXPERT SYSTEM SHELLS—NEW SOFTWARE TOOLS FOR PATTERN RECOGNITION?

International Journal of Pattern Recognition and Artificial Intelligence ◽

10.1142/s0218001489000085 ◽

1989 ◽

Vol 03 (01) ◽

pp. 85-102

Author(s):

H. BUNKE ◽

J. DVORAK

Keyword(s):

Pattern Recognition ◽

Expert System ◽

Programming Languages ◽

Graph Matching ◽

Finite State Automata ◽

Rule Based ◽

Finite State ◽

Matching Graph ◽

Procedural Programming ◽

Context Free

In this paper, we discuss how rule based expert system shells can be used in pattern recognition for the implementation of algorithms which are procedurally oriented in their nature rather than rule based, and have traditionally been implemented in procedural programming languages. Particular examples include finite state automata, context free parsing, string matching, graph matching and discrete relaxation.

Download Full-text