Sciweavers

756 search results - page 35 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
ICFP
2006
ACM
14 years 8 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 7 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
SIGIR
1998
ACM
14 years 5 days ago
Resolving Ambiguity for Cross-Language Retrieval
Abstract One of the main hurdles to improved CLIR effectiveness is resolving ambiguity associated with translation. Availability of resources is also a problem. First we present a ...
Lisa Ballesteros, W. Bruce Croft
DOOD
1997
Springer
134views Database» more  DOOD 1997»
14 years 3 days ago
Well-Founded Semantics for Deductive Object-Oriented Database Languages
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...
Wolfgang May, Bertram Ludäscher, Georg Lausen
ICFEM
2004
Springer
14 years 1 months ago
Learning to Verify Safety Properties
We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniqu...
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...