Results 1  10
of
1,177
Automated Consistency Checking of Requirements Specifications
, 1996
"... This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed i ..."
Abstract

Cited by 270 (33 self)
 Add to MetaCart
finite state automaton, which produces externally visible outputs in response to changes in monitored environmental quantities. Results are presented of two experiments which evaluated the utility and sealability of our technique for consistency checking in a realworld avionics application. The role
OutputSensitive Visibility Algorithms for Dynamic Scenes with Applications to Virtual Reality
, 1996
"... An outputsensitive visibility algorithm is one whose runtime is proportional to the number of visible graphic primitives in a scene modelnot to the total number of primitives, which can be much greater. The known practical outputsensitive visibility algorithms are suitable only for static scene ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
An outputsensitive visibility algorithm is one whose runtime is proportional to the number of visible graphic primitives in a scene modelnot to the total number of primitives, which can be much greater. The known practical outputsensitive visibility algorithms are suitable only for static
Testing with Model Checker: Insuring Fault Visibility
 WSEAS Trans. Sys
, 2003
"... To detect a fault in software, a test case execution must enable an intermediate error to propagate to the output. We describe two specificationbased mutation testing methods that use a model checker to guarantee propagation of faults to the visible outputs. We evaluate the methods empirically and ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
To detect a fault in software, a test case execution must enable an intermediate error to propagate to the output. We describe two specificationbased mutation testing methods that use a model checker to guarantee propagation of faults to the visible outputs. We evaluate the methods empirically
The VolumePro RealTime RayCasting System
, 1999
"... This paper describes VolumePro, the world's first singlechip realtime volume rendering system for consumer PCs. VolumePro implements raycasting with parallel slicebyslice processing. Our discussion of the architecture focuses mainly on the rendering pipeline and the memory organization. Vol ..."
Abstract

Cited by 194 (10 self)
 Add to MetaCart
. VolumePro has hardware for gradient estimation, classification, and persample Phong illumination. The system does not perform any preprocessing and makes parameter adjustments and changes to the volume data immediately visible. We describe several advanced features of VolumePro, such as gradient
Global Visibility
, 1997
"... Solving the hidden surface removal is an essential problem since the early time of computer graphics. Most of the algorithms designed, like zbuffer or BSPtree, are not outputsensitive what means, that their time complexity is proportional to the total number of graphic primitives in the model. Ho ..."
Abstract
 Add to MetaCart
. However, in many complex models most their parts are invisible to an observer while located in certain region. This observation yields a search to design outputsensitive algorithms with the runtime complexity (time of rendering) proportional to the number of visible graphic primitives. We present one
Topologically Sweeping Visibility Complexes via Pseudotriangulations
, 1996
"... This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal run ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal
Designing Calm Technology
 POWERGRID JOURNAL
, 1996
"... Bits flowing through the wires of a computer network are ordinarily invisible. But a radically new tool shows those bits through motion, sound, and even touch. It communicates both light and heavy network traffic. Its output is so beautifully integrated with human information processing that one doe ..."
Abstract

Cited by 177 (0 self)
 Add to MetaCart
Bits flowing through the wires of a computer network are ordinarily invisible. But a radically new tool shows those bits through motion, sound, and even touch. It communicates both light and heavy network traffic. Its output is so beautifully integrated with human information processing that one
VISIBILITY STABS AND DEPTHFIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
 INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
, 1998
"... Given a set S of n nonintersecting line segments in the plane, we present a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygon ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Given a set S of n nonintersecting line segments in the plane, we present a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility
Properties of Visibly Pushdown Transducers
 35TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
, 2010
"... Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly pushdown languages form a robust subclass of ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly pushdown languages form a robust subclass
Results 1  10
of
1,177