Sciweavers

269 search results - page 44 / 54
» Verification of Parameterized Systems Using Logic Program Tr...
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 8 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
PPDP
2010
Springer
13 years 6 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
ICLP
1989
Springer
14 years 21 days ago
A Simple Code Improvement Scheme for Prolog
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
Saumya K. Debray
PLDI
2010
ACM
14 years 22 days ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
ICFP
2009
ACM
14 years 9 months ago
Identifying query incompatibilities with evolving XML schemas
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validi...
Nabil Layaïda, Pierre Genevès, Vincent...