Results 1  10
of
150,749
On the Halting Problem of FiniteState Programs ⋆
"... Abstract. The undecidability of the halting problem is a wellknown research result of theoretical computer science, dating back to Turing’s work in 1936. Nevertheless, it is commonly known that the halting problem on finitestate computer systems is decidable. Thus, any undecidability proof given f ..."
Abstract
 Add to MetaCart
for the halting problem must imply that it does not apply to finitestate computer systems. The aim of this paper is to deepen the understanding of why the undecidability proofs of the halting problem cannot be instantiated as finitestate programs. To bridge the gap between theory and practice, the arguments
Deciding Bisimulation Equivalences for a Class of NonFiniteState Programs
, 1991
"... Traditionally, many automatic program verification techniques are applicable only to finitestate programs. In this paper we extend some of these techniques to a class of infinitestate programs that, in addition to having a finitestate control component, may read, store, and write but not perfo ..."
Abstract

Cited by 44 (10 self)
 Add to MetaCart
Traditionally, many automatic program verification techniques are applicable only to finitestate programs. In this paper we extend some of these techniques to a class of infinitestate programs that, in addition to having a finitestate control component, may read, store, and write
Kleene, a Free and OpenSource Language for FiniteState Programming
"... Kleene is a highlevel programming language, based on the OpenFst library, for constructing and manipulating finitestate acceptors and transducers. Users can program using regular expressions, alternationrule syntax and rightlinear phrasestructure grammars; and Kleene provides variables, lists, ..."
Abstract
 Add to MetaCart
Kleene is a highlevel programming language, based on the OpenFst library, for constructing and manipulating finitestate acceptors and transducers. Users can program using regular expressions, alternationrule syntax and rightlinear phrasestructure grammars; and Kleene provides variables, lists
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 654 (33 self)
 Add to MetaCart
), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms). In this paper, we describe an integrated collection of program analysis and transformation components, called Bandera, that enables the automatic extraction of safe, compact finitestate models from
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
FiniteState Transducers in Language and Speech Processing
 Computational Linguistics
, 1997
"... Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential stringtostring transducer ..."
Abstract

Cited by 392 (42 self)
 Add to MetaCart
Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string
Direct Model Checking of Temporal Properties
"... In this paper, we address the problem of model checking temporal properties of finitestate programs. This problem
..."
Abstract
 Add to MetaCart
In this paper, we address the problem of model checking temporal properties of finitestate programs. This problem
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
Principles and methods of Testing Finite State Machines  a survey
 PROCEEDINGS OF IEEE
, 1996
"... With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This moti ..."
Abstract

Cited by 345 (16 self)
 Add to MetaCart
. This motivates the study of testing finite state machines to ensure the correct functioning of systems and to discover aspects of their behavior. A finite state machine contains a finite number of states and produces outputs on state transitions after receiving inputs. Finite state machines are widely used
Model Checking Java Programs Using Java PathFinder
, 1998
"... . This paper describes a translator called Java PathFinder (Jpf), from Java to Promela, the modeling language of the Spin model checker. Jpf translates a given Java program into a Promela model, which then can be model checked using Spin. The Java program may contain assertions, which are translated ..."
Abstract

Cited by 386 (32 self)
 Add to MetaCart
are translated to similar assertions in the Promela model. The Spin model checker will then look for deadlocks and violations of any stated assertions. Jpf generates a Promela model with the same state space characteristics as the Java program. Hence, the Java program must have a finite and tractable state space
Results 1  10
of
150,749