493 search results - page 71 / 99 » Bounded LTL Model Checking with Stable Models |
ICCD
1995
IEEE
13 years 11 months ago
1995
IEEE
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
MST
2011
13 years 2 months ago
2011
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
PRDC
2002
IEEE
14 years 14 days ago
2002
IEEE
Feature interaction is a kind of inconsistent conflict between multiple communication services and considered an obstacle to developing reliable telephony systems. In this paper ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper presents an implementation of (a simplified version of) the cognitive agent programming language 3APL in the Maude term rewriting language. Maude is based on t...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Well-defined memory consistency models are necessary for writing correct parallel software. Developing and understanding formal specifications of hardware memory models is a chal...