Sciweavers

2076 search results - page 189 / 416
» Functional logic overloading
Sort
View
139
Voted
DIAGRAMS
2004
Springer
15 years 7 months ago
What Can Spider Diagrams Say?
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalen...
Gem Stapleton, John Howse, John Taylor, Simon J. T...
121
Voted
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Fast synthesis of exact minimal reversible circuits using group theory
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
Guowu Yang, Xiaoyu Song, William N. N. Hung, Marek...
FASE
2008
Springer
15 years 5 months ago
A Model Checking Approach for Verifying COWS Specifications
We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. ...
Alessandro Fantechi, Stefania Gnesi, Alessandro La...
143
Voted
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 3 months ago
A Toolkit for Scalable Spreadsheet Visualization
This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data Logical areas, semantic classes and data modules are abstract represe...
Markus Clermont
120
Voted
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 3 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini