Sciweavers

2145 search results - page 202 / 429
» Lax Logical Relations
Sort
View
CHARME
1999
Springer
100views Hardware» more  CHARME 1999»
14 years 17 days ago
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
Mark Aagaard, Thomas F. Melham, John W. O'Leary
AUSAI
1998
Springer
14 years 15 days ago
cardTAP: Automated Deduction on a Smart Card
We present the rst implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus.1 Due to the limited resource...
Andrew Slater, Rajeev Goré, Joachim Posegga...
CADE
1992
Springer
14 years 11 days ago
Little Theories
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theor...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
KBSE
1995
IEEE
13 years 11 months ago
Towards an Epistemology for Software Representations
The KBSE community is actively engaged in finding ways to represent software and the activities that relate to various stages in its lifecycle. While the wealth of modeling activ...
Christopher A. Welty
AAAI
2007
13 years 10 months ago
Forgetting Actions in Domain Descriptions
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
Esra Erdem, Paolo Ferraris