Sciweavers

336 search results - page 14 / 68
» Monitoring modulo theories
Sort
View
RTA
1993
Springer
14 years 1 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
Jordi Levy, Jaume Agustí-Cullell
JNS
2008
44views more  JNS 2008»
13 years 9 months ago
The Scaling Attractor and Ultimate Dynamics for Smoluchowski's Coagulation Equations
We describe a basic framework for studying dynamic scaling that has roots in dynamical systems and probability theory. Within this framework, we study Smoluchowski's coagulat...
Govind Menon, Robert L. Pego
CADE
2007
Springer
14 years 10 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CADE
2004
Springer
14 years 3 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
RTA
2007
Springer
14 years 3 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant