Sciweavers

4386 search results - page 652 / 878
» A Tamper-Resistant Programming Language System
Sort
View
154
Voted
AMAST
2010
Springer
14 years 10 months ago
Proving Termination Properties with mu-term
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
Beatriz Alarcón, Raúl Gutiérr...
139
Voted
TCS
2011
14 years 10 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
151
Voted
ICLP
2005
Springer
15 years 9 months ago
Small Proof Witnesses for LF
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
Susmit Sarkar, Brigitte Pientka, Karl Crary
131
Voted
CP
2004
Springer
15 years 9 months ago
Global Constraints for Integer and Set Value Precedence
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...
Yat Chiu Law, Jimmy Ho-Man Lee
PADL
2009
Springer
16 years 4 months ago
Ad Hoc Data and the Token Ambiguity Problem
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...
Qian Xi, Kathleen Fisher, David Walker, Kenny Qili...