8337 search results - page 184 / 1668 » Reasoning With Characteristic Models |
128
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
158
click to vote
SAC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we present an approach for developing adaptable software applications. The problem we are facing is that of a (possibly mobile) user who wants to download and execut...
127
Voted
SIGCOMM
2003
ACM
15 years 10 months ago
2003
ACM
Launching a denial of service (DoS) attack is trivial, but detection and response is a painfully slow and often a manual process. Automatic classification of attacks as single- o...
141
Voted
ICALP
1998
Springer
15 years 9 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
129
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
The functional characteristics of market-based solutions are typically best observed through the medium of simulation, data-gathering and subsequent visualization. We previously d...