Sciweavers

1147 search results - page 93 / 230
» Termination in language-based systems
Sort
View
ENTCS
2002
84views more  ENTCS 2002»
14 years 9 months ago
Set Types and Applications
We present pmlB, a programming language that includes primitive sets and associated operations. The language is equipped with a precise type discipline that statically captures dy...
Christian Skalka, Scott F. Smith
PIMRC
2008
IEEE
15 years 4 months ago
Free deconvolution for OFDM multicell SNR detection
—In this paper, a new blind OFDM multicell detection method is proposed to determine the number of base stations in a cellular system. Using recent results of free deconvolution,...
Romain Couillet, Mérouane Debbah
SOFSEM
2007
Springer
15 years 4 months ago
Constraints for Argument Filterings
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
Harald Zankl, Nao Hirokawa, Aart Middeldorp
LPNMR
2005
Springer
15 years 3 months ago
Testing Strong Equivalence of Datalog Programs - Implementation and Examples
In this work we describe a system for determining strong equivalence of disjunctive non-ground datalog programs under the stable model semantics. The problem is tackled by reducing...
Thomas Eiter, Wolfgang Faber, Patrick Traxler
FSTTCS
2004
Springer
15 years 3 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn