Sciweavers

1809 search results - page 64 / 362
» Software Model Checking Using Linear Constraints
Sort
View
ARTS
1999
Springer
14 years 1 months ago
ProbVerus: Probabilistic Symbolic Model Checking
Model checking can tell us whether a system is correct; probabilistic model checking can also tell us whether a system is timely and reliable. Moreover, probabilistic model checkin...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...
TABLEAUX
2007
Springer
14 years 3 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
CADE
2009
Springer
14 years 9 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
PDPTA
2003
13 years 10 months ago
The Application of Software Process Precedence Relationship Formalisms to Concurrent Hardware Systems
In this paper, precedence constraint combination formalisms defined in the software domain are used to define the behavior of hardware systems. Specifically, AND-join and various ...
Kenneth G. Ricks, David Jeff Jackson, B. Earl Well...
ICPP
2002
IEEE
14 years 1 months ago
Software Caching using Dynamic Binary Rewriting for Embedded Devices
A software cache implements instruction and data caching entirely in software. Dynamic binary rewriting offers a means to specialize the software cache miss checks at cache miss t...
Chad Huneycutt, Joshua B. Fryman, Kenneth M. Macke...