Sciweavers

101 search results - page 9 / 21
» A New Class of Decidable Hybrid Systems
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
IJCAI
2003
13 years 9 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
NOMS
2000
IEEE
138views Communications» more  NOMS 2000»
14 years 4 days ago
Policy-based hybrid management architecture for IP-based VPN
Using IP-based Virtual Private Network (IP-VPN) technology, a company can establish its virtual private network over public networks. Recently, IP-VPN emerges as one of main techn...
Seung-Jin Baek, Moon-Sang Jeong, Jong-Tae Park, Ta...
FROCOS
2007
Springer
14 years 1 months ago
Languages Modulo Normalization
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Hitoshi Ohsaki, Hiroyuki Seki
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Secure Hybrid Encryption from Weakened Key Encapsulation
We put forward a new paradigm for building hybrid encryption schemes from constrained chosen-ciphertext secure (CCCA) key-encapsulation mechanisms (KEMs) plus authenticated symmet...
Dennis Hofheinz, Eike Kiltz