Lab for Automated Reasoning and Analysis LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
sav08:simple_programming_language [2009/02/22 16:48]
vkuncak
sav08:simple_programming_language [2009/02/25 09:50] (current)
vkuncak
Line 22: Line 22:
 Each program has a finite number of integer variables. Each program has a finite number of integer variables.
  
-What you would expect from the corresponding subset of Java, but integers are true mathematical integers.+The meaning is what you would expect from the corresponding subset of Java, but integers are true mathematical integers.
  
 Example program: Example program:
Line 41: Line 41:
   * [[wp>​Rice'​s theorem]]: all properties of programs that are expressed in terms of the results that the programs compute (and not in terms of the structure of programs) are undecidable   * [[wp>​Rice'​s theorem]]: all properties of programs that are expressed in terms of the results that the programs compute (and not in terms of the structure of programs) are undecidable
  
-Note: in real programming languages we have bounded integers, but we have other sources of unboundedness, such as lengths ​of linked lists that programs ​manipulate.+Note: in real programming languages we have bounded integers, but we have other sources of unboundedness 
 +  * example: sizes of linked lists and other containers 
 +  * bignums 
 +  * program syntax trees for an interpreter or compiler (would like to handle ​programs ​of any size)
  
 
sav08/simple_programming_language.txt · Last modified: 2009/02/25 09:50 by vkuncak
 
© EPFL 2018 - Legal notice