1710 search results - page 212 / 342 » High-Level Programs and Program Conditions |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
ENTCS
2006
13 years 9 months ago
2006
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
JCS
2007
13 years 9 months ago
2007
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have specified an information flow ty...
AI
1999
Springer
13 years 9 months ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...