Sciweavers

523 search results - page 17 / 105
» A General Model for Reachability Testing of Concurrent Progr...
Sort
View
SQJ
2002
110views more  SQJ 2002»
13 years 8 months ago
A General Model of Unit Testing Efficacy
Much of software engineering is targeted towards identifying and removing existing defects while preventing the injection of new ones. Defect management is therefore one important ...
Houman Younessi, Panlop Zeephongsekul, Winai Bodhi...
ICALP
2000
Springer
14 years 1 days ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 8 months ago
Formal Relationships Between Geometrical and Classical Models for Concurrency
A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality betwe...
Eric Goubault, Samuel Mimram
SENSYS
2010
ACM
13 years 6 months ago
Efficient diagnostic tracing for wireless sensor networks
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
Vinaitheerthan Sundaram, Patrick Th. Eugster, Xian...
SCAM
2006
IEEE
14 years 2 months ago
Constructing Accurate Application Call Graphs For Java To Model Library Callbacks
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
Weilei Zhang, Barbara G. Ryder