Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

On model checking data-independent systems with arrays with whole-array operations

Tools
- Tools
+ Tools

UNSPECIFIED (2005) On model checking data-independent systems with arrays with whole-array operations. In: Symposium on 25 Years of Communicating Sequential Processes, JUL 07-08, 2004, London S Bank Univ, London, ENGLAND.

Full text not available from this repository.

Abstract

We consider programs which are data independent with respect to two type variables X and Y, and can in addition use arrays indexed by X and storing values from Y. We are interested in whether a program satisfies its control-state unreachability specification for all non-empty finite instances of X and Y. The decidability of this problem without whole-array operations is a corollary to earlier results. We address the possible addition of two whole-array operations: an array reset instruction, which sets every element of an array to a particular value, and an array assignment or copy instruction. For programs with reset, we obtain decidability if there is only one array or if Y is fixed to be the boolean type, and we obtain undecidability otherwise. For programs with array assignment, we show that they are more expressive than programs with reset, which yields undecidability if there are at least three arrays. We also obtain undecidability for two arrays directly.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name: LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title: COMMUNICATING SEQUENTIAL PROCESSES: THE FIRST 25 YEARS
Publisher: SPRINGER-VERLAG BERLIN
ISBN: 3-540-25813-2
ISSN: 0302-9743
Editor: Abadallah, AE and Jones, CB and Sanders, JW
Date: 2005
Volume: 3525
Number of Pages: 17
Page Range: pp. 275-291
Publication Status: Published
Title of Event: Symposium on 25 Years of Communicating Sequential Processes
Location of Event: London S Bank Univ, London, ENGLAND
Date(s) of Event: JUL 07-08, 2004
URI: http://wrap.warwick.ac.uk/id/eprint/6752

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us