Sciweavers

2473 search results - page 141 / 495
» The Logic of Communication Graphs
Sort
View
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
14 years 7 months ago
Soft error reduction in combinational logic using gate resizing and flipflop selection
Soft errors in logic are emerging as a significant reliability problem for VLSI designs. This paper presents novel circuit optimization techniques to mitigate soft error rates (SE...
Rajeev R. Rao, David Blaauw, Dennis Sylvester
ICLP
1997
Springer
14 years 2 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
CADE
2009
Springer
14 years 10 months ago
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
Florian Widmann, Rajeev Goré
POPL
2000
ACM
14 years 2 months ago
(Optimal) Duplication is not Elementary Recursive
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
Andrea Asperti, Paolo Coppola, Simone Martini
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
14 years 2 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani