Sciweavers

1187 search results - page 10 / 238
» Graph-Based Procedural Abstraction
Sort
View
LPAR
2005
Springer
15 years 3 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
ECBS
2006
IEEE
135views Hardware» more  ECBS 2006»
15 years 1 months ago
Model Checking Procedures for Infinite State Systems
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
Nikola Bogunovi, Edgar Pek
LPAR
2004
Springer
15 years 3 months ago
Abstract DPLL and Abstract DPLL Modulo Theories
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...
Robert Nieuwenhuis, Albert Oliveras, Cesare Tinell...
LPAR
2005
Springer
15 years 3 months ago
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
An overview is given of a number of recent developments in SAT and SAT Modulo Theories (SMT). In particular, based on our k of Abstract DPLL and Abstract DPLL modulo Theories, we e...
Robert Nieuwenhuis, Albert Oliveras
ICSE
1993
IEEE-ACM
15 years 1 months ago
Procedure Calls Are the Assembly Language of Software Interconnection: Connectors Deserve First-Class Status
Software designers compose systems from components written in some prolanguage. They regularly describe systems using abstract patterns and sophisticated relations among component...
Mary Shaw