Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Towards automated pr ...
Article

Towards automated proofs of observational properties

Narjes Berregeb (1), Riadh Robbana (1), Ashish Tiwari (2)
(1) Laboratoire d'Informatique, de Parallélisme et de Productique
(2) SRI International [Menlo Park]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2004
Last modified on
March 31, 2025
Volume 6
vol. 6:2
DOI
10.46298/dmtcs.331
License
https://about.hal.science/hal-authorisation-v1
Indicators
637
Views
594
Downloads

Towards automated proofs of observational properties

Narjes Berregeb (1), Riadh Robbana (1), Ashish Tiwari (2)
(1) Laboratoire d'Informatique, de Parallélisme et de Productique
(2) SRI International [Menlo Park]
Abstract
Observational theories are a generalization of first-order theories where two objects are observationally equal if they cannot be distinguished by experiments with observable results. Such experiments, called contexts, are usually infinite. Therfore, we consider a special finite set of contexts, called cover-contexts, ''\emphcovering'' all the observable contexts. Then, we show that to prove that two objects are observationally equal, it is sufficient to prove that they are equal (in the classical sense) under these cover-contexts. We give methods based on rewriting techniques, for constructing such cover-contexts for interesting classes of observational specifications.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • observational
  • contexts
  • rewriting
Preview
Loading PDF preview...