1410 search results - page 233 / 282 » Proving theorems by reuse |
ICCAD
2007
IEEE
14 years 1 months ago
2007
IEEE
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
ADG
2006
Springer
14 years 1 months ago
2006
Springer
We present an application of an automatic theorem proving (ATP) in the verification of constructions made with dynamic geometry software (DGS). Given a specification language for g...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
The AgentSpeak agent-oriented programming language has recently been extended with a number of new features, such as speech-act based communication, internal belief additions, and...
FSTTCS
2006
Springer
14 years 1 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
KR
2000
Springer
14 years 1 months ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...