Sciweavers

2076 search results - page 251 / 416
» Functional logic overloading
Sort
View
CCL
1994
Springer
15 years 7 months ago
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Tomás E. Uribe, Mark E. Stickel
ALP
1990
Springer
15 years 7 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
AGP
1998
IEEE
15 years 7 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
FPL
2000
Springer
155views Hardware» more  FPL 2000»
15 years 7 months ago
Synthesis and Implementation of RAM-Based Finite State Machines in FPGAs
This paper discusses the design and implementation of finite state machines (FSM) with combinational circuits that are built primarily from RAM blocks. It suggests a novel state as...
Valery Sklyarov
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 7 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge