Sciweavers

2649 search results - page 437 / 530
» Temporal Theories of Reasoning
Sort
View
VMCAI
2009
Springer
14 years 2 months ago
Thread-Modular Shape Analysis
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sa...
CSFW
2009
IEEE
14 years 2 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
ICRA
2009
IEEE
130views Robotics» more  ICRA 2009»
14 years 2 months ago
Qualitative robot localisation using information from cast shadows
— Recently, cognitive psychologists and others have turned their attention to the formerly neglected study of shadows, and the information they purvey. These studies show that th...
Paulo Santos, Hannah M. Dee, Valquiria Fenelon
LICS
2009
IEEE
14 years 2 months ago
Trace Semantics is Fully Abstract
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...
Sumit Nain, Moshe Y. Vardi
LICS
2009
IEEE
14 years 2 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux