1418 search results - page 237 / 284 » The Dynamic Complexity of Formal Languages |
142
Voted
ECOOP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
304
click to vote
CIDR
2011
14 years 8 months ago
2011
Cloud computing provides users near instant access to seemingly unlimited resources, and provides service providers the opportunity to deploy complex information technology infras...
154
click to vote
VLSID
2002
IEEE
16 years 5 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
161
click to vote
CADE
2008
Springer
16 years 5 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
145
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...