On observational equivalence and algebraic specification
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
Computing in Horn clause theories
Computing in Horn clause theories
Initial behavior semantics for algebraic specifications
Lecture notes in Computer Science on Recent trends in data type specification
Theorem-proving with resolution and superposition
Journal of Symbolic Computation
Automating inductionless induction using test sets
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
Towards an adequate notion of observation
ESOP'92 Symposium proceedings on 4th European symposium on programming
Testing for the ground (co-)reducibility property in term-rewriting systems
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Extending Bachmair's method for proof by consistency to the final algebra
Information Processing Letters
Towards an algebraic semantics for the object paradigm
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Automated theorem proving by test set induction
Journal of Symbolic Computation
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Specifications with Observable Formulae and Observational Satisfaction Relation
Selected papers from the 8th Workshop on Specification of Abstract Data Types Joint with the 3rd COMPASS Workshop on Recent Trends in Data Type Specification
Proving the Correctness of Algebraically Specified Software: Modularity and Observability Issues
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Proving the Correctness of Algebraic Implementations by the ISAR System
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
How to Prove Observational Theorems with LP
Proceedings of the first First International Workshop on Larch
Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Implementation of Parameterized Observational Specifications
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Toward Formal Development of ML Programs: Foundations and Methodology (Extended Abstract)
TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Implementing Contextual Rewriting
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Circular Coinductive Rewriting
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
On implementing behavioral rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Formal design and verification of operational transformation algorithms for copies convergence
Theoretical Computer Science - Algebraic methodology and software technology
Closure properties for the class of behavioral models
Theoretical Computer Science
Observational Refinement Process
Electronic Notes in Theoretical Computer Science (ENTCS)
Circular Coinduction with Special Contexts
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Automating coinduction with case analysis
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
| Hi-index | 5.23 |
Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker (Hennicker, Formal Aspects of Computing 3(4) (1991) 326-345). We propose in this paper to embed Context Induction in the implicit induction framework of (Bouhoula and Rusinowitch, Journal of Automated Reasoning 14(2) (1995) 189-235). The proof system we obtain applies to conditional specifications. It allows for many rewriting techniques and for the refutation of false observational conjectures. Under reasonable assumptions our method is refutationally complete, i.e. it can refute any conjecture which is not observationally valid. Moreover this proof system is operational: it has been implemented within the Spike prover and interesting computer experiments are reported.