Sciweavers

3047 search results - page 326 / 610
» On the Meaning of Logical Completeness
Sort
View
ESOP
2009
Springer
15 years 11 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
194
Voted
CF
2004
ACM
15 years 11 months ago
Platform-independent methodology for partial reconfiguration
In this paper we present a novel methodology for partial (re-)configuration that can be used for most bitstream configured hardware (HW). In particular low priced and not for part...
Dirk Koch, Jürgen Teich
CODES
2004
IEEE
15 years 11 months ago
System-on-chip validation using UML and CWL
In this paper, a novel method for high-level specification and validation of SoC designs using UML is proposed. UML is introduced as a formal model of specification for SoC design...
Qiang Zhu, Ryosuke Oishi, Takashi Hasegawa, Tsuneo...
CP
2006
Springer
15 years 11 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
ECAI
1998
Springer
15 years 11 months ago
Ideal Agents Sharing (some!) Knowledge
A well-known framework by Fagin, Halpern, Moses and Vardi models knowledge-based agents as \Interpreted Systems". In this paper we analyse a particular class of interpreted sy...
Alessio Lomuscio, Mark Ryan