Results 1  10
of
470,607
Model Checking Programs
, 2003
"... The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers, proof checkers and model checkers. In this pape ..."
Abstract

Cited by 592 (63 self)
 Add to MetaCart
environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle big states, and partial order and symmetry reduction
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra
 Journal of the ACM
, 1995
"... We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is sufficient ..."
Abstract

Cited by 199 (9 self)
 Add to MetaCart
We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method
Motion Graphs
, 2002
"... In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The motion graph consists both of pieces of original motion ..."
Abstract

Cited by 380 (6 self)
 Add to MetaCart
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The motion graph consists both of pieces of original motion
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
"... In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property of almost all of these calculi is that reasoning in them can be understood as solving a binary constraint satisfaction p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
problem over infinite domains. The main algorithmic method that is used is constraint propagation in the form of the pathconsistency method. This approach can be applied to a wide range of different aspects of spatial reasoning. We describe how to make use of this representation and reasoning technique
Computing Geodesic Paths on Manifolds
 Proc. Natl. Acad. Sci. USA
, 1998
"... The Fast Marching Method [8] is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. A ..."
Abstract

Cited by 294 (28 self)
 Add to MetaCart
. As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulated manifolds. 1 Introduction Sethian`s Fast Marching Method [8], is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M
Reasoning about Temporal Relatio A Maximal Tractable Su of Alllen's Interval Algebra*
"... Abstract We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is ..."
Abstract
 Add to MetaCart
Abstract We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method
A Model for Reasoning About Bidimensional Temporal Relations
, 1998
"... This paper introduces the rectangle algebra as the power set of the set of the pairs of atomic relations which can hold between two rational intervals. It goes on proving that the question of the consistency of a rectangle network which constraints are preconvex is decidable by means of the pa ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
of the pathconsistency method in time polynomial in the length of the network. 1 Introduction Temporal and spatial dependencies between data constitute the reason for existence of several problems in computer science : geographical information systems, natural language understanding, specification
The Augmented Interval and Rectangle Networks
"... We augment Allen's Interval Algebra networks and Rectangle Algebra networks by quantitative constraints represented by ST Ps. With the help of polynomial algorithms based on the traditional and weak pathconsistency methods, we prove the tractability of the consistency problem of preconv ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We augment Allen's Interval Algebra networks and Rectangle Algebra networks by quantitative constraints represented by ST Ps. With the help of polynomial algorithms based on the traditional and weak pathconsistency methods, we prove the tractability of the consistency problem
Fast Marching Methods
 SIAM Review
, 1998
"... Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms. They are opti ..."
Abstract

Cited by 215 (5 self)
 Add to MetaCart
Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms
SOS: Secure overlay services
 In Proceedings of ACM SIGCOMM
, 2002
"... angelos,misra,danr¥ Denial of service (DoS) attacks continue to threaten the reliability of networking systems. Previous approaches for protecting networks from DoS attacks are reactive in that they wait for an attack to be launched before taking appropriate measures to protect the network. This lea ..."
Abstract

Cited by 253 (15 self)
 Add to MetaCart
. This leaves the door open for other attacks that use more sophisticated methods to mask their traffic. We propose an architecture called Secure Overlay Services (SOS) that proactively prevents DoS attacks, geared toward supporting Emergency Services or similar types of communication. The architecture
Results 1  10
of
470,607