Sciweavers

504 search results - page 32 / 101
» The Complexity of Symmetry-Breaking Formulas
Sort
View
CONCUR
2011
Springer
12 years 9 months ago
Tractable Reasoning in a Fragment of Separation Logic
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
Byron Cook, Christoph Haase, Joël Ouaknine, M...
JCSS
2007
85views more  JCSS 2007»
13 years 9 months ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...
HASE
2005
IEEE
14 years 3 months ago
Automatic Generation of Executable Assertions for Runtime Checking Temporal Requirements
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
Gergely Pintér, István Majzik
JSC
2007
106views more  JSC 2007»
13 years 9 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
TOSEM
2002
93views more  TOSEM 2002»
13 years 9 months ago
Alloy: a lightweight object modelling notation
Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a set-based formula syntax powerful en...
Daniel Jackson