Sciweavers

1291 search results - page 107 / 259
» Arithmetic program paths
Sort
View
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
14 years 4 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 4 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
ICLP
2007
Springer
14 years 4 months ago
HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners
The paper presents a prototype system HD-Rules (Hybrid integration of Description Logic and Rules) that integrates normal clauses under the wellfounded semantics with ontologies sp...
Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszy...
TACAS
2007
Springer
103views Algorithms» more  TACAS 2007»
14 years 4 months ago
A Reachability Predicate for Analyzing Low-Level Software
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
Shaunak Chatterjee, Shuvendu K. Lahiri, Shaz Qadee...
CP
2005
Springer
14 years 3 months ago
Automatic Detection of Variable and Value Symmetries
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
Jean-Francois Puget