Sciweavers

4386 search results - page 381 / 878
» A Tamper-Resistant Programming Language System
Sort
View
PPDP
2010
Springer
15 years 1 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
FORTE
2004
15 years 5 months ago
Localizing Program Errors for Cimple Debugging
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
Samik Basu, Diptikalyan Saha, Scott A. Smolka
SIGOPSE
1998
ACM
15 years 8 months ago
Goal-oriented programming, or composition using events, or threads considered harmful
with this, the thread abstraction was introduced. While threads are handling events, or awaiting specific events, unrelated events can be handled by other threads. Unfortunately, ...
Robbert van Renesse
118
Voted
ICFP
2004
ACM
16 years 3 months ago
Types for path correctness of XML queries
d Abstract) Dario Colazzo1 , Giorgio Ghelli2 , Paolo Manghi2 , and Carlo Sartiani2 1 LRI - Universit?e Paris Sud 2 Dipartimento di Informatica - Universit`a di Pisa If a subexpress...
Dario Colazzo, Giorgio Ghelli, Paolo Manghi, Carlo...
ICFP
2003
ACM
16 years 3 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet