Sciweavers

40 search results - page 5 / 8
» Optimizations for Compiling Declarative Models into Boolean ...
Sort
View
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ATVA
2007
Springer
226views Hardware» more  ATVA 2007»
14 years 1 months ago
Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
David Walter, Scott Little, Chris J. Myers
SIGMOD
1993
ACM
93views Database» more  SIGMOD 1993»
13 years 11 months ago
Design and Implementation of the Glue-Nail Database System
We describe the design and implementation of the Glue-Nail database system. The Nail language is a purely declarative query language; Glue is a procedural language used for nonque...
Marcia A. Derr, Shinichi Morishita, Geoffrey Phipp...
ICOODB
2009
246views Database» more  ICOODB 2009»
13 years 5 months ago
Compiler Plugins Can Handle Nested Languages: AST-Level Expansion of LINQ Queries for Java
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
Miguel Garcia
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 2 months ago
A Metric Encoding for Bounded Model Checking
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...