Sciweavers

3738 search results - page 536 / 748
» Parametrized Logic Programming
Sort
View
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 1 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
117
Voted
CADE
2010
Springer
15 years 1 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
111
Voted
CADE
2010
Springer
15 years 1 months ago
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Craig interpolation has become a versatile tool in formal verification, for instance to generate intermediate assertions for safety analysis of programs. Interpolants are typically...
Angelo Brillout, Daniel Kroening, Philipp Rüm...
92
Voted
AIR
2010
95views more  AIR 2010»
15 years 23 days ago
A taxonomy of argumentation models used for knowledge representation
Understanding argumentation and its role in human reasoning has been a continuous subject of investigation for scholars from the ancient Greek philosophers to current researchers ...
Jamal Bentahar, Bernard Moulin, Micheline Bé...
98
Voted
APAL
2008
90views more  APAL 2008»
15 years 23 days ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger