Sciweavers

155 search results - page 11 / 31
» Vicinity Respecting Homomorphisms for Abstracting System Req...
Sort
View
DATE
2010
IEEE
168views Hardware» more  DATE 2010»
14 years 27 days ago
Verifying UML/OCL models using Boolean satisfiability
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
Mathias Soeken, Robert Wille, Mirco Kuhlmann, Mart...
PERCOM
2009
ACM
14 years 9 months ago
DiaSim: A Parameterized Simulator for Pervasive Computing Applications
Abstract--Pervasive computing applications involve both software concerns, like any software system, and integration concerns, for the constituent networked devices of the pervasiv...
Wilfried Jouve, Julien Bruneau, Charles Consel
CSL
2004
Springer
14 years 2 months ago
Unsound Theorem Proving
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Christopher Lynch
WORDS
2003
IEEE
14 years 1 months ago
Input-Dependency Analysis for Hard Real-Time Software
The execution time of software for hard real-time systems must be predictable. Further, safe and not overly pessimistic bounds for the worst-case execution time (WCET) must be com...
Jan Gustafsson, Björn Lisper, Raimund Kirner,...
INFOCOM
2009
IEEE
14 years 3 months ago
Routing Metric Designs for Greedy, Face and Combined-Greedy-Face Routing
Abstract—Different geographic routing protocols have different requirements on routing metric designs to ensure proper operation. Combining a wrong type of routing metric with a ...
Yujun Li, Yaling Yang, Xianliang Lu