Sciweavers

LPAR
2010
Springer
13 years 10 months ago
How to Universally Close the Existential Rule
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
Kai Brünnler
LPAR
2010
Springer
13 years 10 months ago
Aligators for Arrays (Tool Paper)
This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out i...
Thomas A. Henzinger, Thibaud Hottelier, Laura Kov&...
LPAR
2010
Springer
13 years 10 months ago
Lazy Abstraction for Size-Change Termination
traction for Size-Change Termination
Michael Codish, Carsten Fuhs, Jürgen Giesl, P...
LPAR
2010
Springer
13 years 10 months ago
PBINT, A Logic for Modelling Search Problems Involving Arithmetic
Shahab Tasharrofi, Eugenia Ternovska
LICS
2010
IEEE
13 years 10 months ago
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
Vincent Danos, Jérôme Feret, Walter F...
LICS
2010
IEEE
13 years 10 months ago
An Extension of Data Automata that Captures XPath
Mikolaj Bojanczyk, Slawomir Lasota
LICS
2010
IEEE
13 years 10 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
LICS
2010
IEEE
13 years 10 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
LICS
2010
IEEE
13 years 10 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...