Sciweavers

2137 search results - page 31 / 428
» Proving Abstract Non-interference
Sort
View
RTA
2000
Springer
15 years 1 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
CORR
2011
Springer
193views Education» more  CORR 2011»
14 years 5 months ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
JSYML
2011
89views more  JSYML 2011»
14 years 4 months ago
Iterative differential Galois theory in positive characteristic: A model theoretic approach
Abstract. This paper introduces a natural extension of Kolchin’s differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-li...
Javier Moreno
NFM
2011
303views Formal Methods» more  NFM 2011»
14 years 4 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
CORR
2011
Springer
180views Education» more  CORR 2011»
14 years 4 months ago
A Formalization of Polytime Functions
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
Sylvain Heraud, David Nowak