Sciweavers

2722 search results - page 515 / 545
» Automating Language Evolution
Sort
View
CSL
2009
Springer
15 years 10 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 10 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
CSL
2006
Springer
15 years 10 months ago
Nonmonotonic Logics and Their Algebraic Foundations
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
Miroslaw Truszczynski
FLOPS
2006
Springer
15 years 10 months ago
Contracts as Pairs of Projections
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Robert Bruce Findler, Matthias Blume
FLOPS
2008
Springer
15 years 8 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...