Sciweavers

174 search results - page 17 / 35
» Loop Calculus for Satisfiability
Sort
View
ENTCS
2008
103views more  ENTCS 2008»
14 years 9 months ago
Systematic Semantic Tableaux for PLTL
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
CORR
2006
Springer
116views Education» more  CORR 2006»
14 years 9 months ago
Rewriting modulo in Deduction modulo
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
Frédéric Blanqui
CORR
2004
Springer
123views Education» more  CORR 2004»
14 years 9 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
FPL
2001
Springer
123views Hardware» more  FPL 2001»
15 years 2 months ago
Compilation Increasing the Scheduling Scope for Multi-memory-FPGA-Based Custom Computing Machines
This paper presents new achievements on the automatic mapping of algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable ...
João M. P. Cardoso, Horácio C. Neto
APCSAC
2003
IEEE
15 years 1 months ago
On Implementing High Level Concurrency in Java
Abstract. Increasingly threading has become an important architectural component of programming languages to support parallel programming. Previously we have proposed an elegant la...
G. Stewart Von Itzstein, Mark Jasiunas