Sciweavers

1461 search results - page 253 / 293
» Analysis of Constraint Logic Programs
Sort
View
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
14 years 8 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
COOPIS
1998
IEEE
14 years 9 hour ago
Towards an Inductive Design of Distributed Object Oriented Databases
Cooperative Information Systems (CIS) often consist of applications that access shared resources such as databases. Since centralized systems may have a great impact on the system...
Fernanda Araujo Baião, Marta Mattoso, Gerso...
CGO
2005
IEEE
14 years 1 months ago
Sentinel PRE: Hoisting beyond Exception Dependency with Dynamic Deoptimization
Many excepting instructions cannot be removed by existing Partial Redundancy Elimination (PRE) algorithms because the ordering constraints must be preserved between the excepting ...
Rei Odaira, Kei Hiraki
FMCO
2003
Springer
162views Formal Methods» more  FMCO 2003»
14 years 29 days ago
An MDA Approach to Tame Component Based Software Development
Abstract. The aim of this paper is to show how the Model Driven Architecture (MDA) can be used in relation with component based software engineering. A software component only exhi...
Jean-Marc Jézéquel, Olivier Defour, ...