Filters








2,176 Hits in 3.8 sec

To Goto Where No Statement Has Gone Before [chapter]

Mike Barnett, K. Rustan M. Leino
2010 Lecture Notes in Computer Science  
The input is the low-level code represented as blocks of code connected by goto statements, i.e., a control flow graph (CFG).  ...  The derived expression is in a form that can be used as input to an automatic theorem prover.  ...  Acknowledgements We would like to thank Manuel Fähndrich, Francesco Logozzo, and Michał Moskal for valuable help and insight. Comments by the anonymous referees were also helpful.  ... 
doi:10.1007/978-3-642-15057-9_11 fatcat:eae6pv2qrfghrn3p6snl3eqs64

Page 520 of The Westminster Review Vol. 117, Issue 232 [page]

1882 The Westminster Review  
During the twenty years following, from 1858 to 1878, this augmentation has gone on increasing at the rate of at least 40 per centum per annum, up to the latest grant.  ...  We have no record of what the expenses were from 1784 to 1790, the date of his decease; but his successor, Lieut.- Colonel Mudge, furnishes a statement of the cost from that year to 1810, as follows :—  ... 

Ordinal computers [article]

Ryan Bissell-Siders
1998 arXiv   pre-print
We prove that they theory of second order arithmetic cannot be decided by computers running to countable time.  ...  No. Not, at least, for the infinite computer we describe. Our computer gets more powerful when the set of its steps gets larger.  ...  This is true if we take halting to mean halting in finite time, ordinal time, halting before 10 timesteps have gone by, or before an uncountable number of timesteps have passed.  ... 
arXiv:math/9804076v1 fatcat:jbl6wpa7fzhwfh7ywpdpwfnruy

Loop exits and structured programming

Eric S. Roberts
1995 Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education - SIGCSE '95  
To copy otherwise, or to republish, requires a fee and/or specific permission.  ...  Without access to those facilities, students are often incapable of solving simple programming problems that occur frequently in applications.  ...  the goto statement in a well-structured program.  ... 
doi:10.1145/199688.199815 dblp:conf/sigcse/Roberts95a fatcat:t24ga6fih5hknfekmybdychf4a

Loop exits and structured programming

Eric S. Roberts
1995 ACM SIGCSE Bulletin  
To copy otherwise, or to republish, requires a fee and/or specific permission.  ...  Without access to those facilities, students are often incapable of solving simple programming problems that occur frequently in applications.  ...  the goto statement in a well-structured program.  ... 
doi:10.1145/199691.199815 fatcat:qyeomqvlzbgd3im3gfmivfp6xa

Page 86 of Central Law Journal Vol. 22, Issue [page]

1886 Central Law Journal  
, whereas there was no real expectation or intention of so laying out the money, though if all had gone on well it might at some future time have been done.]  ...  But, as I said before, I do not think it necessary to say what, supposing that had been the only mis-statement, the court might have done, be- cause I think that each of the statements and the whole of  ... 

Circular expressions: Elimination of static environments [chapter]

Ravi Sethi
1981 Lecture Notes in Computer Science  
Consider the connection between denotational semantics for a language with goto statements and flow diagrams for programs in such a language.  ...  The main point of interest is that the denotational semantics uses a recursively defined environment to give the meaning of labels, while a flow diagram merely has a jump to the appropriate program point  ...  A goto statement is handled by using the continuation of the label gone to: recall that the continuation for a label can be determined by applying a suitable environment to the label.  ... 
doi:10.1007/3-540-10843-2_31 fatcat:wnpnodncafd55ebeyrld6v64xq

A critique of the foundations of Hoare style programming logics

