Sciweavers

Share
LPAR
2005
Springer
9 years 9 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...
LPAR
2005
Springer
9 years 9 months ago
Model Checking Abstract State Machines with Answer Set Programming
ECKING ABSTRACT STATE MACHINES WITH ANSWER SET PROGRAMMING by Calvin Kai Fan Tang B.Sc., Simon Fraser University, 2003 a thesis submitted in partial fulfillment of the requirements...
Calvin Kai Fan Tang, Eugenia Ternovska
LPAR
2005
Springer
9 years 9 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
LPAR
2005
Springer
9 years 9 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
LPAR
2005
Springer
9 years 9 months ago
The Theorema Environment for Interactive Proof Development
Abstract. We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the...
Florina Piroi, Temur Kutsia
LPAR
2005
Springer
9 years 9 months ago
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
Alessandro Dal Palù, Agostino Dovier, Enric...
LPAR
2005
Springer
9 years 9 months ago
Monotone AC-Tree Automata
Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yv...
LPAR
2005
Springer
9 years 9 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
LPAR
2005
Springer
9 years 9 months ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
books