364 search results - page 43 / 73 » Generalized normal forms and polynomial system solving |
79
Voted
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
BIRTHDAY
2006
Springer
15 years 1 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
SIGCOMM
2006
ACM
15 years 3 months ago
2006
ACM
Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like F...
114
click to vote
DNA
2007
Springer
15 years 3 months ago
2007
Springer
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
102
click to vote
IFM
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...