Michael J. O'Donnell
1982 Communications of the ACM  
Too little attention has been given to precise criticism of specific proposed systems for reasoning about programs.  ...  Much recent discussion in computing journals has been devoted to arguments about the feasibility and usefulness of formal verification methods for increasing confidence in computer programs.  ...  First, Composition-l must be replaced by: A{P}B, B{Q}C Compo si t ion-2: ------------ A{p;QlC where there are no Goto branches from p to Q or Q to P.  ... 
doi:10.1145/358728.358748 fatcat:vdvubnlvenewdadzliaui2rpce

Limitations of Dijkstra's Semaphore Primitives and Petri nets

S. Rao Kosaraju
1973 Proceedings of the fourth symposium on Operating system principles - SOSP '73  
We also show that even the general Petri nets will not be able to handle some synchronization problemsj contradicting a conjecture of Patil (P.28 [7]) . I.  ...  Recently various attempts have been made to study the limitations of Dijkstr~s semaphore primitives for the synchronization problem of cooperating sequential processes [3, 4,6, 8] .  ...  We allow any assignment statement of the form Yje f(Yi,Y2,...,Ym), where f is any function.  ... 
doi:10.1145/800009.808062 dblp:conf/sosp/Kosaraju73 fatcat:6axjwehdyvckxdgk6hdcy4acz4

The equivalence of models of tasking

Daniel M. Berry
1972 ACM SIGACT News  
A technique for proving the equivalence of implementations of multi-tasking programming languages is developed and applied to proving the equivalence of the contour model and a multi-tasking version of  ...  Special thanks go to Clem MeGowan for encouragement in extending to the proof techniques used in this paper.  ...  Finally, thanks go to Trina Avery for sacrificing her time in the final production of this paper.  ... 
doi:10.1145/942580.807084 fatcat:dhvmbxhb7jfsbjda45orlhmwii

The equivalence of models of tasking

Daniel M. Berry
1972 Proceedings of ACM conference on Proving assertions about programs -  
A technique for proving the equivalence of implementations of multi-tasking programming languages is developed and applied to proving the equivalence of the contour model and a multi-tasking version of  ...  Special thanks go to Clem MeGowan for encouragement in extending to the proof techniques used in this paper.  ...  Finally, thanks go to Trina Avery for sacrificing her time in the final production of this paper.  ... 
doi:10.1145/800235.807084 fatcat:lev4246ppbglddhnp25xcasz2u

Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth [article]

Sanjay Jain, Xiaodong Jia, Ammar Fathin Sabili, Frank Stephan
2021 arXiv   pre-print
current bound on the number of registers for multiplying and dividing fast (running in time linear in the size of the input) can be improved and whether one can output fast the powers of two summing up to  ...  A statement of the form "let x = x + m;" where m is a constant is replaced by "let x = x + a • m", the reason is that the actual value of x is a • x and if a is −1, then one has to adjust all the comparisons  ...  The runtime for the squaring has to be O(n) where n is the number of bits of the input while for the integer division, the algorithm has to run in time linear in the number of bits of the output, note  ... 
arXiv:2111.08969v1 fatcat:zv66xuiptrbafiw3tq6bqdqaxm

Page 251 of Dwight's American Magazine, and Family Newspaper. . . For the Diffusion of Useful Knowledge and Moral and Religious Principles Vol. 2, Issue 16 [page]

1846 Dwight's American Magazine, and Family Newspaper. . . For the Diffusion of Useful Knowledge and Moral and Religious Principles  
In the course of these lectures, he has made some interesting statements respecting the antiquity of the empire.  ...  (zone, I say, to the South and West; the trumpet is blow- ing among them to goto Texas!  ... 

The equivalence of models of tasking

Daniel M. Berry
1972 SIGPLAN notices  
A technique for proving the equivalence of implementations of multi-tasking programming languages is developed and applied to proving the equivalence of the contour model and a multi-tasking version of  ...  Special thanks go to Clem MeGowan for encouragement in extending to the proof techniques used in this paper.  ...  Finally, thanks go to Trina Avery for sacrificing her time in the final production of this paper.  ... 
doi:10.1145/942578.807084 fatcat:odqzt4rodfbbvkzsqn5gsgasci

Page 5 of Rambler; A Catholic Journal and Review of Home and Foreign Literature Vol. 2, Issue 19 [page]

1848 Rambler; A Catholic Journal and Review of Home and Foreign Literature  
Where am I to goto, wanttoknow? How am I to live, if 1 am turned off from my situation?  ...  We must wait before we settle any thing; we must indeed. But now do tell me what all this is that has happened.”  ... 
« Previous Showing results 1 — 15 out of 2,176 results