3147 search results - page 356 / 630 » Open-Source Model Checking |
128
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
We investigate NLTL, a linear-time temporal logic with forgettable past. NLTL can be exponentially more succinct than LTL + Past (which in turn can be more succinct than LTL). We ...
144
click to vote
PRDC
2002
IEEE
15 years 9 months 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 ...
129
click to vote
CSFW
2006
IEEE
15 years 8 months ago
2006
IEEE
A distributed calculus is proposed for describing networks of services. We model service interaction through a call-by-property invocation mechanism, by specifying the security co...
124
click to vote
FCS
2006
15 years 5 months ago
2006
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
136
click to vote
FUIN
2008
15 years 4 months ago
2008
The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete d...