Sciweavers

4513 search results - page 526 / 903
» Logic programming with satisfiability
Sort
View
POPL
2010
ACM
16 years 2 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...
ICSE
2010
IEEE-ACM
15 years 6 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
DAC
2007
ACM
16 years 5 months ago
Alembic: An Efficient Algorithm for CNF Preprocessing
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
HyoJung Han, Fabio Somenzi
WWW
2009
ACM
16 years 5 months ago
Automated synthesis of composite services with correctness guarantee
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
Ting Deng, Jinpeng Huai, Xianxian Li, Zongxia Du, ...
CADE
2008
Springer
16 years 5 months ago
Multi-completion with Termination Tools (System Description)
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
Haruhiko Sato, Sarah Winkler, Masahito Kurihara, A...