Sciweavers

43 search results - page 4 / 9
» Proving Theorems in a Multi-Source Environment
Sort
View
GG
2008
Springer
14 years 10 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
AIMSA
1998
Springer
15 years 1 months ago
A Blackboard Architecture for Guiding Interactive Proofs
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
Christoph Benzmüller, Volker Sorge
LPAR
2004
Springer
15 years 2 months ago
Second-Order Matching via Explicit Substitutions
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Flávio L. C. de Moura, Fairouz Kamareddine,...
ALP
1990
Springer
15 years 1 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
POPL
2007
ACM
15 years 10 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might