Sciweavers

446 search results - page 44 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
102
Voted
LICS
2007
IEEE
15 years 6 months ago
Pi-Calculus in Logical Form
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
Marcello M. Bonsangue, Alexander Kurz
124
Voted
LICS
2006
IEEE
15 years 6 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
117
Voted
VSTTE
2012
Springer
13 years 8 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
101
Voted
CADE
2009
Springer
16 years 1 months ago
Ground Interpolation for Combined Theories
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
Amit Goel, Sava Krstic, Cesare Tinelli
107
Voted
CADE
2006
Springer
16 years 25 days ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...