Results 1  10
of
417,307
When ModelChecking Freeze LTL over Counter Machines Becomes Decidable
, 2010
"... We study the decidability status of modelchecking freeze LTL over various subclasses of counter machines for which the reachability problem is known to be decidable (reversalbounded counter machines, vector additions systems with states, flat counter machines, onecounter machines). In freeze LTL, ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We study the decidability status of modelchecking freeze LTL over various subclasses of counter machines for which the reachability problem is known to be decidable (reversalbounded counter machines, vector additions systems with states, flat counter machines, onecounter machines). In freeze LTL
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 329 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
& Putnam Procedure [7], can replace BDDs. This new technique avoids the space blow up of BDDs, generates counterexamples much faster, and sometimes speeds up the verification. In addition, it produces counterexamples of minimal length. We introduce a bounded model checking procedure for LTL
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors
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 574 (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
Model checking freeze LTL over onecounter automata
, 2008
"... We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of regist ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number
Model checking freeze LTL over onecounter automata!
, 2008
"... Abstract. We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the numbe ..."
Abstract
 Add to MetaCart
Abstract. We study complexity issues related to the modelchecking problem for LTL with registers (a.k.a. freeze LTL) over onecounter automata. We consider several classes of onecounter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction
Machine Learning in Automated Text Categorization
 ACM COMPUTING SURVEYS
, 2002
"... The automated categorization (or classification) of texts into predefined categories has witnessed a booming interest in the last ten years, due to the increased availability of documents in digital form and the ensuing need to organize them. In the research community the dominant approach to this p ..."
Abstract

Cited by 1658 (22 self)
 Add to MetaCart
to this problem is based on machine learning techniques: a general inductive process automatically builds a classifier by learning, from a set of preclassified documents, the characteristics of the categories. The advantages of this approach over the knowledge engineering approach (consisting in the manual
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and animated drawings; it is a general purpose system. Sketchpad has shown the most usefulness as an aid to the understanding of processes, such as the notion of linkages, which can be described with pictures. Sketchpad also makes it easy to draw highly repetitive or highly accurate drawings and to change drawings previously drawn with it. The many drawings in this thesis were all made with Sketchpad.
Maté: A Tiny Virtual Machine for Sensor Networks
, 2002
"... Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopulate. ..."
Abstract

Cited by 502 (21 self)
 Add to MetaCart
late. Often there is no feasible method to recharge motes, so energy is a precious resource. Once deployed, a network must be reprogrammable although physically unreachable, and this reprogramming can be a significant energy cost. We present Maté, a tiny communicationcentric virtual machine designed
Results 1  10
of
417,307