Sciweavers

18 search results - page 2 / 4
» Finite Differencing of Logical Formulas for Static Analysis
Sort
View
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
12 years 12 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 4 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 9 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
DATE
2003
IEEE
76views Hardware» more  DATE 2003»
13 years 10 months ago
Modeling Noise Transfer Characteristic of Dynamic Logic Gates
Dynamic noise analysis is recently gaining more attention as a definitive method to overcome glaring deficiencies of static noise analysis. Exact dynamic noise analysis requires...
Li Ding 0002, Pinaki Mazumder
CP
2006
Springer
13 years 8 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka