Sciweavers

1115 search results - page 61 / 223
» An Abstract Look at Realizability
Sort
View
ISCAS
2003
IEEE
135views Hardware» more  ISCAS 2003»
15 years 9 months ago
Formal verification of LTL formulas for SystemC designs
To handle today’s complexity, modern circuits and systems be specified at a high level of abstraction. Recently, SystemC has been proposed as a language that allows a fast on o...
Daniel Große, Rolf Drechsler
AGP
2010
IEEE
15 years 9 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
GI
2009
Springer
15 years 9 months ago
Constraint Functional Multicore Programming
: In this paper we present the concurrent constraint functional programming CCFL and an abstract machine for the evaluation of CCFL programs in a multicore environment. The source ...
Petra Hofstedt, Florian Lorenzen
ECAI
1994
Springer
15 years 8 months ago
Similarity for Analogical Software Reuse: A Computational Model
This paper describes a computational model of similarity developed to support analogical software reuse. Similarity is computed from conceptual descriptions of software artifacts o...
George Spanoudakis, Panos Constantopoulos
AAAI
2007
15 years 6 months ago
A Modular Action Description Language for Protocol Composition
Protocols are modular abstractions that capture patterns of interaction among agents. The compelling vision behind protocols is to enable creating customized interactions by refi...
Nirmit Desai, Munindar P. Singh