Sciweavers

6167 search results - page 953 / 1234
» Can Refinement be Automated
Sort
View
96
Voted
ICST
2009
IEEE
15 years 7 months ago
A Model Building Process for Identifying Actionable Static Analysis Alerts
Automated static analysis can identify potential source code anomalies early in the software process that could lead to field failures. However, only a small portion of static ana...
Sarah Smith Heckman, Laurie A. Williams
IRI
2009
IEEE
15 years 7 months ago
An Agent-based Formal Framework for Modeling and Simulating Supply Chains
We propose an open and extensible agent-based formal framework for modeling and simulating supply chains. Since structures and behaviors of supply chains can be very different bas...
Li Tan, Shenghan Xu, Benjamin Meyer, Brock Erwin
98
Voted
IROS
2009
IEEE
145views Robotics» more  IROS 2009»
15 years 7 months ago
KNOWROB - knowledge processing for autonomous personal robots
— Knowledge processing is an essential technique for enabling autonomous robots to do the right thing to the right object in the right way. Using knowledge processing the robots ...
Moritz Tenorth, Michael Beetz
114
Voted
LICS
2009
IEEE
15 years 7 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
113
Voted
LICS
2009
IEEE
15 years 7 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp